./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 22:29:07,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 22:29:07,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 22:29:07,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 22:29:07,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 22:29:07,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 22:29:07,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 22:29:07,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 22:29:07,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 22:29:07,818 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 22:29:07,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 22:29:07,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 22:29:07,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 22:29:07,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 22:29:07,820 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 22:29:07,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 22:29:07,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 22:29:07,821 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 22:29:07,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 22:29:07,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 22:29:07,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 22:29:07,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 22:29:07,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 22:29:07,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 22:29:07,821 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 22:29:07,821 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 22:29:07,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 22:29:07,822 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 22:29:07,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 22:29:07,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 22:29:07,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 22:29:07,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 22:29:07,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:29:07,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 22:29:07,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 22:29:07,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 22:29:07,823 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 22:29:07,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 22:29:07,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 22:29:07,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 22:29:07,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 22:29:07,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 22:29:07,824 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2024-11-06 22:29:08,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 22:29:08,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 22:29:08,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 22:29:08,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 22:29:08,091 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 22:29:08,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2024-11-06 22:29:09,350 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 22:29:09,640 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 22:29:09,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2024-11-06 22:29:09,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3891dc82f/96849c60f3b54a779a03666db86878ee/FLAG29c12b3fe [2024-11-06 22:29:09,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3891dc82f/96849c60f3b54a779a03666db86878ee [2024-11-06 22:29:09,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 22:29:09,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 22:29:09,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 22:29:09,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 22:29:09,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 22:29:09,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:29:09" (1/1) ... [2024-11-06 22:29:09,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd9b0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:09, skipping insertion in model container [2024-11-06 22:29:09,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:29:09" (1/1) ... [2024-11-06 22:29:09,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 22:29:09,969 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2024-11-06 22:29:09,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:29:09,987 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 22:29:10,036 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2024-11-06 22:29:10,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:29:10,069 INFO L204 MainTranslator]: Completed translation [2024-11-06 22:29:10,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:10 WrapperNode [2024-11-06 22:29:10,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 22:29:10,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 22:29:10,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 22:29:10,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 22:29:10,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:10" (1/1) ... [2024-11-06 22:29:10,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:10" (1/1) ... [2024-11-06 22:29:10,113 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 174 [2024-11-06 22:29:10,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 22:29:10,114 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 22:29:10,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 22:29:10,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 22:29:10,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:10" (1/1) ... [2024-11-06 22:29:10,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:10" (1/1) ... [2024-11-06 22:29:10,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:10" (1/1) ... [2024-11-06 22:29:10,154 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 18, 10]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2024-11-06 22:29:10,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:10" (1/1) ... [2024-11-06 22:29:10,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:10" (1/1) ... [2024-11-06 22:29:10,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:10" (1/1) ... [2024-11-06 22:29:10,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:10" (1/1) ... [2024-11-06 22:29:10,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:10" (1/1) ... [2024-11-06 22:29:10,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:10" (1/1) ... [2024-11-06 22:29:10,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 22:29:10,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 22:29:10,182 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 22:29:10,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 22:29:10,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:10" (1/1) ... [2024-11-06 22:29:10,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:29:10,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:29:10,219 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 22:29:10,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 22:29:10,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 22:29:10,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 22:29:10,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-06 22:29:10,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-06 22:29:10,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-06 22:29:10,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-06 22:29:10,245 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-06 22:29:10,245 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-06 22:29:10,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-06 22:29:10,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 22:29:10,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 22:29:10,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-06 22:29:10,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-06 22:29:10,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-06 22:29:10,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-06 22:29:10,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-06 22:29:10,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-06 22:29:10,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 22:29:10,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-06 22:29:10,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-06 22:29:10,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-06 22:29:10,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 22:29:10,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 22:29:10,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-06 22:29:10,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 22:29:10,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 22:29:10,369 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 22:29:10,370 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 22:29:10,608 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-11-06 22:29:10,608 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 22:29:10,618 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 22:29:10,618 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-06 22:29:10,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:29:10 BoogieIcfgContainer [2024-11-06 22:29:10,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 22:29:10,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 22:29:10,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 22:29:10,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 22:29:10,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:29:09" (1/3) ... [2024-11-06 22:29:10,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31974678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:29:10, skipping insertion in model container [2024-11-06 22:29:10,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:10" (2/3) ... [2024-11-06 22:29:10,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31974678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:29:10, skipping insertion in model container [2024-11-06 22:29:10,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:29:10" (3/3) ... [2024-11-06 22:29:10,627 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2024-11-06 22:29:10,640 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 22:29:10,641 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 22:29:10,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 22:29:10,702 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;@74ac2335, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 22:29:10,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 22:29:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 22:29:10,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 22:29:10,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:29:10,715 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-06 22:29:10,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:29:10,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:29:10,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1111347289, now seen corresponding path program 1 times [2024-11-06 22:29:10,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:29:10,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466371887] [2024-11-06 22:29:10,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:10,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:29:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:10,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:29:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:11,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 22:29:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:11,040 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-06 22:29:11,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:29:11,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466371887] [2024-11-06 22:29:11,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466371887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:29:11,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:29:11,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 22:29:11,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016166203] [2024-11-06 22:29:11,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:29:11,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:29:11,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:29:11,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:29:11,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:29:11,067 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 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-06 22:29:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:29:11,136 INFO L93 Difference]: Finished difference Result 77 states and 111 transitions. [2024-11-06 22:29:11,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:29:11,139 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-06 22:29:11,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:29:11,144 INFO L225 Difference]: With dead ends: 77 [2024-11-06 22:29:11,144 INFO L226 Difference]: Without dead ends: 34 [2024-11-06 22:29:11,147 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-06 22:29:11,150 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:29:11,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:29:11,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-06 22:29:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-06 22:29:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 22:29:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-11-06 22:29:11,183 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 25 [2024-11-06 22:29:11,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:29:11,185 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-06 22:29:11,185 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-06 22:29:11,186 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-06 22:29:11,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 22:29:11,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:29:11,188 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-06 22:29:11,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 22:29:11,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:29:11,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:29:11,189 INFO L85 PathProgramCache]: Analyzing trace with hash -234931549, now seen corresponding path program 1 times [2024-11-06 22:29:11,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:29:11,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115262046] [2024-11-06 22:29:11,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:11,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:29:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:11,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:29:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:11,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 22:29:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:11,481 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-06 22:29:11,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:29:11,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115262046] [2024-11-06 22:29:11,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115262046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:29:11,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:29:11,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:29:11,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541781873] [2024-11-06 22:29:11,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:29:11,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:29:11,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:29:11,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:29:11,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:29:11,488 INFO L87 Difference]: Start difference. First operand 34 states and 44 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-06 22:29:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:29:11,551 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2024-11-06 22:29:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:29:11,552 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-06 22:29:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:29:11,553 INFO L225 Difference]: With dead ends: 64 [2024-11-06 22:29:11,554 INFO L226 Difference]: Without dead ends: 37 [2024-11-06 22:29:11,554 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-06 22:29:11,555 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:29:11,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 101 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:29:11,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-06 22:29:11,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-06 22:29:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 22:29:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2024-11-06 22:29:11,564 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 25 [2024-11-06 22:29:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:29:11,565 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2024-11-06 22:29:11,565 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-06 22:29:11,566 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2024-11-06 22:29:11,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-06 22:29:11,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:29:11,566 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] [2024-11-06 22:29:11,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 22:29:11,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:29:11,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:29:11,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1702704619, now seen corresponding path program 1 times [2024-11-06 22:29:11,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:29:11,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342265575] [2024-11-06 22:29:11,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:11,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:29:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:11,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:29:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:11,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:29:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:11,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:29:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:11,758 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-06 22:29:11,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:29:11,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342265575] [2024-11-06 22:29:11,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342265575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:29:11,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:29:11,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:29:11,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387168298] [2024-11-06 22:29:11,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:29:11,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:29:11,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:29:11,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:29:11,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:29:11,761 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-06 22:29:11,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:29:11,813 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2024-11-06 22:29:11,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:29:11,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 33 [2024-11-06 22:29:11,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:29:11,815 INFO L225 Difference]: With dead ends: 51 [2024-11-06 22:29:11,815 INFO L226 Difference]: Without dead ends: 37 [2024-11-06 22:29:11,815 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-06 22:29:11,816 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:29:11,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:29:11,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-06 22:29:11,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-06 22:29:11,823 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-06 22:29:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2024-11-06 22:29:11,825 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 33 [2024-11-06 22:29:11,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:29:11,825 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2024-11-06 22:29:11,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-06 22:29:11,826 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2024-11-06 22:29:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-06 22:29:11,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:29:11,827 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] [2024-11-06 22:29:11,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 22:29:11,828 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:29:11,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:29:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1515040147, now seen corresponding path program 1 times [2024-11-06 22:29:11,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:29:11,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740860369] [2024-11-06 22:29:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:11,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:29:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:13,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:29:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:13,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:29:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:13,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:29:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:14,152 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-06 22:29:14,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:29:14,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740860369] [2024-11-06 22:29:14,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740860369] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:29:14,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806097777] [2024-11-06 22:29:14,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:14,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:29:14,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:29:14,157 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:29:14,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 22:29:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:14,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-06 22:29:14,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:29:14,844 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-06 22:29:15,081 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-06 22:29:15,186 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-06 22:29:15,187 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-06 22:29:15,268 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-06 22:29:15,390 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 16 treesize of output 11 [2024-11-06 22:29:15,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-06 22:29:15,630 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-06 22:29:15,857 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-06 22:29:15,857 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 20 treesize of output 23 [2024-11-06 22:29:15,887 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-06 22:29:15,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-06 22:29:16,200 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 59 treesize of output 26 [2024-11-06 22:29:16,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2024-11-06 22:29:16,289 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-06 22:29:16,378 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-06 22:29:16,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:29:16,483 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (or (not (= v_ArrVal_405 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_405 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_406) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2024-11-06 22:29:16,508 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (or (not (= v_ArrVal_405 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select v_ArrVal_405 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_405) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_406) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2024-11-06 22:29:16,523 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_405) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_406) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_405 (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_405 .cse1)))))))) is different from false [2024-11-06 22:29:16,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806097777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:29:16,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:29:16,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 41 [2024-11-06 22:29:16,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969938146] [2024-11-06 22:29:16,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:29:16,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-06 22:29:16,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:29:16,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-06 22:29:16,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1755, Unknown=3, NotChecked=258, Total=2162 [2024-11-06 22:29:16,657 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 32 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-06 22:29:18,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:29:18,017 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2024-11-06 22:29:18,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-06 22:29:18,017 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 32 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-11-06 22:29:18,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:29:18,018 INFO L225 Difference]: With dead ends: 66 [2024-11-06 22:29:18,018 INFO L226 Difference]: Without dead ends: 64 [2024-11-06 22:29:18,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=262, Invalid=3053, Unknown=3, NotChecked=342, Total=3660 [2024-11-06 22:29:18,020 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 51 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 22:29:18,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 477 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 22:29:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-06 22:29:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2024-11-06 22:29:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 22:29:18,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2024-11-06 22:29:18,028 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 34 [2024-11-06 22:29:18,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:29:18,028 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2024-11-06 22:29:18,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 32 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-06 22:29:18,029 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2024-11-06 22:29:18,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-06 22:29:18,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:29:18,029 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] [2024-11-06 22:29:18,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 22:29:18,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:29:18,230 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:29:18,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:29:18,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1814087211, now seen corresponding path program 2 times [2024-11-06 22:29:18,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:29:18,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155776249] [2024-11-06 22:29:18,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:18,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:29:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:18,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:29:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:18,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:29:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:18,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:29:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:18,454 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-06 22:29:18,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:29:18,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155776249] [2024-11-06 22:29:18,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155776249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:29:18,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576595744] [2024-11-06 22:29:18,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:29:18,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:29:18,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:29:18,458 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:29:18,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 22:29:18,636 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 22:29:18,637 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:29:18,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 22:29:18,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:29:18,688 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-06 22:29:18,689 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:29:18,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576595744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:29:18,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 22:29:18,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-06 22:29:18,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395949638] [2024-11-06 22:29:18,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:29:18,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:29:18,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:29:18,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:29:18,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:29:18,691 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-06 22:29:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:29:18,723 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2024-11-06 22:29:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:29:18,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 35 [2024-11-06 22:29:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:29:18,725 INFO L225 Difference]: With dead ends: 65 [2024-11-06 22:29:18,725 INFO L226 Difference]: Without dead ends: 47 [2024-11-06 22:29:18,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 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-06 22:29:18,726 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 26 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:29:18,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 87 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:29:18,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-06 22:29:18,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-11-06 22:29:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 22:29:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-11-06 22:29:18,739 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 35 [2024-11-06 22:29:18,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:29:18,740 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-11-06 22:29:18,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-06 22:29:18,740 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-11-06 22:29:18,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-06 22:29:18,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:29:18,740 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-06 22:29:18,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 22:29:18,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:29:18,944 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:29:18,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:29:18,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1514019345, now seen corresponding path program 1 times [2024-11-06 22:29:18,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:29:18,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405375160] [2024-11-06 22:29:18,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:18,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:29:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:19,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:29:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:19,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:29:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:19,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:29:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:19,080 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-06 22:29:19,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:29:19,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405375160] [2024-11-06 22:29:19,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405375160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:29:19,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:29:19,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 22:29:19,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832942525] [2024-11-06 22:29:19,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:29:19,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:29:19,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:29:19,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:29:19,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:29:19,082 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-06 22:29:19,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:29:19,133 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2024-11-06 22:29:19,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:29:19,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 35 [2024-11-06 22:29:19,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:29:19,134 INFO L225 Difference]: With dead ends: 63 [2024-11-06 22:29:19,134 INFO L226 Difference]: Without dead ends: 46 [2024-11-06 22:29:19,134 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-06 22:29:19,135 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 26 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:29:19,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 107 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:29:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-06 22:29:19,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2024-11-06 22:29:19,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 22:29:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-11-06 22:29:19,141 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 35 [2024-11-06 22:29:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:29:19,141 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-11-06 22:29:19,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-06 22:29:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-11-06 22:29:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-06 22:29:19,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:29:19,143 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-06 22:29:19,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 22:29:19,143 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:29:19,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:29:19,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1637752339, now seen corresponding path program 1 times [2024-11-06 22:29:19,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:29:19,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286891783] [2024-11-06 22:29:19,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:19,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:29:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:19,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:29:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:19,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:29:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:19,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:29:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:19,297 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-06 22:29:19,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:29:19,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286891783] [2024-11-06 22:29:19,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286891783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:29:19,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244608426] [2024-11-06 22:29:19,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:19,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:29:19,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:29:19,300 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:29:19,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 22:29:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:19,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-06 22:29:19,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:29:19,520 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-06 22:29:19,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:29:19,608 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-06 22:29:19,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244608426] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:29:19,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:29:19,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-11-06 22:29:19,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509254053] [2024-11-06 22:29:19,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:29:19,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 22:29:19,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:29:19,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 22:29:19,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-06 22:29:19,609 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 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-06 22:29:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:29:19,725 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2024-11-06 22:29:19,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 22:29:19,726 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 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 36 [2024-11-06 22:29:19,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:29:19,726 INFO L225 Difference]: With dead ends: 59 [2024-11-06 22:29:19,726 INFO L226 Difference]: Without dead ends: 44 [2024-11-06 22:29:19,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 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-06 22:29:19,727 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:29:19,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 221 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:29:19,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-06 22:29:19,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-06 22:29:19,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 22:29:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-11-06 22:29:19,738 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 36 [2024-11-06 22:29:19,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:29:19,739 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-11-06 22:29:19,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 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-06 22:29:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-11-06 22:29:19,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-06 22:29:19,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:29:19,741 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-06 22:29:19,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 22:29:19,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:29:19,947 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:29:19,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:29:19,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1695010641, now seen corresponding path program 1 times [2024-11-06 22:29:19,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:29:19,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640013836] [2024-11-06 22:29:19,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:19,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:29:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:20,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:29:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:20,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:29:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:20,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:29:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:20,219 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-06 22:29:20,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:29:20,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640013836] [2024-11-06 22:29:20,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640013836] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:29:20,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383419994] [2024-11-06 22:29:20,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:20,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:29:20,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:29:20,222 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:29:20,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 22:29:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:20,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-06 22:29:20,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:29:20,481 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-06 22:29:20,510 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-06 22:29:20,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:29:20,547 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-06 22:29:20,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383419994] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:29:20,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:29:20,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 15 [2024-11-06 22:29:20,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47087343] [2024-11-06 22:29:20,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:29:20,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-06 22:29:20,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:29:20,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-06 22:29:20,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-06 22:29:20,549 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 13 states have internal predecessors, (37), 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-06 22:29:24,566 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-06 22:29:28,584 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-06 22:29:32,596 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-06 22:29:36,610 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-06 22:29:40,794 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-06 22:29:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:29:40,796 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2024-11-06 22:29:40,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-06 22:29:40,797 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 13 states have internal predecessors, (37), 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 36 [2024-11-06 22:29:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:29:40,797 INFO L225 Difference]: With dead ends: 59 [2024-11-06 22:29:40,797 INFO L226 Difference]: Without dead ends: 43 [2024-11-06 22:29:40,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-06 22:29:40,798 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-11-06 22:29:40,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 371 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2024-11-06 22:29:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-06 22:29:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-11-06 22:29:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 22:29:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-06 22:29:40,806 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 36 [2024-11-06 22:29:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:29:40,807 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-06 22:29:40,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 13 states have internal predecessors, (37), 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-06 22:29:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-06 22:29:40,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-06 22:29:40,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:29:40,811 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, 1] [2024-11-06 22:29:40,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-06 22:29:41,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-06 22:29:41,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:29:41,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:29:41,016 INFO L85 PathProgramCache]: Analyzing trace with hash 108256579, now seen corresponding path program 1 times [2024-11-06 22:29:41,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:29:41,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369658955] [2024-11-06 22:29:41,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:41,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:29:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:41,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:29:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:41,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:29:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:41,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:29:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:29:41,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:29:41,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369658955] [2024-11-06 22:29:41,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369658955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:29:41,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557440421] [2024-11-06 22:29:41,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:41,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:29:41,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:29:41,218 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:29:41,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 22:29:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:41,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-06 22:29:41,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:29:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:29:41,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:29:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:29:41,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557440421] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:29:41,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:29:41,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2024-11-06 22:29:41,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130873603] [2024-11-06 22:29:41,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:29:41,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 22:29:41,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:29:41,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 22:29:41,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-06 22:29:41,499 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-06 22:29:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:29:41,549 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2024-11-06 22:29:41,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 22:29:41,550 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2024-11-06 22:29:41,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:29:41,550 INFO L225 Difference]: With dead ends: 52 [2024-11-06 22:29:41,550 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 22:29:41,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-06 22:29:41,551 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:29:41,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:29:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 22:29:41,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-06 22:29:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 22:29:41,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-11-06 22:29:41,557 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 38 [2024-11-06 22:29:41,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:29:41,557 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-11-06 22:29:41,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-06 22:29:41,557 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-11-06 22:29:41,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-06 22:29:41,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:29:41,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-06 22:29:41,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-06 22:29:41,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:29:41,758 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:29:41,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:29:41,759 INFO L85 PathProgramCache]: Analyzing trace with hash 108212869, now seen corresponding path program 1 times [2024-11-06 22:29:41,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:29:41,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453799047] [2024-11-06 22:29:41,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:41,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:29:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:42,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:29:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:42,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:29:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:42,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:29:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-06 22:29:42,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:29:42,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453799047] [2024-11-06 22:29:42,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453799047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:29:42,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175327208] [2024-11-06 22:29:42,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:42,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:29:42,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:29:42,637 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:29:42,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-06 22:29:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:42,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-06 22:29:42,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:29:42,911 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-06 22:29:43,077 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-06 22:29:43,077 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-06 22:29:43,118 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-06 22:29:43,189 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-06 22:29:43,189 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 34 treesize of output 33 [2024-11-06 22:29:43,293 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-06 22:29:43,297 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-06 22:29:43,420 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-06 22:29:43,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:29:43,501 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-06 22:29:43,520 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-06 22:29:43,520 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-06 22:29:43,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:29:43,849 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 30 treesize of output 27 [2024-11-06 22:29:43,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 32 [2024-11-06 22:29:43,878 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-06 22:29:43,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 78 [2024-11-06 22:29:43,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-11-06 22:29:43,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-06 22:29:43,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2024-11-06 22:29:43,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-06 22:29:44,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-06 22:29:44,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-06 22:29:44,093 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-06 22:29:44,095 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-06 22:29:44,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:29:44,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:29:44,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 62 [2024-11-06 22:29:44,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:29:44,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 123 [2024-11-06 22:29:44,211 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 52 treesize of output 46 [2024-11-06 22:29:44,395 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (= .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337))) (or (not (= (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1338)) (forall ((v_ArrVal_1335 (Array Int Int))) (let ((.cse14 (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1338) (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1335) .cse0) .cse5)))) (or (forall ((v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 (+ 4 v_arrayElimCell_37)))) (= (select .cse14 (+ 4 v_arrayElimCell_36)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) (.cse2 (or .cse6 (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337))) (or (not (= (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1338)) (= (select (select (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1338) (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1335) .cse0) .cse5)) (+ 4 v_arrayElimCell_36)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse3 (not .cse6)) (.cse8 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))) (and (or (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse0) (and .cse1 .cse2 (or .cse3 (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_arrayElimCell_37 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1338) (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1335) .cse0) .cse5)) (+ 4 v_arrayElimCell_37))) (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1338))))))) (or .cse6 (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1335 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1338) (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1335) .cse0) .cse5)) .cse8)) (not (= (store (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1338)))))) (or (= .cse5 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|) (and .cse1 .cse2)) (or .cse3 (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337))) (or (not (= (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1338)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1338) (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1335) .cse0) .cse5)) (+ 4 v_arrayElimCell_37))))))) (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1337))) (or (forall ((v_ArrVal_1335 (Array Int Int))) (let ((.cse10 (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1338) (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1335) .cse0) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 .cse8)) (forall ((v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 (+ 4 v_arrayElimCell_37))))))) (not (= (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1338))))))))) is different from false [2024-11-06 22:29:44,639 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse6 (or .cse0 (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1337))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1338) (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1335) .cse3) .cse4)) (+ 4 v_arrayElimCell_36))) (not (= v_ArrVal_1338 (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))))) (.cse7 (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1337))) (or (forall ((v_ArrVal_1335 (Array Int Int))) (let ((.cse12 (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1338) (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1335) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 (+ 4 v_arrayElimCell_36))) (forall ((v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 (+ 4 v_arrayElimCell_37))))))) (not (= v_ArrVal_1338 (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))))) (.cse10 (not .cse0))) (and (or .cse0 (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1335 (Array Int Int))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1337))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1338) (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1335) .cse3) .cse4)) .cse5)) (not (= v_ArrVal_1338 (store (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))))) (or (and .cse6 .cse7) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| .cse4)) (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1337))) (or (forall ((v_ArrVal_1335 (Array Int Int))) (let ((.cse8 (select (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1338) (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1335) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 .cse5)) (forall ((v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 (+ 4 v_arrayElimCell_37))))))) (not (= v_ArrVal_1338 (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))) (or (and (or (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_arrayElimCell_37 Int)) (or (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1338)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1337) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1338) (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1335) .cse3) .cse4)) (+ 4 v_arrayElimCell_37))))) .cse10) .cse6 .cse7) (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (or (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1337))) (or (not (= v_ArrVal_1338 (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1338) (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1335) .cse3) .cse4)) (+ 4 v_arrayElimCell_37)))))) .cse10))))) is different from false [2024-11-06 22:29:44,781 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse8)) (.cse7 (store |c_#memory_$Pointer$#1.base| .cse9 (store (select |c_#memory_$Pointer$#1.base| .cse9) .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse16 (store |c_#memory_int#1| .cse9 v_ArrVal_1337))) (or (forall ((v_ArrVal_1335 (Array Int Int))) (let ((.cse15 (select (store .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1338) (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1335) .cse8) .cse3)))) (or (forall ((v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 (+ 4 v_arrayElimCell_37)))) (= (select .cse15 (+ 4 v_arrayElimCell_36)) |c_ULTIMATE.start_main_~uneq~0#1|)))) (not (= v_ArrVal_1338 (store (select .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))))))) (.cse1 (or (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_arrayElimCell_36 Int)) (let ((.cse14 (store |c_#memory_int#1| .cse9 v_ArrVal_1337))) (or (not (= v_ArrVal_1338 (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1338) (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1335) .cse8) .cse3)) (+ 4 v_arrayElimCell_36)) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse12)) (.cse10 (not .cse12)) (.cse5 (+ |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 4))) (and (or (and .cse0 .cse1) (= .cse2 .cse3)) (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#1| .cse9 v_ArrVal_1337))) (or (forall ((v_ArrVal_1335 (Array Int Int))) (let ((.cse4 (select (store .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1338) (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1335) .cse8) .cse3)))) (or (forall ((v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse4 (+ 4 v_arrayElimCell_37)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse4 .cse5))))) (not (= v_ArrVal_1338 (store (select .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|))))))) (or .cse10 (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse11 (store |c_#memory_int#1| .cse9 v_ArrVal_1337))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1338) (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1335) .cse8) .cse3)) (+ 4 v_arrayElimCell_37))) (not (= v_ArrVal_1338 (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))))))) (or (and .cse0 .cse1 (or .cse10 (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_arrayElimCell_37 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| .cse9 v_ArrVal_1337) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1338) (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1335) .cse8) .cse3)) (+ 4 v_arrayElimCell_37))) (not (= v_ArrVal_1338 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))))))) (= .cse9 .cse8)) (or .cse12 (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1335 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#1| .cse9 v_ArrVal_1337))) (or (not (= v_ArrVal_1338 (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1338) (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1335) .cse8) .cse3)) .cse5)))))))))) is different from false [2024-11-06 22:29:45,553 INFO L349 Elim1Store]: treesize reduction 3064, result has 26.0 percent of original size [2024-11-06 22:29:45,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 46 case distinctions, treesize of input 6087 treesize of output 6463 [2024-11-06 22:29:46,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:29:46,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 4303 treesize of output 6687 [2024-11-06 22:29:46,308 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-11-06 22:29:46,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3604 treesize of output 3638 [2024-11-06 22:29:46,454 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-06 22:29:46,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 3591 treesize of output 3606 [2024-11-06 22:29:46,599 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 3582 treesize of output 3578 [2024-11-06 22:29:46,838 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-11-06 22:29:46,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3578 treesize of output 3612 [2024-11-06 22:29:47,040 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-06 22:29:47,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 3565 treesize of output 3580 [2024-11-06 22:29:47,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:29:47,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 3556 treesize of output 3564 [2024-11-06 22:29:47,607 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-06 22:29:47,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 3551 treesize of output 3566 [2024-11-06 22:29:47,849 INFO L349 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2024-11-06 22:29:47,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3542 treesize of output 3561