./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_equal.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 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:43:00,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:43:00,325 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:43:00,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:43:00,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:43:00,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:43:00,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:43:00,356 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:43:00,356 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:43:00,356 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:43:00,356 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:43:00,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:43:00,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:43:00,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:43:00,357 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:43:00,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:43:00,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:43:00,357 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:43:00,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:43:00,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:43:00,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:43:00,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:43:00,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:43:00,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:43:00,359 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:43:00,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:43:00,359 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:43:00,359 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:43:00,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:43:00,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:43:00,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:43:00,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:43:00,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:43:00,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:43:00,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:43:00,360 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:43:00,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:43:00,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:43:00,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:43:00,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:43:00,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:43:00,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:43:00,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:43:00,361 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2025-03-16 17:43:00,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:43:00,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:43:00,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:43:00,618 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:43:00,618 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:43:00,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2025-03-16 17:43:01,773 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5f23e068/2c15bb8e86474b069b9486ef1fcfc9b1/FLAGd1a08ad16 [2025-03-16 17:43:02,025 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:43:02,026 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2025-03-16 17:43:02,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5f23e068/2c15bb8e86474b069b9486ef1fcfc9b1/FLAGd1a08ad16 [2025-03-16 17:43:02,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5f23e068/2c15bb8e86474b069b9486ef1fcfc9b1 [2025-03-16 17:43:02,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:43:02,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:43:02,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:43:02,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:43:02,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:43:02,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:43:02" (1/1) ... [2025-03-16 17:43:02,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c96a1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:02, skipping insertion in model container [2025-03-16 17:43:02,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:43:02" (1/1) ... [2025-03-16 17:43:02,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:43:02,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2025-03-16 17:43:02,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:43:02,301 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:43:02,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2025-03-16 17:43:02,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:43:02,370 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:43:02,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:02 WrapperNode [2025-03-16 17:43:02,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:43:02,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:43:02,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:43:02,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:43:02,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:02" (1/1) ... [2025-03-16 17:43:02,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:02" (1/1) ... [2025-03-16 17:43:02,406 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 133 [2025-03-16 17:43:02,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:43:02,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:43:02,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:43:02,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:43:02,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:02" (1/1) ... [2025-03-16 17:43:02,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:02" (1/1) ... [2025-03-16 17:43:02,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:02" (1/1) ... [2025-03-16 17:43:02,444 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 14, 9]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2025-03-16 17:43:02,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:02" (1/1) ... [2025-03-16 17:43:02,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:02" (1/1) ... [2025-03-16 17:43:02,452 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:02" (1/1) ... [2025-03-16 17:43:02,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:02" (1/1) ... [2025-03-16 17:43:02,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:02" (1/1) ... [2025-03-16 17:43:02,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:02" (1/1) ... [2025-03-16 17:43:02,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:43:02,464 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:43:02,464 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:43:02,464 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:43:02,465 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:02" (1/1) ... [2025-03-16 17:43:02,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:43:02,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:02,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 17:43:02,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 17:43:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 17:43:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 17:43:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 17:43:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 17:43:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 17:43:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 17:43:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-16 17:43:02,513 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-16 17:43:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 17:43:02,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:43:02,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 17:43:02,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 17:43:02,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 17:43:02,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 17:43:02,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 17:43:02,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 17:43:02,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 17:43:02,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:43:02,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 17:43:02,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 17:43:02,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 17:43:02,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:43:02,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 17:43:02,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 17:43:02,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:43:02,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:43:02,627 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:43:02,628 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:43:02,799 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L631: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-16 17:43:02,815 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-16 17:43:02,833 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-03-16 17:43:02,833 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:43:02,839 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:43:02,841 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:43:02,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:43:02 BoogieIcfgContainer [2025-03-16 17:43:02,841 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:43:02,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:43:02,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:43:02,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:43:02,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:43:02" (1/3) ... [2025-03-16 17:43:02,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2b9790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:43:02, skipping insertion in model container [2025-03-16 17:43:02,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:02" (2/3) ... [2025-03-16 17:43:02,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2b9790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:43:02, skipping insertion in model container [2025-03-16 17:43:02,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:43:02" (3/3) ... [2025-03-16 17:43:02,849 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2025-03-16 17:43:02,858 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:43:02,860 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_insert_equal.i that has 2 procedures, 31 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-16 17:43:02,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:43:02,911 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5892d973, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:43:02,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:43:02,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 17:43:02,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:02,919 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:02,919 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:02,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:02,924 INFO L85 PathProgramCache]: Analyzing trace with hash -233083251, now seen corresponding path program 1 times [2025-03-16 17:43:02,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:02,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441666987] [2025-03-16 17:43:02,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:02,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:03,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 17:43:03,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 17:43:03,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:03,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 17:43:03,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:03,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441666987] [2025-03-16 17:43:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441666987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:43:03,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:43:03,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:43:03,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227119947] [2025-03-16 17:43:03,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:43:03,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:43:03,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:03,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:43:03,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:43:03,270 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:43:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:03,294 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2025-03-16 17:43:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:43:03,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 22 [2025-03-16 17:43:03,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:03,303 INFO L225 Difference]: With dead ends: 59 [2025-03-16 17:43:03,303 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 17:43:03,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:43:03,308 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:03,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 74 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:03,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 17:43:03,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-03-16 17:43:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2025-03-16 17:43:03,332 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 22 [2025-03-16 17:43:03,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:03,332 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2025-03-16 17:43:03,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:43:03,332 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2025-03-16 17:43:03,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 17:43:03,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:03,333 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:03,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:43:03,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:03,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:03,334 INFO L85 PathProgramCache]: Analyzing trace with hash -219947345, now seen corresponding path program 1 times [2025-03-16 17:43:03,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:03,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505296575] [2025-03-16 17:43:03,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:03,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:03,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 17:43:03,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 17:43:03,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:03,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:03,453 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 17:43:03,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:03,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505296575] [2025-03-16 17:43:03,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505296575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:43:03,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:43:03,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:43:03,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710518558] [2025-03-16 17:43:03,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:43:03,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:43:03,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:03,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:43:03,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:43:03,455 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 17:43:03,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:03,466 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2025-03-16 17:43:03,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:43:03,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2025-03-16 17:43:03,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:03,467 INFO L225 Difference]: With dead ends: 34 [2025-03-16 17:43:03,467 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 17:43:03,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:43:03,468 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:03,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:03,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 17:43:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-16 17:43:03,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:03,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-03-16 17:43:03,474 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 30 [2025-03-16 17:43:03,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:03,474 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-16 17:43:03,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 17:43:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-03-16 17:43:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 17:43:03,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:03,476 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:03,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:43:03,476 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:03,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:03,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1056824608, now seen corresponding path program 1 times [2025-03-16 17:43:03,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:03,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198941584] [2025-03-16 17:43:03,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:03,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:03,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 17:43:03,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 17:43:03,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:03,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:05,307 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:43:05,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:05,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198941584] [2025-03-16 17:43:05,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198941584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:05,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207481983] [2025-03-16 17:43:05,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:05,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:05,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:05,348 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:05,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 17:43:05,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 17:43:05,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 17:43:05,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:05,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:05,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-03-16 17:43:05,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:05,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:43:05,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:43:06,045 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:43:06,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-16 17:43:06,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-16 17:43:06,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-16 17:43:06,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-16 17:43:06,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 17:43:06,474 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-16 17:43:06,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-16 17:43:06,500 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-16 17:43:06,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-03-16 17:43:06,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-03-16 17:43:06,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-16 17:43:06,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-16 17:43:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:43:06,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:08,534 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_241 Int) (v_ArrVal_240 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_241)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_240) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2025-03-16 17:43:08,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207481983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:08,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:43:08,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2025-03-16 17:43:08,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475599056] [2025-03-16 17:43:08,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:43:08,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-16 17:43:08,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:08,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-16 17:43:08,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1896, Unknown=23, NotChecked=88, Total=2162 [2025-03-16 17:43:08,801 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 41 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 31 states have internal predecessors, (49), 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-03-16 17:43:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:09,776 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2025-03-16 17:43:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-16 17:43:09,777 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 31 states have internal predecessors, (49), 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 31 [2025-03-16 17:43:09,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:09,777 INFO L225 Difference]: With dead ends: 49 [2025-03-16 17:43:09,777 INFO L226 Difference]: Without dead ends: 47 [2025-03-16 17:43:09,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=272, Invalid=3131, Unknown=23, NotChecked=114, Total=3540 [2025-03-16 17:43:09,779 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:09,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 368 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 17:43:09,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-16 17:43:09,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2025-03-16 17:43:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2025-03-16 17:43:09,785 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 31 [2025-03-16 17:43:09,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:09,786 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2025-03-16 17:43:09,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 31 states have internal predecessors, (49), 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-03-16 17:43:09,786 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2025-03-16 17:43:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 17:43:09,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:09,788 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:09,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 17:43:09,988 WARN L453 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-03-16 17:43:09,989 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:09,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:09,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1571204238, now seen corresponding path program 1 times [2025-03-16 17:43:09,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:09,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287887540] [2025-03-16 17:43:09,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:09,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:10,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 17:43:10,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 17:43:10,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:10,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:10,068 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 17:43:10,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:10,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287887540] [2025-03-16 17:43:10,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287887540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:43:10,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:43:10,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:43:10,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091383333] [2025-03-16 17:43:10,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:43:10,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:43:10,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:10,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:43:10,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:43:10,069 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 17:43:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:10,084 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2025-03-16 17:43:10,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:43:10,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-03-16 17:43:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:10,085 INFO L225 Difference]: With dead ends: 48 [2025-03-16 17:43:10,085 INFO L226 Difference]: Without dead ends: 38 [2025-03-16 17:43:10,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:43:10,086 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:10,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 60 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:10,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-16 17:43:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-16 17:43:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2025-03-16 17:43:10,092 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 32 [2025-03-16 17:43:10,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:10,092 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-03-16 17:43:10,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 17:43:10,092 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2025-03-16 17:43:10,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 17:43:10,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:10,093 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:10,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 17:43:10,093 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:10,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:10,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1982049487, now seen corresponding path program 2 times [2025-03-16 17:43:10,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:10,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374800586] [2025-03-16 17:43:10,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:43:10,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:10,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-16 17:43:10,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 17:43:10,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:43:10,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 17:43:10,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:10,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374800586] [2025-03-16 17:43:10,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374800586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:10,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944125806] [2025-03-16 17:43:10,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:43:10,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:10,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:10,233 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:10,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 17:43:10,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-16 17:43:10,340 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 17:43:10,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:43:10,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:10,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 17:43:10,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:10,361 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 17:43:10,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:43:10,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944125806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:43:10,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 17:43:10,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-03-16 17:43:10,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159274353] [2025-03-16 17:43:10,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:43:10,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:43:10,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:10,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:43:10,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:43:10,363 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 17:43:10,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:10,386 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2025-03-16 17:43:10,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:43:10,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-03-16 17:43:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:10,387 INFO L225 Difference]: With dead ends: 47 [2025-03-16 17:43:10,387 INFO L226 Difference]: Without dead ends: 36 [2025-03-16 17:43:10,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:43:10,388 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:10,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 87 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:10,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-16 17:43:10,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-03-16 17:43:10,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-03-16 17:43:10,396 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 32 [2025-03-16 17:43:10,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:10,396 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-16 17:43:10,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 17:43:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-03-16 17:43:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 17:43:10,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:10,397 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:10,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 17:43:10,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:10,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:10,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:10,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1996238914, now seen corresponding path program 1 times [2025-03-16 17:43:10,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:10,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697682036] [2025-03-16 17:43:10,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:10,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:10,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 17:43:10,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:43:10,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:10,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:10,978 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:43:10,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:10,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697682036] [2025-03-16 17:43:10,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697682036] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:10,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211353747] [2025-03-16 17:43:10,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:10,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:10,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:10,981 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:10,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 17:43:11,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 17:43:11,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:43:11,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:11,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:11,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-16 17:43:11,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:11,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:43:11,220 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:43:11,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-16 17:43:11,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:43:11,295 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2025-03-16 17:43:11,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 57 [2025-03-16 17:43:11,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2025-03-16 17:43:11,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 17:43:11,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:43:11,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2025-03-16 17:43:11,413 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-03-16 17:43:11,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2025-03-16 17:43:11,511 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2025-03-16 17:43:11,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 59 [2025-03-16 17:43:11,531 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2025-03-16 17:43:11,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 74 [2025-03-16 17:43:11,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-03-16 17:43:11,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-03-16 17:43:11,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-03-16 17:43:11,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-16 17:43:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:43:11,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:11,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211353747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:11,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:43:11,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 29 [2025-03-16 17:43:11,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968762637] [2025-03-16 17:43:11,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:43:11,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 17:43:11,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:11,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 17:43:11,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=891, Unknown=19, NotChecked=0, Total=992 [2025-03-16 17:43:11,789 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 29 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 22 states have internal predecessors, (46), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-16 17:43:12,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:12,321 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2025-03-16 17:43:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 17:43:12,322 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 22 states have internal predecessors, (46), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2025-03-16 17:43:12,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:12,322 INFO L225 Difference]: With dead ends: 57 [2025-03-16 17:43:12,322 INFO L226 Difference]: Without dead ends: 54 [2025-03-16 17:43:12,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=1957, Unknown=19, NotChecked=0, Total=2162 [2025-03-16 17:43:12,323 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:12,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 265 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 17:43:12,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-16 17:43:12,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 35. [2025-03-16 17:43:12,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:12,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-16 17:43:12,329 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 33 [2025-03-16 17:43:12,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:12,329 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-16 17:43:12,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 22 states have internal predecessors, (46), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-16 17:43:12,329 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-03-16 17:43:12,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 17:43:12,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:12,330 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:12,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 17:43:12,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:12,532 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:12,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1340963235, now seen corresponding path program 1 times [2025-03-16 17:43:12,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:12,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45760749] [2025-03-16 17:43:12,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:12,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:12,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 17:43:12,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:43:12,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:12,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:12,705 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 17:43:12,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:12,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45760749] [2025-03-16 17:43:12,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45760749] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:12,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475539102] [2025-03-16 17:43:12,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:12,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:12,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:12,708 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:12,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 17:43:12,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 17:43:12,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:43:12,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:12,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:12,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 17:43:12,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:12,871 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 17:43:12,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 17:43:12,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475539102] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:43:12,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:43:12,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2025-03-16 17:43:12,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659639329] [2025-03-16 17:43:12,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:43:12,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 17:43:12,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:12,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 17:43:12,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 17:43:12,933 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 17:43:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:13,039 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2025-03-16 17:43:13,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 17:43:13,040 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2025-03-16 17:43:13,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:13,040 INFO L225 Difference]: With dead ends: 43 [2025-03-16 17:43:13,040 INFO L226 Difference]: Without dead ends: 34 [2025-03-16 17:43:13,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-16 17:43:13,041 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:13,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 233 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:43:13,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-16 17:43:13,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-03-16 17:43:13,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2025-03-16 17:43:13,051 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 33 [2025-03-16 17:43:13,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:13,051 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2025-03-16 17:43:13,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 17:43:13,051 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2025-03-16 17:43:13,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 17:43:13,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:13,053 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:13,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 17:43:13,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:13,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:13,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:13,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1753844509, now seen corresponding path program 1 times [2025-03-16 17:43:13,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:13,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596550047] [2025-03-16 17:43:13,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:13,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:13,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 17:43:13,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 17:43:13,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:13,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:13,975 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:43:13,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:13,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596550047] [2025-03-16 17:43:13,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596550047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:13,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771212726] [2025-03-16 17:43:13,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:13,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:13,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:13,978 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:13,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 17:43:14,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 17:43:14,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 17:43:14,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:14,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:14,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-03-16 17:43:14,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:14,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:43:14,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-16 17:43:14,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:43:14,660 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-16 17:43:14,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-16 17:43:14,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:43:14,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2025-03-16 17:43:14,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-16 17:43:14,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-16 17:43:14,857 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-16 17:43:14,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 62 [2025-03-16 17:43:14,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-03-16 17:43:14,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2025-03-16 17:43:14,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2025-03-16 17:43:15,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-16 17:43:15,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-16 17:43:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:43:15,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:15,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:15,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 70 [2025-03-16 17:43:15,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:15,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 139 [2025-03-16 17:43:15,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2025-03-16 17:43:15,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:15,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 102 [2025-03-16 17:43:15,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:15,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 181 [2025-03-16 17:43:15,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-03-16 17:43:16,180 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (+ |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 4)) (.cse2 (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse16)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse6 (= .cse4 .cse16)) (.cse1 (and (forall ((v_arrayElimCell_46 Int) (v_ArrVal_844 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| .cse4 v_ArrVal_840))) (let ((.cse14 (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_844))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 (+ 4 v_arrayElimCell_46))) (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_44 Int)) (= (select (select (store .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse14) v_arrayElimCell_44) (+ 4 v_arrayElimCell_47)) |c_ULTIMATE.start_main_~data~0#1|)))))) (or .cse2 (forall ((v_arrayElimCell_46 Int) (v_ArrVal_844 Int) (v_ArrVal_840 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| .cse4 v_ArrVal_840) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_844) (+ 4 v_arrayElimCell_46))))))) (.cse5 (and (or (forall ((v_arrayElimCell_43 Int) (v_ArrVal_840 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| .cse4 v_ArrVal_840) v_arrayElimCell_43) .cse9))) .cse2) (forall ((v_arrayElimCell_43 Int) (v_ArrVal_844 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| .cse4 v_ArrVal_840))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse10 v_arrayElimCell_43) .cse9)) (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_44 Int)) (= (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_844)) v_arrayElimCell_44) (+ 4 v_arrayElimCell_47)) |c_ULTIMATE.start_main_~data~0#1|))))) (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_43 Int) (v_ArrVal_844 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse11 (let ((.cse12 (store |c_#memory_int#1| .cse4 v_ArrVal_840))) (store .cse12 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_844))))) (or (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_44 Int)) (= (select (select .cse11 v_arrayElimCell_44) (+ 4 v_arrayElimCell_47)) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 v_arrayElimCell_43) (+ 4 v_arrayElimCell_46)))))) (or .cse2 (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_43 Int) (v_ArrVal_844 Int) (v_ArrVal_840 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse13 (store |c_#memory_int#1| .cse4 v_ArrVal_840))) (store .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_844))) v_arrayElimCell_43) (+ 4 v_arrayElimCell_46))))))) (.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (or .cse0 .cse1) (or (not .cse2) (forall ((v_arrayElimCell_47 Int) (v_ArrVal_844 Int) (v_ArrVal_840 (Array Int Int)) (v_arrayElimCell_44 Int)) (= (select (select (let ((.cse3 (store |c_#memory_int#1| .cse4 v_ArrVal_840))) (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_844))) v_arrayElimCell_44) (+ 4 v_arrayElimCell_47)) |c_ULTIMATE.start_main_~data~0#1|))) (or .cse5 .cse6) (forall ((v_ArrVal_844 Int) (v_ArrVal_840 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| .cse4 v_ArrVal_840))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (or (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_44 Int)) (= (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_844)) v_arrayElimCell_44) (+ 4 v_arrayElimCell_47)) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 .cse9)))))) (or .cse6 .cse1) (or .cse2 (forall ((v_ArrVal_840 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| .cse4 v_ArrVal_840) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) .cse9)))) (or .cse5 .cse0))))) is different from false [2025-03-16 17:43:18,916 INFO L349 Elim1Store]: treesize reduction 204, result has 82.7 percent of original size [2025-03-16 17:43:18,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 13 new quantified variables, introduced 79 case distinctions, treesize of input 2587 treesize of output 3064 [2025-03-16 17:43:20,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:20,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 2284 treesize of output 3278 [2025-03-16 17:43:20,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:20,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2023 treesize of output 2008 [2025-03-16 17:43:21,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2027 treesize of output 2015 [2025-03-16 17:43:21,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2015 treesize of output 2013 [2025-03-16 17:43:21,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:21,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2041 treesize of output 2036 [2025-03-16 17:43:22,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2027 treesize of output 2025 [2025-03-16 17:43:22,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:22,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2081 treesize of output 2066 [2025-03-16 17:43:23,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:23,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2085 treesize of output 2080 [2025-03-16 17:43:23,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2071 treesize of output 2069 [2025-03-16 17:43:23,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2097 treesize of output 2085 [2025-03-16 17:43:24,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:24,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2113 treesize of output 2108 [2025-03-16 17:43:24,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2127 treesize of output 2115 [2025-03-16 17:43:24,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:24,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2157 treesize of output 2150 [2025-03-16 17:43:25,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2155 treesize of output 2151 [2025-03-16 17:43:25,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:25,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2193 treesize of output 2186 [2025-03-16 17:43:26,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2191 treesize of output 2187