./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/dll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/list-simple/dll2n_append_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 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:13:02,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:13:02,240 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-30 10:13:02,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:13:02,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:13:02,269 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:13:02,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:13:02,269 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:13:02,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:13:02,270 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:13:02,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:13:02,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:13:02,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:13:02,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:13:02,272 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:13:02,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:13:02,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:13:02,272 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:13:02,272 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:13:02,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:13:02,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:13:02,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:13:02,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:13:02,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:13:02,273 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:13:02,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:13:02,273 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:13:02,273 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:13:02,273 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:13:02,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:13:02,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:13:02,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:13:02,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:13:02,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:13:02,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:13:02,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:13:02,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:13:02,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:13:02,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:13:02,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:13:02,275 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:13:02,275 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:13:02,275 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:13:02,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:13:02,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:13:02,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:13:02,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:13:02,275 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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2025-04-30 10:13:02,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:13:02,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:13:02,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:13:02,480 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:13:02,480 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:13:02,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_append_unequal.i [2025-04-30 10:13:03,786 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/860bc0628/1221c45a5e11452493d6b4eb360b0203/FLAG6348eeff0 [2025-04-30 10:13:04,048 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:13:04,049 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_append_unequal.i [2025-04-30 10:13:04,063 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/860bc0628/1221c45a5e11452493d6b4eb360b0203/FLAG6348eeff0 [2025-04-30 10:13:04,836 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/860bc0628/1221c45a5e11452493d6b4eb360b0203 [2025-04-30 10:13:04,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:13:04,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:13:04,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:13:04,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:13:04,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:13:04,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:13:04" (1/1) ... [2025-04-30 10:13:04,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bd31b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:04, skipping insertion in model container [2025-04-30 10:13:04,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:13:04" (1/1) ... [2025-04-30 10:13:04,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:13:05,085 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_append_unequal.i[24457,24470] [2025-04-30 10:13:05,088 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:13:05,093 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:13:05,153 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_append_unequal.i[24457,24470] [2025-04-30 10:13:05,154 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:13:05,171 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:13:05,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:05 WrapperNode [2025-04-30 10:13:05,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:13:05,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:13:05,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:13:05,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:13:05,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:05" (1/1) ... [2025-04-30 10:13:05,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:05" (1/1) ... [2025-04-30 10:13:05,203 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 132 [2025-04-30 10:13:05,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:13:05,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:13:05,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:13:05,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:13:05,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:05" (1/1) ... [2025-04-30 10:13:05,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:05" (1/1) ... [2025-04-30 10:13:05,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:05" (1/1) ... [2025-04-30 10:13:05,226 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 16, 6]. 67 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 8, 1]. [2025-04-30 10:13:05,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:05" (1/1) ... [2025-04-30 10:13:05,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:05" (1/1) ... [2025-04-30 10:13:05,236 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:05" (1/1) ... [2025-04-30 10:13:05,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:05" (1/1) ... [2025-04-30 10:13:05,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:05" (1/1) ... [2025-04-30 10:13:05,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:05" (1/1) ... [2025-04-30 10:13:05,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:05" (1/1) ... [2025-04-30 10:13:05,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:13:05,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:13:05,248 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:13:05,248 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:13:05,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:05" (1/1) ... [2025-04-30 10:13:05,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:13:05,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:05,273 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-04-30 10:13:05,275 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-04-30 10:13:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:13:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:13:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:13:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:13:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:13:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:13:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-30 10:13:05,289 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-30 10:13:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:13:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:13:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:13:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:13:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:13:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:13:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:13:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:13:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:13:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:13:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:13:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:13:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:13:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:13:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:13:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:13:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:13:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:13:05,401 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:13:05,402 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:13:05,582 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-04-30 10:13:05,582 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:13:05,589 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:13:05,589 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-30 10:13:05,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:13:05 BoogieIcfgContainer [2025-04-30 10:13:05,590 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:13:05,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:13:05,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:13:05,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:13:05,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:13:04" (1/3) ... [2025-04-30 10:13:05,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a7aaf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:13:05, skipping insertion in model container [2025-04-30 10:13:05,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:05" (2/3) ... [2025-04-30 10:13:05,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a7aaf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:13:05, skipping insertion in model container [2025-04-30 10:13:05,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:13:05" (3/3) ... [2025-04-30 10:13:05,595 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2025-04-30 10:13:05,604 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:13:05,605 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_append_unequal.i that has 2 procedures, 37 locations, 52 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-30 10:13:05,637 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:13:05,644 INFO L340 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;@1d290dd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:13:05,645 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-30 10:13:05,647 INFO L278 IsEmpty]: Start isEmpty. Operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 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-04-30 10:13:05,651 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:13:05,651 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:05,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:05,652 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:05,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:05,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1559849900, now seen corresponding path program 1 times [2025-04-30 10:13:05,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:05,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633367229] [2025-04-30 10:13:05,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:05,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:05,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:13:05,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:13:05,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:05,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:05,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:05,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633367229] [2025-04-30 10:13:05,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633367229] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:13:05,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:13:05,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:13:05,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658725291] [2025-04-30 10:13:05,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:13:05,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:13:05,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:05,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:13:05,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:13:05,930 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 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 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-04-30 10:13:05,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:05,959 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2025-04-30 10:13:05,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:13:05,961 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2025-04-30 10:13:05,962 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:05,965 INFO L225 Difference]: With dead ends: 72 [2025-04-30 10:13:05,966 INFO L226 Difference]: Without dead ends: 36 [2025-04-30 10:13:05,969 INFO L436 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-04-30 10:13:05,970 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:05,974 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:13:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-30 10:13:05,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2025-04-30 10:13:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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-04-30 10:13:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-04-30 10:13:05,994 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 16 [2025-04-30 10:13:05,994 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:05,994 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-04-30 10:13:05,994 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-04-30 10:13:05,995 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-04-30 10:13:05,995 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:13:05,995 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:05,995 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-04-30 10:13:05,996 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:13:05,996 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:05,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:05,996 INFO L85 PathProgramCache]: Analyzing trace with hash 711268184, now seen corresponding path program 1 times [2025-04-30 10:13:05,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:05,997 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426380] [2025-04-30 10:13:05,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:05,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:06,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:13:06,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:13:06,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:06,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:13:06,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:06,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426380] [2025-04-30 10:13:06,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426380] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:13:06,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:13:06,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:13:06,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396359478] [2025-04-30 10:13:06,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:13:06,120 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:13:06,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:06,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:13:06,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:13:06,122 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-04-30 10:13:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:06,140 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2025-04-30 10:13:06,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:13:06,141 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 26 [2025-04-30 10:13:06,141 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:06,141 INFO L225 Difference]: With dead ends: 64 [2025-04-30 10:13:06,141 INFO L226 Difference]: Without dead ends: 35 [2025-04-30 10:13:06,142 INFO L436 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-04-30 10:13:06,142 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:06,142 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:13:06,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-30 10:13:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-04-30 10:13:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:13:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2025-04-30 10:13:06,148 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 26 [2025-04-30 10:13:06,149 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:06,149 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2025-04-30 10:13:06,149 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-04-30 10:13:06,150 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2025-04-30 10:13:06,150 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:13:06,151 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:06,151 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-04-30 10:13:06,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:13:06,151 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:06,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:06,152 INFO L85 PathProgramCache]: Analyzing trace with hash -309800170, now seen corresponding path program 1 times [2025-04-30 10:13:06,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:06,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215797453] [2025-04-30 10:13:06,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:06,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:06,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:13:06,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:13:06,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:06,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:13:06,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:06,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215797453] [2025-04-30 10:13:06,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215797453] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:06,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024965014] [2025-04-30 10:13:06,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:06,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:06,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:06,297 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-04-30 10:13:06,299 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-04-30 10:13:06,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:13:06,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:13:06,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:06,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:06,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:13:06,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:06,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:13:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:13:06,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024965014] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:13:06,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:13:06,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-30 10:13:06,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746691075] [2025-04-30 10:13:06,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:13:06,490 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:13:06,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:06,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:13:06,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:13:06,490 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-04-30 10:13:06,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:06,514 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2025-04-30 10:13:06,515 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:13:06,515 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-04-30 10:13:06,515 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:06,515 INFO L225 Difference]: With dead ends: 61 [2025-04-30 10:13:06,516 INFO L226 Difference]: Without dead ends: 37 [2025-04-30 10:13:06,517 INFO L436 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-04-30 10:13:06,517 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 100 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-04-30 10:13:06,517 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 100 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:13:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-30 10:13:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-04-30 10:13:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 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-04-30 10:13:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2025-04-30 10:13:06,524 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 26 [2025-04-30 10:13:06,524 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:06,524 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2025-04-30 10:13:06,524 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-04-30 10:13:06,524 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2025-04-30 10:13:06,525 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:13:06,525 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:06,525 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-04-30 10:13:06,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:13:06,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:06,726 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:06,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:06,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1053934146, now seen corresponding path program 1 times [2025-04-30 10:13:06,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:06,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406829084] [2025-04-30 10:13:06,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:06,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:06,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:13:06,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:13:06,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:06,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:07,059 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:13:07,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:07,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406829084] [2025-04-30 10:13:07,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406829084] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:07,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508744369] [2025-04-30 10:13:07,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:07,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:07,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:07,063 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-04-30 10:13:07,065 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-04-30 10:13:07,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:13:07,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:13:07,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:07,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:07,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-30 10:13:07,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:07,282 INFO L354 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-04-30 10:13:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:13:07,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:13:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:13:07,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508744369] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:13:07,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:13:07,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 13 [2025-04-30 10:13:07,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943054446] [2025-04-30 10:13:07,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:13:07,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:13:07,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:07,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:13:07,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:13:07,337 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:13:11,364 WARN L532 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-04-30 10:13:15,382 WARN L532 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-04-30 10:13:19,408 WARN L532 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-04-30 10:13:23,433 WARN L532 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-04-30 10:13:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:23,551 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2025-04-30 10:13:23,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:13:23,553 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2025-04-30 10:13:23,553 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:23,554 INFO L225 Difference]: With dead ends: 71 [2025-04-30 10:13:23,554 INFO L226 Difference]: Without dead ends: 42 [2025-04-30 10:13:23,554 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:13:23,555 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:23,555 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 334 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-04-30 10:13:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-04-30 10:13:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-04-30 10:13:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 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-04-30 10:13:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2025-04-30 10:13:23,564 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 36 [2025-04-30 10:13:23,565 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:23,565 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2025-04-30 10:13:23,565 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:13:23,565 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2025-04-30 10:13:23,566 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-30 10:13:23,566 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:23,566 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, 1, 1] [2025-04-30 10:13:23,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:13:23,766 WARN L466 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-04-30 10:13:23,767 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:23,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:23,768 INFO L85 PathProgramCache]: Analyzing trace with hash 956764884, now seen corresponding path program 1 times [2025-04-30 10:13:23,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:23,768 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097364117] [2025-04-30 10:13:23,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:23,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:23,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:13:23,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:13:23,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:23,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:25,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:25,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097364117] [2025-04-30 10:13:25,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097364117] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:25,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738055428] [2025-04-30 10:13:25,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:25,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:25,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:25,146 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-04-30 10:13:25,149 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-04-30 10:13:25,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:13:25,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:13:25,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:25,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:25,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-04-30 10:13:25,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:25,296 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:13:25,552 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:13:25,553 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:13:25,607 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:13:25,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:25,661 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 41 [2025-04-30 10:13:25,847 INFO L354 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 60 treesize of output 18 [2025-04-30 10:13:25,852 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:13:26,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:26,026 INFO L354 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 68 treesize of output 51 [2025-04-30 10:13:26,038 INFO L325 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-04-30 10:13:26,039 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2025-04-30 10:13:26,345 INFO L325 Elim1Store]: treesize reduction 71, result has 19.3 percent of original size [2025-04-30 10:13:26,345 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 54 [2025-04-30 10:13:26,363 INFO L325 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-04-30 10:13:26,363 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 93 [2025-04-30 10:13:26,375 INFO L354 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 35 treesize of output 27 [2025-04-30 10:13:26,429 INFO L354 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 58 treesize of output 42 [2025-04-30 10:13:26,436 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:26,436 INFO L354 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 56 treesize of output 48 [2025-04-30 10:13:26,439 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-04-30 10:13:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:26,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:13:26,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738055428] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:26,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:13:26,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 44 [2025-04-30 10:13:26,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647931768] [2025-04-30 10:13:26,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:13:26,844 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-30 10:13:26,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:26,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-30 10:13:26,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2307, Unknown=1, NotChecked=0, Total=2450 [2025-04-30 10:13:26,845 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 44 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 36 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-30 10:13:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:28,461 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2025-04-30 10:13:28,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-30 10:13:28,461 INFO L79 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 36 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 39 [2025-04-30 10:13:28,461 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:28,462 INFO L225 Difference]: With dead ends: 60 [2025-04-30 10:13:28,462 INFO L226 Difference]: Without dead ends: 48 [2025-04-30 10:13:28,464 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=354, Invalid=4901, Unknown=1, NotChecked=0, Total=5256 [2025-04-30 10:13:28,464 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 50 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:28,464 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 576 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-30 10:13:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-30 10:13:28,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-04-30 10:13:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 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-04-30 10:13:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-04-30 10:13:28,479 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 39 [2025-04-30 10:13:28,479 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:28,479 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-04-30 10:13:28,479 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 36 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-30 10:13:28,479 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-04-30 10:13:28,480 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-30 10:13:28,480 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:28,480 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:28,488 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-04-30 10:13:28,680 WARN L466 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-04-30 10:13:28,680 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:28,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:28,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2115033428, now seen corresponding path program 1 times [2025-04-30 10:13:28,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:28,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824406409] [2025-04-30 10:13:28,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:28,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:28,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:13:28,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:13:28,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:28,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:30,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:30,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824406409] [2025-04-30 10:13:30,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824406409] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:30,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990268344] [2025-04-30 10:13:30,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:30,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:30,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:30,640 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-04-30 10:13:30,649 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-04-30 10:13:30,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:13:31,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:13:31,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:31,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:31,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-04-30 10:13:31,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:31,106 INFO L354 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-04-30 10:13:31,416 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:13:31,416 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:13:31,487 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-04-30 10:13:31,491 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:13:31,571 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-30 10:13:31,571 INFO L354 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 50 treesize of output 45 [2025-04-30 10:13:31,576 INFO L354 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-04-30 10:13:31,793 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-30 10:13:31,799 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-30 10:13:31,803 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:13:31,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:31,996 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-04-30 10:13:32,006 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-30 10:13:32,007 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-04-30 10:13:32,021 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-30 10:13:32,314 INFO L354 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 40 treesize of output 16 [2025-04-30 10:13:32,418 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2025-04-30 10:13:32,480 INFO L354 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-04-30 10:13:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:32,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:13:32,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990268344] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:32,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:13:32,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 52 [2025-04-30 10:13:32,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214849682] [2025-04-30 10:13:32,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:13:32,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-30 10:13:32,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:32,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-30 10:13:32,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2933, Unknown=86, NotChecked=0, Total=3192 [2025-04-30 10:13:32,999 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 52 states, 50 states have (on average 1.52) internal successors, (76), 43 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:13:42,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:42,557 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2025-04-30 10:13:42,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-30 10:13:42,558 INFO L79 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.52) internal successors, (76), 43 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2025-04-30 10:13:42,558 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:42,559 INFO L225 Difference]: With dead ends: 70 [2025-04-30 10:13:42,559 INFO L226 Difference]: Without dead ends: 68 [2025-04-30 10:13:42,561 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=373, Invalid=5696, Unknown=93, NotChecked=0, Total=6162 [2025-04-30 10:13:42,561 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 59 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:42,561 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 574 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-30 10:13:42,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-04-30 10:13:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2025-04-30 10:13:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 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-04-30 10:13:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2025-04-30 10:13:42,569 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 45 [2025-04-30 10:13:42,569 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:42,569 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2025-04-30 10:13:42,569 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.52) internal successors, (76), 43 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:13:42,569 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2025-04-30 10:13:42,570 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-30 10:13:42,570 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:42,570 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:42,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:13:42,770 WARN L466 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-04-30 10:13:42,771 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:42,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:42,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2115101938, now seen corresponding path program 1 times [2025-04-30 10:13:42,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:42,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985000875] [2025-04-30 10:13:42,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:42,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:42,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:13:42,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:13:42,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:42,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-30 10:13:42,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:42,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985000875] [2025-04-30 10:13:42,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985000875] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:13:42,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:13:42,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:13:42,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584717346] [2025-04-30 10:13:42,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:13:42,884 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:13:42,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:42,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:13:42,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:13:42,884 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-04-30 10:13:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:42,941 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2025-04-30 10:13:42,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:13:42,942 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 45 [2025-04-30 10:13:42,942 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:42,942 INFO L225 Difference]: With dead ends: 65 [2025-04-30 10:13:42,942 INFO L226 Difference]: Without dead ends: 60 [2025-04-30 10:13:42,943 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:13:42,943 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:42,943 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 109 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:13:42,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-30 10:13:42,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2025-04-30 10:13:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 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-04-30 10:13:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2025-04-30 10:13:42,955 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 45 [2025-04-30 10:13:42,955 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:42,955 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2025-04-30 10:13:42,955 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-04-30 10:13:42,955 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2025-04-30 10:13:42,956 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-30 10:13:42,956 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:42,956 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:42,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:13:42,956 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:42,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:42,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1976467142, now seen corresponding path program 2 times [2025-04-30 10:13:42,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:42,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908155532] [2025-04-30 10:13:42,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:13:42,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:42,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-04-30 10:13:43,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:13:43,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:13:43,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:46,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:46,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908155532] [2025-04-30 10:13:46,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908155532] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:46,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117370641] [2025-04-30 10:13:46,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:13:46,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:46,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:46,094 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-04-30 10:13:46,094 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-04-30 10:13:46,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-04-30 10:13:46,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:13:46,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:13:46,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:46,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 135 conjuncts are in the unsatisfiable core [2025-04-30 10:13:46,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:46,276 INFO L354 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-04-30 10:13:46,323 INFO L354 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-04-30 10:13:46,326 INFO L354 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-04-30 10:13:46,545 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:13:46,546 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:13:46,551 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:13:46,555 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:13:46,615 INFO L354 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 17 treesize of output 19 [2025-04-30 10:13:46,619 INFO L354 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 8 treesize of output 7 [2025-04-30 10:13:46,625 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-04-30 10:13:46,628 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:13:46,687 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-30 10:13:46,687 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 63 [2025-04-30 10:13:46,693 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2025-04-30 10:13:46,955 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-30 10:13:46,955 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2025-04-30 10:13:46,961 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:13:46,965 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-30 10:13:47,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:47,187 INFO L325 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-04-30 10:13:47,187 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2025-04-30 10:13:47,209 INFO L325 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2025-04-30 10:13:47,209 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2025-04-30 10:13:47,232 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-30 10:13:47,233 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-04-30 10:13:47,638 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-30 10:13:47,638 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 22 [2025-04-30 10:13:47,641 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-30 10:13:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:47,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:13:48,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117370641] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:48,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:13:48,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 25] total 54 [2025-04-30 10:13:48,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083612217] [2025-04-30 10:13:48,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:13:48,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-30 10:13:48,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:48,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-30 10:13:48,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=3258, Unknown=0, NotChecked=0, Total=3422 [2025-04-30 10:13:48,061 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 54 states, 52 states have (on average 1.5) internal successors, (78), 44 states have internal predecessors, (78), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:13:51,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:51,300 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2025-04-30 10:13:51,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-30 10:13:51,300 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.5) internal successors, (78), 44 states have internal predecessors, (78), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2025-04-30 10:13:51,301 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:51,301 INFO L225 Difference]: With dead ends: 115 [2025-04-30 10:13:51,301 INFO L226 Difference]: Without dead ends: 98 [2025-04-30 10:13:51,304 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1916 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=473, Invalid=8457, Unknown=0, NotChecked=0, Total=8930 [2025-04-30 10:13:51,304 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:51,305 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 508 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-30 10:13:51,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-04-30 10:13:51,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2025-04-30 10:13:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 69 states have internal predecessors, (77), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-30 10:13:51,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2025-04-30 10:13:51,318 INFO L79 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 48 [2025-04-30 10:13:51,319 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:51,319 INFO L485 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2025-04-30 10:13:51,319 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.5) internal successors, (78), 44 states have internal predecessors, (78), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:13:51,319 INFO L278 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2025-04-30 10:13:51,319 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-30 10:13:51,319 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:51,319 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:51,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:13:51,520 WARN L466 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-04-30 10:13:51,520 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:51,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:51,520 INFO L85 PathProgramCache]: Analyzing trace with hash -302440148, now seen corresponding path program 1 times [2025-04-30 10:13:51,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:51,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049052101] [2025-04-30 10:13:51,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:51,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:51,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:13:51,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:13:51,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:51,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:53,649 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:53,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:53,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049052101] [2025-04-30 10:13:53,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049052101] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:53,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365169322] [2025-04-30 10:13:53,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:53,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:53,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:53,651 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-04-30 10:13:53,652 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-04-30 10:13:53,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:13:53,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:13:53,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:53,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:53,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 153 conjuncts are in the unsatisfiable core [2025-04-30 10:13:53,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:53,874 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:13:53,987 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:13:53,991 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-04-30 10:13:53,997 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:13:54,213 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:13:54,213 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-30 10:13:54,226 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:13:54,227 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:13:54,233 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:13:54,240 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:13:54,300 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2025-04-30 10:13:54,305 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:13:54,312 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:13:54,317 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2025-04-30 10:13:54,323 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:13:54,401 INFO L325 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2025-04-30 10:13:54,401 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 170 treesize of output 91 [2025-04-30 10:13:54,412 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 17 [2025-04-30 10:13:54,417 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 29 [2025-04-30 10:13:54,685 INFO L325 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-04-30 10:13:54,686 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 38 [2025-04-30 10:13:54,691 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2025-04-30 10:13:54,695 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:13:54,699 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-30 10:13:54,830 INFO L325 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-04-30 10:13:54,830 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2025-04-30 10:13:59,098 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0)) (let ((.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse10 (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse2) 0))) (or (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#1.offset|))) (and (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse0) .cse2) 0) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| |c_#memory_$Pointer$#1.base|)) (.cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse0) .cse2))) (and (not (= .cse3 0)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse4 (select |c_#memory_$Pointer$#1.base| .cse4))) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse3) 4) 0) (not (= .cse3 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse3) 4) 0) (not (= .cse3 .cse0)) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4) (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_6| .cse3) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse5 (select |c_#memory_int#1| .cse5))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse5))))))) (= |c_#memory_$Pointer$#1.offset| (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#1.offset| .cse1)))))) (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#1.offset|))) (and (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse6) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse0) .cse2) 0) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| (Array Int (Array Int Int)))) (let ((.cse7 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse0) .cse2)) (.cse8 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| |c_#memory_$Pointer$#1.base|))) (and (not (= .cse7 0)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse8 (select |c_#memory_$Pointer$#1.base| .cse8))) (= (select (select |c_#memory_int#1| .cse7) 0) 1) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse7) 4) 0) (not (= .cse7 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse7) 4) 0) (not (= .cse7 .cse0)) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse8)))) (= |c_#memory_$Pointer$#1.offset| (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse6 (select |c_#memory_$Pointer$#1.offset| .cse6)))))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse2))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse9) 4) 0) (not (= 0 .cse9)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse9)) .cse10 (not (= .cse0 .cse9)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse9) 4) 0) (= (select (select |c_#memory_int#1| .cse9) 0) 1))) (and (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| (Array Int (Array Int Int)))) (let ((.cse11 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse0) .cse2)) (.cse12 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| |c_#memory_$Pointer$#1.base|))) (and (not (= .cse11 0)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse12 (select |c_#memory_$Pointer$#1.base| .cse12))) (= (select (select |c_#memory_int#1| .cse11) 0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse11) 4) 0) (not (= .cse11 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse11) 4) 0) (not (= .cse11 .cse0)) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse12)))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| (Array Int (Array Int Int)))) (let ((.cse14 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| |c_#memory_$Pointer$#1.base|)) (.cse13 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse0) .cse2))) (and (not (= .cse13 0)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse14 (select |c_#memory_$Pointer$#1.base| .cse14))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse13) 4) 0) (not (= .cse13 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse13) 4) 0) (not (= .cse13 .cse0)) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse14) (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse15 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_6| .cse13) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse15 (select |c_#memory_int#1| .cse15))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse15)))))))) .cse10)))))) is different from false [2025-04-30 10:13:59,104 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0)) (let ((.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse10 (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse2) 0))) (or (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#1.offset|))) (and (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse0) .cse2) 0) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| |c_#memory_$Pointer$#1.base|)) (.cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse0) .cse2))) (and (not (= .cse3 0)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse4 (select |c_#memory_$Pointer$#1.base| .cse4))) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse3) 4) 0) (not (= .cse3 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse3) 4) 0) (not (= .cse3 .cse0)) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4) (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_6| .cse3) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse5 (select |c_#memory_int#1| .cse5))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse5))))))) (= |c_#memory_$Pointer$#1.offset| (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#1.offset| .cse1)))))) (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#1.offset|))) (and (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse6) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse0) .cse2) 0) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| (Array Int (Array Int Int)))) (let ((.cse7 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse0) .cse2)) (.cse8 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| |c_#memory_$Pointer$#1.base|))) (and (not (= .cse7 0)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse8 (select |c_#memory_$Pointer$#1.base| .cse8))) (= (select (select |c_#memory_int#1| .cse7) 0) 1) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse7) 4) 0) (not (= .cse7 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse7) 4) 0) (not (= .cse7 .cse0)) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse8)))) (= |c_#memory_$Pointer$#1.offset| (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse6 (select |c_#memory_$Pointer$#1.offset| .cse6)))))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse2))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse9) 4) 0) (not (= 0 .cse9)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse9)) .cse10 (not (= .cse0 .cse9)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse9) 4) 0) (= (select (select |c_#memory_int#1| .cse9) 0) 1))) (and (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| (Array Int (Array Int Int)))) (let ((.cse11 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse0) .cse2)) (.cse12 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| |c_#memory_$Pointer$#1.base|))) (and (not (= .cse11 0)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse12 (select |c_#memory_$Pointer$#1.base| .cse12))) (= (select (select |c_#memory_int#1| .cse11) 0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse11) 4) 0) (not (= .cse11 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse11) 4) 0) (not (= .cse11 .cse0)) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse12)))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| (Array Int (Array Int Int)))) (let ((.cse14 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| |c_#memory_$Pointer$#1.base|)) (.cse13 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse0) .cse2))) (and (not (= .cse13 0)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse14 (select |c_#memory_$Pointer$#1.base| .cse14))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse13) 4) 0) (not (= .cse13 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_17| .cse13) 4) 0) (not (= .cse13 .cse0)) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse14) (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse15 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_6| .cse13) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse15 (select |c_#memory_int#1| .cse15))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse15)))))))) .cse10)))))) is different from true [2025-04-30 10:13:59,564 INFO L325 Elim1Store]: treesize reduction 47, result has 48.9 percent of original size [2025-04-30 10:13:59,564 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 66 [2025-04-30 10:13:59,601 INFO L325 Elim1Store]: treesize reduction 118, result has 21.9 percent of original size [2025-04-30 10:13:59,601 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 173 treesize of output 99 [2025-04-30 10:13:59,630 INFO L325 Elim1Store]: treesize reduction 100, result has 19.4 percent of original size [2025-04-30 10:13:59,630 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 220 [2025-04-30 10:13:59,645 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2025-04-30 10:13:59,676 INFO L325 Elim1Store]: treesize reduction 116, result has 25.2 percent of original size [2025-04-30 10:13:59,676 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 70 [2025-04-30 10:13:59,700 INFO L325 Elim1Store]: treesize reduction 55, result has 19.1 percent of original size [2025-04-30 10:13:59,700 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 65 [2025-04-30 10:13:59,711 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-30 10:13:59,723 INFO L354 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 42 treesize of output 30 [2025-04-30 10:13:59,860 INFO L354 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 299 treesize of output 227 [2025-04-30 10:13:59,863 INFO L354 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 231 treesize of output 171 [2025-04-30 10:14:00,538 INFO L325 Elim1Store]: treesize reduction 36, result has 86.7 percent of original size [2025-04-30 10:14:00,539 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 298 treesize of output 375 [2025-04-30 10:14:00,721 INFO L325 Elim1Store]: treesize reduction 36, result has 86.7 percent of original size [2025-04-30 10:14:00,722 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 136 treesize of output 332 Killed by 15