./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:35:22,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:35:22,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:35:22,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:35:22,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:35:22,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:35:22,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:35:22,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:35:22,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:35:22,236 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:35:22,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:35:22,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:35:22,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:35:22,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:35:22,236 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:35:22,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:35:22,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:35:22,237 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:35:22,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:35:22,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:35:22,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:35:22,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:35:22,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:35:22,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:35:22,237 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:35:22,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:35:22,237 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:35:22,238 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:35:22,238 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:35:22,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:35:22,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:35:22,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:35:22,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:35:22,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:35:22,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:35:22,239 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:35:22,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:35:22,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:35:22,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:35:22,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:35:22,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:35:22,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:35:22,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:35:22,239 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/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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2025-03-08 04:35:22,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:35:22,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:35:22,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:35:22,459 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:35:22,459 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:35:22,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2025-03-08 04:35:23,525 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfc700c0c/c7065fd61dbd431a89fe30fa56cf5f5e/FLAG2cbb16cca [2025-03-08 04:35:23,842 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:35:23,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2025-03-08 04:35:23,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfc700c0c/c7065fd61dbd431a89fe30fa56cf5f5e/FLAG2cbb16cca [2025-03-08 04:35:24,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfc700c0c/c7065fd61dbd431a89fe30fa56cf5f5e [2025-03-08 04:35:24,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:35:24,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:35:24,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:35:24,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:35:24,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:35:24,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:35:24" (1/1) ... [2025-03-08 04:35:24,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c8d23e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:35:24, skipping insertion in model container [2025-03-08 04:35:24,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:35:24" (1/1) ... [2025-03-08 04:35:24,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:35:24,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2025-03-08 04:35:24,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:35:24,323 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:35:24,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2025-03-08 04:35:24,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:35:24,388 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:35:24,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:35:24 WrapperNode [2025-03-08 04:35:24,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:35:24,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:35:24,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:35:24,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:35:24,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:35:24" (1/1) ... [2025-03-08 04:35:24,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:35:24" (1/1) ... [2025-03-08 04:35:24,424 INFO L138 Inliner]: procedures = 128, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2025-03-08 04:35:24,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:35:24,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:35:24,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:35:24,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:35:24,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:35:24" (1/1) ... [2025-03-08 04:35:24,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:35:24" (1/1) ... [2025-03-08 04:35:24,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:35:24" (1/1) ... [2025-03-08 04:35:24,457 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 5, 13]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5]. [2025-03-08 04:35:24,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:35:24" (1/1) ... [2025-03-08 04:35:24,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:35:24" (1/1) ... [2025-03-08 04:35:24,462 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:35:24" (1/1) ... [2025-03-08 04:35:24,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:35:24" (1/1) ... [2025-03-08 04:35:24,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:35:24" (1/1) ... [2025-03-08 04:35:24,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:35:24" (1/1) ... [2025-03-08 04:35:24,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:35:24,466 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:35:24,467 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:35:24,467 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:35:24,468 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:35:24" (1/1) ... [2025-03-08 04:35:24,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:35:24,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:35:24,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 04:35:24,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 04:35:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:35:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:35:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 04:35:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:35:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:35:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 04:35:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-08 04:35:24,507 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-08 04:35:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:35:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:35:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 04:35:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:35:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:35:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 04:35:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:35:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:35:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 04:35:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 04:35:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 04:35:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 04:35:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 04:35:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:35:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:35:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 04:35:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:35:24,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:35:24,599 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:35:24,601 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:35:24,725 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L619: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-08 04:35:24,735 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-08 04:35:24,750 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-03-08 04:35:24,750 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:35:24,759 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:35:24,759 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:35:24,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:35:24 BoogieIcfgContainer [2025-03-08 04:35:24,760 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:35:24,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:35:24,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:35:24,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:35:24,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:35:24" (1/3) ... [2025-03-08 04:35:24,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1bf26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:35:24, skipping insertion in model container [2025-03-08 04:35:24,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:35:24" (2/3) ... [2025-03-08 04:35:24,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1bf26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:35:24, skipping insertion in model container [2025-03-08 04:35:24,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:35:24" (3/3) ... [2025-03-08 04:35:24,768 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2025-03-08 04:35:24,778 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:35:24,780 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_insert_unequal.i that has 2 procedures, 31 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-08 04:35:24,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:35:24,829 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@698b5e68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:35:24,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:35:24,834 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 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) [2025-03-08 04:35:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 04:35:24,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:35:24,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:35:24,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:35:24,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:35:24,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1700520062, now seen corresponding path program 1 times [2025-03-08 04:35:24,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:35:24,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455150058] [2025-03-08 04:35:24,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:24,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:35:24,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 04:35:24,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:35:24,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:24,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:35:25,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:35:25,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455150058] [2025-03-08 04:35:25,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455150058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:35:25,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:35:25,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:35:25,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89698571] [2025-03-08 04:35:25,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:35:25,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:35:25,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:35:25,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:35:25,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:35:25,160 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 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) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 04:35:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:35:25,186 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2025-03-08 04:35:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:35:25,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-08 04:35:25,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:35:25,191 INFO L225 Difference]: With dead ends: 60 [2025-03-08 04:35:25,192 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 04:35:25,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:35:25,197 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:35:25,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:35:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 04:35:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-08 04:35:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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) [2025-03-08 04:35:25,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2025-03-08 04:35:25,224 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 18 [2025-03-08 04:35:25,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:35:25,224 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-03-08 04:35:25,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 04:35:25,224 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2025-03-08 04:35:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 04:35:25,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:35:25,225 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:35:25,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:35:25,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:35:25,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:35:25,226 INFO L85 PathProgramCache]: Analyzing trace with hash -304946304, now seen corresponding path program 1 times [2025-03-08 04:35:25,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:35:25,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100807649] [2025-03-08 04:35:25,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:25,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:35:25,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 04:35:25,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 04:35:25,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:25,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:35:25,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:35:25,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100807649] [2025-03-08 04:35:25,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100807649] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:25,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665541467] [2025-03-08 04:35:25,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:25,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:25,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:35:25,375 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:35:25,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:35:25,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 04:35:25,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 04:35:25,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:25,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:25,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 04:35:25,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:35:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:35:25,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:35:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:35:25,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665541467] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:35:25,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:35:25,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-08 04:35:25,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618936648] [2025-03-08 04:35:25,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:35:25,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:35:25,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:35:25,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:35:25,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:35:25,599 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 04:35:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:35:25,626 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2025-03-08 04:35:25,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:35:25,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2025-03-08 04:35:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:35:25,628 INFO L225 Difference]: With dead ends: 49 [2025-03-08 04:35:25,628 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 04:35:25,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:35:25,629 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:35:25,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 112 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:35:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 04:35:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-08 04:35:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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) [2025-03-08 04:35:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2025-03-08 04:35:25,633 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 26 [2025-03-08 04:35:25,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:35:25,633 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2025-03-08 04:35:25,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 04:35:25,633 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2025-03-08 04:35:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 04:35:25,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:35:25,634 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:35:25,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 04:35:25,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:25,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:35:25,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:35:25,835 INFO L85 PathProgramCache]: Analyzing trace with hash 85968002, now seen corresponding path program 2 times [2025-03-08 04:35:25,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:35:25,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353273335] [2025-03-08 04:35:25,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:35:25,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:35:25,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 04:35:25,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 34 statements. [2025-03-08 04:35:25,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 04:35:25,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 04:35:25,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:35:25,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353273335] [2025-03-08 04:35:25,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353273335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:35:25,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:35:25,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:35:25,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868976055] [2025-03-08 04:35:25,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:35:25,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:35:25,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:35:25,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:35:25,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:35:25,916 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:35:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:35:25,928 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2025-03-08 04:35:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:35:25,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-03-08 04:35:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:35:25,929 INFO L225 Difference]: With dead ends: 41 [2025-03-08 04:35:25,929 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 04:35:25,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:35:25,930 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:35:25,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:35:25,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 04:35:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-08 04:35:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 04:35:25,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2025-03-08 04:35:25,933 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 34 [2025-03-08 04:35:25,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:35:25,933 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-03-08 04:35:25,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:35:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2025-03-08 04:35:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 04:35:25,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:35:25,934 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:35:25,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:35:25,934 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:35:25,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:35:25,935 INFO L85 PathProgramCache]: Analyzing trace with hash 114597153, now seen corresponding path program 1 times [2025-03-08 04:35:25,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:35:25,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555821265] [2025-03-08 04:35:25,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:25,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:35:25,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 04:35:25,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 04:35:25,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:25,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 04:35:26,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:35:26,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555821265] [2025-03-08 04:35:26,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555821265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:26,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780365911] [2025-03-08 04:35:26,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:26,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:26,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:35:26,130 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:35:26,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:35:26,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 04:35:26,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 04:35:26,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:26,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:26,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 04:35:26,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:35:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 04:35:26,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:35:26,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780365911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:35:26,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:35:26,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-03-08 04:35:26,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29292346] [2025-03-08 04:35:26,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:35:26,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:35:26,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:35:26,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:35:26,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:35:26,327 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) [2025-03-08 04:35:26,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:35:26,353 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2025-03-08 04:35:26,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:35:26,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 34 [2025-03-08 04:35:26,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:35:26,354 INFO L225 Difference]: With dead ends: 43 [2025-03-08 04:35:26,355 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 04:35:26,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:35:26,355 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:35:26,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 64 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:35:26,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 04:35:26,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-03-08 04:35:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 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) [2025-03-08 04:35:26,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-03-08 04:35:26,363 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 34 [2025-03-08 04:35:26,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:35:26,364 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-03-08 04:35:26,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) [2025-03-08 04:35:26,364 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-03-08 04:35:26,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 04:35:26,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:35:26,365 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:35:26,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 04:35:26,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 04:35:26,567 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:35:26,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:35:26,568 INFO L85 PathProgramCache]: Analyzing trace with hash -680672401, now seen corresponding path program 1 times [2025-03-08 04:35:26,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:35:26,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815285022] [2025-03-08 04:35:26,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:26,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:35:26,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 04:35:26,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 04:35:26,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:26,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:27,755 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:35:27,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:35:27,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815285022] [2025-03-08 04:35:27,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815285022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:27,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481167558] [2025-03-08 04:35:27,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:27,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:27,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:35:27,757 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:35:27,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 04:35:27,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 04:35:28,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 04:35:28,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:28,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:28,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-08 04:35:28,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:35:28,111 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 [2025-03-08 04:35:28,122 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 [2025-03-08 04:35:28,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 04:35:28,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-08 04:35:28,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-08 04:35:28,484 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 04:35:28,485 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 [2025-03-08 04:35:28,504 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 04:35:28,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-08 04:35:28,728 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 39 treesize of output 15 [2025-03-08 04:35:28,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-08 04:35:28,851 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 [2025-03-08 04:35:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:35:28,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:35:28,927 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_433 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_433) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2025-03-08 04:35:30,559 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_432 Int) (v_ArrVal_433 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) v_ArrVal_432)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_433) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2025-03-08 04:35:30,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481167558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:30,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:35:30,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2025-03-08 04:35:30,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593478621] [2025-03-08 04:35:30,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:35:30,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 04:35:30,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:35:30,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 04:35:30,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1197, Unknown=26, NotChecked=142, Total=1482 [2025-03-08 04:35:30,796 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 34 states, 32 states have (on average 1.4375) internal successors, (46), 28 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 04:35:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:35:33,226 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2025-03-08 04:35:33,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 04:35:33,227 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.4375) internal successors, (46), 28 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2025-03-08 04:35:33,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:35:33,227 INFO L225 Difference]: With dead ends: 54 [2025-03-08 04:35:33,227 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 04:35:33,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=167, Invalid=1884, Unknown=27, NotChecked=178, Total=2256 [2025-03-08 04:35:33,229 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 04:35:33,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 302 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 04:35:33,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 04:35:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2025-03-08 04:35:33,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 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) [2025-03-08 04:35:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2025-03-08 04:35:33,235 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 35 [2025-03-08 04:35:33,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:35:33,235 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2025-03-08 04:35:33,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.4375) internal successors, (46), 28 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 04:35:33,236 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2025-03-08 04:35:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 04:35:33,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:35:33,236 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:35:33,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 04:35:33,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:33,437 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:35:33,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:35:33,437 INFO L85 PathProgramCache]: Analyzing trace with hash -680678353, now seen corresponding path program 1 times [2025-03-08 04:35:33,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:35:33,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207941211] [2025-03-08 04:35:33,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:33,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:35:33,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 04:35:33,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 04:35:33,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:33,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 04:35:33,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:35:33,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207941211] [2025-03-08 04:35:33,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207941211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:33,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999795937] [2025-03-08 04:35:33,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:33,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:33,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:35:33,819 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:35:33,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 04:35:33,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 04:35:33,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 04:35:33,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:33,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:33,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 04:35:33,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:35:34,110 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 [2025-03-08 04:35:34,129 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:35:34,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:35:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 04:35:34,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999795937] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:35:34,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:35:34,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 22 [2025-03-08 04:35:34,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137145276] [2025-03-08 04:35:34,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:35:34,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 04:35:34,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:35:34,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 04:35:34,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2025-03-08 04:35:34,223 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 20 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 04:35:38,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 04:35:42,316 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] [2025-03-08 04:35:46,379 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] [2025-03-08 04:35:50,628 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] [2025-03-08 04:35:50,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:35:50,702 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2025-03-08 04:35:50,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 04:35:50,702 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 20 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2025-03-08 04:35:50,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:35:50,703 INFO L225 Difference]: With dead ends: 64 [2025-03-08 04:35:50,703 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 04:35:50,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=1121, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 04:35:50,704 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 9 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:35:50,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 547 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 346 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2025-03-08 04:35:50,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 04:35:50,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 44. [2025-03-08 04:35:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 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) [2025-03-08 04:35:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2025-03-08 04:35:50,710 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 35 [2025-03-08 04:35:50,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:35:50,710 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2025-03-08 04:35:50,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 20 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 04:35:50,711 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2025-03-08 04:35:50,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 04:35:50,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:35:50,711 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:35:50,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 04:35:50,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:50,912 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:35:50,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:35:50,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1323278882, now seen corresponding path program 2 times [2025-03-08 04:35:50,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:35:50,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276332433] [2025-03-08 04:35:50,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:35:50,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:35:50,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-08 04:35:50,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:35:50,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:35:50,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 04:35:51,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:35:51,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276332433] [2025-03-08 04:35:51,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276332433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:35:51,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:35:51,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:35:51,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108881926] [2025-03-08 04:35:51,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:35:51,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:35:51,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:35:51,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:35:51,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:35:51,011 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2025-03-08 04:35:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:35:51,036 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2025-03-08 04:35:51,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:35:51,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 36 [2025-03-08 04:35:51,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:35:51,037 INFO L225 Difference]: With dead ends: 54 [2025-03-08 04:35:51,037 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 04:35:51,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:35:51,038 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:35:51,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 62 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:35:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 04:35:51,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2025-03-08 04:35:51,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 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) [2025-03-08 04:35:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-03-08 04:35:51,045 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 36 [2025-03-08 04:35:51,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:35:51,045 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-03-08 04:35:51,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2025-03-08 04:35:51,045 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-03-08 04:35:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 04:35:51,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:35:51,046 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:35:51,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 04:35:51,046 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:35:51,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:35:51,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1291060976, now seen corresponding path program 1 times [2025-03-08 04:35:51,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:35:51,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071183928] [2025-03-08 04:35:51,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:51,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:35:51,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 04:35:51,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 04:35:51,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:51,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 04:35:51,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:35:51,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071183928] [2025-03-08 04:35:51,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071183928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:51,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536559935] [2025-03-08 04:35:51,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:51,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:51,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:35:51,221 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:35:51,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 04:35:51,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 04:35:51,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 04:35:51,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:51,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:51,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 04:35:51,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:35:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 04:35:51,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:35:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 04:35:51,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536559935] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:35:51,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:35:51,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-08 04:35:51,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990330850] [2025-03-08 04:35:51,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:35:51,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 04:35:51,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:35:51,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 04:35:51,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-08 04:35:51,440 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 04:35:51,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:35:51,519 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-03-08 04:35:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 04:35:51,519 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 37 [2025-03-08 04:35:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:35:51,519 INFO L225 Difference]: With dead ends: 46 [2025-03-08 04:35:51,520 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 04:35:51,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-03-08 04:35:51,520 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:35:51,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 167 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:35:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 04:35:51,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-08 04:35:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 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) [2025-03-08 04:35:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-03-08 04:35:51,526 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 37 [2025-03-08 04:35:51,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:35:51,526 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-03-08 04:35:51,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 04:35:51,527 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-03-08 04:35:51,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 04:35:51,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:35:51,527 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:35:51,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 04:35:51,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:51,731 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:35:51,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:35:51,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1291066928, now seen corresponding path program 1 times [2025-03-08 04:35:51,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:35:51,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266460] [2025-03-08 04:35:51,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:51,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:35:51,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 04:35:51,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 04:35:51,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:51,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:52,485 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:35:52,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:35:52,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266460] [2025-03-08 04:35:52,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:52,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755685689] [2025-03-08 04:35:52,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:52,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:52,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:35:52,487 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:35:52,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 04:35:52,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 04:35:52,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 04:35:52,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:52,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:52,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 118 conjuncts are in the unsatisfiable core [2025-03-08 04:35:52,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:35:52,835 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 [2025-03-08 04:35:52,882 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 [2025-03-08 04:35:52,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-08 04:35:52,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-08 04:35:53,096 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 [2025-03-08 04:35:53,162 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 04:35:53,162 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 [2025-03-08 04:35:53,177 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 04:35:53,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-08 04:35:53,414 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 19 treesize of output 11 [2025-03-08 04:35:53,421 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 31 treesize of output 15 [2025-03-08 04:35:53,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 04:35:53,514 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-08 04:35:53,514 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 119 treesize of output 76 [2025-03-08 04:35:53,520 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 55 treesize of output 19 [2025-03-08 04:35:53,529 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 [2025-03-08 04:35:53,598 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 [2025-03-08 04:35:53,645 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 [2025-03-08 04:35:53,650 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 [2025-03-08 04:35:53,704 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 [2025-03-08 04:35:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:35:53,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:35:53,776 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int)) (v_ArrVal_885 (Array Int Int)) (v_ArrVal_886 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_886)) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_885) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_883) .cse0) .cse1))))) is different from false [2025-03-08 04:35:53,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:35:53,783 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 77 treesize of output 78 [2025-03-08 04:35:53,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:35:53,793 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 150 treesize of output 149 [2025-03-08 04:35:53,799 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 66 treesize of output 58 [2025-03-08 04:35:53,918 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse4)) (.cse2 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) (.cse5 (+ .cse10 4))) (let ((.cse9 (and (forall ((v_arrayElimCell_26 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_886 Int)) (let ((.cse11 (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_882))) (store .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 v_ArrVal_886)))) (.cse12 (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_883) .cse4) .cse5))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_26) .cse12)) (forall ((v_arrayElimCell_27 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_27) .cse12)))))) (or .cse0 (forall ((v_arrayElimCell_26 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_886 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_882))) (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 v_ArrVal_886))) v_arrayElimCell_26) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_883) .cse4) .cse5)))))))) (and (or (not .cse0) (forall ((v_arrayElimCell_27 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_886 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse1 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_882))) (store .cse1 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 v_ArrVal_886))) v_arrayElimCell_27) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_883) .cse4) .cse5))))) (or (forall ((v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_886 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_882) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 v_ArrVal_886) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_883) .cse4) .cse5)))) .cse0) (forall ((v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_886 Int)) (let ((.cse8 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_882))) (let ((.cse6 (store (select .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 v_ArrVal_886)) (.cse7 (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_883) .cse4) .cse5))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse6 .cse7)) (forall ((v_arrayElimCell_27 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse6) v_arrayElimCell_27) .cse7))))))) (or .cse9 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| .cse10)) (or .cse9 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| .cse4)))))) is different from false [2025-03-08 04:35:54,063 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse1)) (.cse5 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) (.cse6 (+ .cse10 4)) (.cse4 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (let ((.cse0 (and (or (forall ((v_arrayElimCell_26 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_886 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse11 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_882))) (store .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse4 v_ArrVal_886))) v_arrayElimCell_26) (select (select (store .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_883) .cse1) .cse6)))) .cse2) (forall ((v_arrayElimCell_26 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_886 Int)) (let ((.cse12 (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_882))) (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse4 v_ArrVal_886)))) (.cse13 (select (select (store .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_883) .cse1) .cse6))) (or (forall ((v_arrayElimCell_27 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse12 v_arrayElimCell_27) .cse13))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse12 v_arrayElimCell_26) .cse13)))))))) (and (or .cse0 (= .cse1 |c_ULTIMATE.start_sll_insert_~last~0#1.base|)) (or (not .cse2) (forall ((v_arrayElimCell_27 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_886 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse3 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_882))) (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse4 v_ArrVal_886))) v_arrayElimCell_27) (select (select (store .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_883) .cse1) .cse6))))) (forall ((v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_886 Int)) (let ((.cse9 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_882))) (let ((.cse7 (store (select .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse4 v_ArrVal_886)) (.cse8 (select (select (store .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_883) .cse1) .cse6))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 .cse8)) (forall ((v_arrayElimCell_27 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse7) v_arrayElimCell_27) .cse8))))))) (or .cse2 (forall ((v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_886 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_882) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse4 v_ArrVal_886) (select (select (store .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_883) .cse1) .cse6))))) (or (= .cse10 |c_ULTIMATE.start_sll_insert_~last~0#1.offset|) .cse0))))) is different from false [2025-03-08 04:35:54,142 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse1)) (.cse6 (store |c_#memory_$Pointer$#2.offset| .cse2 (store (select |c_#memory_$Pointer$#2.offset| .cse2) (+ .cse11 4) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|))) (.cse7 (+ .cse10 4)) (.cse8 (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|))) (let ((.cse0 (and (or (forall ((v_arrayElimCell_26 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_886 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse13 (store |c_#memory_int#2| .cse2 v_ArrVal_882))) (store .cse13 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 v_ArrVal_886))) v_arrayElimCell_26) (select (select (store .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_883) .cse1) .cse7)))) .cse9) (forall ((v_arrayElimCell_26 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_886 Int)) (let ((.cse14 (let ((.cse16 (store |c_#memory_int#2| .cse2 v_ArrVal_882))) (store .cse16 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 v_ArrVal_886)))) (.cse15 (select (select (store .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_883) .cse1) .cse7))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse14 v_arrayElimCell_26) .cse15)) (forall ((v_arrayElimCell_27 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse14 v_arrayElimCell_27) .cse15))))))))) (and (or .cse0 (= .cse1 .cse2)) (forall ((v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_886 Int)) (let ((.cse5 (store |c_#memory_int#2| .cse2 v_ArrVal_882))) (let ((.cse3 (store (select .cse5 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 v_ArrVal_886)) (.cse4 (select (select (store .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_883) .cse1) .cse7))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse3 .cse4)) (forall ((v_arrayElimCell_27 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse5 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse3) v_arrayElimCell_27) .cse4))))))) (or .cse9 (forall ((v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_886 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| .cse2 v_ArrVal_882) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 v_ArrVal_886) (select (select (store .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_883) .cse1) .cse7))))) (or .cse0 (= .cse10 .cse11)) (or (not .cse9) (forall ((v_arrayElimCell_27 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_886 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse12 (store |c_#memory_int#2| .cse2 v_ArrVal_882))) (store .cse12 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 v_ArrVal_886))) v_arrayElimCell_27) (select (select (store .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_883) .cse1) .cse7))))))))) is different from false [2025-03-08 04:35:55,447 INFO L349 Elim1Store]: treesize reduction 792, result has 80.7 percent of original size [2025-03-08 04:35:55,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 37 case distinctions, treesize of input 3509 treesize of output 6060 [2025-03-08 04:35:55,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:35:55,773 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 3512 treesize of output 3750 [2025-03-08 04:35:55,852 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 3031 treesize of output 2767 [2025-03-08 04:35:55,936 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 3143 treesize of output 2879 [2025-03-08 04:35:56,014 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 3067 treesize of output 2935 [2025-03-08 04:35:56,108 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 3029 treesize of output 2985 [2025-03-08 04:35:56,190 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 3079 treesize of output 2991 [2025-03-08 04:35:56,290 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 3179 treesize of output 3047 [2025-03-08 04:35:56,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3235 treesize of output 3103 [2025-03-08 04:36:03,233 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 48 treesize of output 4