./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:42:32,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:42:32,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:42:32,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:42:32,615 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:42:32,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:42:32,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:42:32,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:42:32,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:42:32,638 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:42:32,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:42:32,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:42:32,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:42:32,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:42:32,638 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:42:32,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:42:32,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:42:32,639 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:42:32,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:42:32,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:42:32,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:42:32,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:42:32,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:42:32,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:42:32,639 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:42:32,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:42:32,639 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:42:32,640 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:42:32,640 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:42:32,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:42:32,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:42:32,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:42:32,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:42:32,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:42:32,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:42:32,640 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:42:32,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:42:32,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:42:32,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:42:32,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:42:32,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:42:32,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:42:32,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:42:32,641 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2025-02-05 14:42:32,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:42:32,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:42:32,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:42:32,880 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:42:32,881 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:42:32,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2025-02-05 14:42:34,041 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f6fc08e5/5b7eecb55b6e42cca21909500a66ecc0/FLAG99c77edb0 [2025-02-05 14:42:34,322 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:42:34,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2025-02-05 14:42:34,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f6fc08e5/5b7eecb55b6e42cca21909500a66ecc0/FLAG99c77edb0 [2025-02-05 14:42:34,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f6fc08e5/5b7eecb55b6e42cca21909500a66ecc0 [2025-02-05 14:42:34,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:42:34,638 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:42:34,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:42:34,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:42:34,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:42:34,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:42:34" (1/1) ... [2025-02-05 14:42:34,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6174fe8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:42:34, skipping insertion in model container [2025-02-05 14:42:34,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:42:34" (1/1) ... [2025-02-05 14:42:34,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:42:34,967 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2025-02-05 14:42:34,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:42:34,976 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:42:35,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2025-02-05 14:42:35,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:42:35,049 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:42:35,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:42:35 WrapperNode [2025-02-05 14:42:35,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:42:35,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:42:35,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:42:35,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:42:35,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:42:35" (1/1) ... [2025-02-05 14:42:35,065 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:42:35" (1/1) ... [2025-02-05 14:42:35,079 INFO L138 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2025-02-05 14:42:35,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:42:35,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:42:35,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:42:35,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:42:35,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:42:35" (1/1) ... [2025-02-05 14:42:35,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:42:35" (1/1) ... [2025-02-05 14:42:35,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:42:35" (1/1) ... [2025-02-05 14:42:35,098 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-02-05 14:42:35,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:42:35" (1/1) ... [2025-02-05 14:42:35,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:42:35" (1/1) ... [2025-02-05 14:42:35,104 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:42:35" (1/1) ... [2025-02-05 14:42:35,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:42:35" (1/1) ... [2025-02-05 14:42:35,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:42:35" (1/1) ... [2025-02-05 14:42:35,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:42:35" (1/1) ... [2025-02-05 14:42:35,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:42:35,111 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:42:35,111 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:42:35,111 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:42:35,112 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:42:35" (1/1) ... [2025-02-05 14:42:35,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:42:35,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:42:35,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 14:42:35,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 14:42:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-02-05 14:42:35,161 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-02-05 14:42:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:42:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:42:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:42:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:42:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:42:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:42:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:42:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:42:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:42:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:42:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:42:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:42:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:42:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:42:35,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:42:35,260 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:42:35,262 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:42:35,279 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-02-05 14:42:35,422 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-02-05 14:42:35,422 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:42:35,430 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:42:35,431 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:42:35,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:42:35 BoogieIcfgContainer [2025-02-05 14:42:35,431 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:42:35,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:42:35,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:42:35,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:42:35,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:42:34" (1/3) ... [2025-02-05 14:42:35,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0e36dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:42:35, skipping insertion in model container [2025-02-05 14:42:35,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:42:35" (2/3) ... [2025-02-05 14:42:35,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0e36dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:42:35, skipping insertion in model container [2025-02-05 14:42:35,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:42:35" (3/3) ... [2025-02-05 14:42:35,438 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2025-02-05 14:42:35,448 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:42:35,453 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_circular_traversal-1.i that has 2 procedures, 28 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-05 14:42:35,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:42:35,536 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;@e0adfb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:42:35,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:42:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:42:35,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-05 14:42:35,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:42:35,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:42:35,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:42:35,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:42:35,563 INFO L85 PathProgramCache]: Analyzing trace with hash 132159055, now seen corresponding path program 1 times [2025-02-05 14:42:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:42:35,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064323900] [2025-02-05 14:42:35,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:42:35,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:42:35,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-05 14:42:35,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-05 14:42:35,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:42:35,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:35,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:42:35,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:42:35,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064323900] [2025-02-05 14:42:35,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064323900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:42:35,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:42:35,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:42:35,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113672811] [2025-02-05 14:42:35,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:42:35,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:42:35,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:42:35,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:42:35,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:42:35,829 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:42:35,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:42:35,852 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2025-02-05 14:42:35,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:42:35,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-05 14:42:35,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:42:35,861 INFO L225 Difference]: With dead ends: 47 [2025-02-05 14:42:35,864 INFO L226 Difference]: Without dead ends: 22 [2025-02-05 14:42:35,866 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-02-05 14:42:35,868 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 56 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-02-05 14:42:35,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 56 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:42:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-05 14:42:35,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-02-05 14:42:35,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:42:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-02-05 14:42:35,904 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 9 [2025-02-05 14:42:35,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:42:35,908 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-02-05 14:42:35,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:42:35,908 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-02-05 14:42:35,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 14:42:35,908 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:42:35,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:42:35,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:42:35,909 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:42:35,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:42:35,909 INFO L85 PathProgramCache]: Analyzing trace with hash -30046203, now seen corresponding path program 1 times [2025-02-05 14:42:35,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:42:35,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434000257] [2025-02-05 14:42:35,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:42:35,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:42:35,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 14:42:35,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 14:42:35,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:42:35,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:42:36,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:42:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434000257] [2025-02-05 14:42:36,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434000257] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:42:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498286723] [2025-02-05 14:42:36,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:42:36,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:42:36,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:42:36,068 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:42:36,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 14:42:36,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 14:42:36,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 14:42:36,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:42:36,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:36,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 14:42:36,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:42:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:42:36,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:42:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:42:36,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498286723] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:42:36,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:42:36,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 14:42:36,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145184371] [2025-02-05 14:42:36,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:42:36,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:42:36,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:42:36,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:42:36,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:42:36,276 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:42:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:42:36,306 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2025-02-05 14:42:36,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 14:42:36,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-05 14:42:36,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:42:36,306 INFO L225 Difference]: With dead ends: 41 [2025-02-05 14:42:36,306 INFO L226 Difference]: Without dead ends: 29 [2025-02-05 14:42:36,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:42:36,307 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:42:36,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 40 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:42:36,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-05 14:42:36,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-02-05 14:42:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:42:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-02-05 14:42:36,310 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 12 [2025-02-05 14:42:36,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:42:36,310 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-02-05 14:42:36,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:42:36,310 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-02-05 14:42:36,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 14:42:36,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:42:36,311 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:42:36,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 14:42:36,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:42:36,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:42:36,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:42:36,524 INFO L85 PathProgramCache]: Analyzing trace with hash -571695409, now seen corresponding path program 2 times [2025-02-05 14:42:36,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:42:36,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148995346] [2025-02-05 14:42:36,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:42:36,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:42:36,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-05 14:42:36,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 14:42:36,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:42:36,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:37,165 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:42:37,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:42:37,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148995346] [2025-02-05 14:42:37,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148995346] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:42:37,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275948991] [2025-02-05 14:42:37,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:42:37,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:42:37,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:42:37,169 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:42:37,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 14:42:37,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-05 14:42:37,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 14:42:37,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:42:37,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:37,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-05 14:42:37,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:42:37,614 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 13 treesize of output 9 [2025-02-05 14:42:37,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:42:37,665 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 25 treesize of output 13 [2025-02-05 14:42:37,748 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 14:42:37,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:42:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 14:42:37,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275948991] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:42:37,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:42:37,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2025-02-05 14:42:37,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925952181] [2025-02-05 14:42:37,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:42:37,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 14:42:37,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:42:37,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 14:42:37,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-02-05 14:42:37,975 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:42:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:42:38,316 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-02-05 14:42:38,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 14:42:38,316 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-05 14:42:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:42:38,317 INFO L225 Difference]: With dead ends: 33 [2025-02-05 14:42:38,317 INFO L226 Difference]: Without dead ends: 31 [2025-02-05 14:42:38,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2025-02-05 14:42:38,318 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:42:38,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 164 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:42:38,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-05 14:42:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-05 14:42:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:42:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-02-05 14:42:38,322 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 21 [2025-02-05 14:42:38,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:42:38,322 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-02-05 14:42:38,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:42:38,322 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-02-05 14:42:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 14:42:38,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:42:38,323 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:42:38,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 14:42:38,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:42:38,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:42:38,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:42:38,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1830247507, now seen corresponding path program 1 times [2025-02-05 14:42:38,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:42:38,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693636581] [2025-02-05 14:42:38,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:42:38,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:42:38,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 14:42:38,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:42:38,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:42:38,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:42:39,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:42:39,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693636581] [2025-02-05 14:42:39,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693636581] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:42:39,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807648579] [2025-02-05 14:42:39,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:42:39,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:42:39,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:42:39,572 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:42:39,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 14:42:39,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 14:42:39,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:42:39,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:42:39,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:39,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-02-05 14:42:39,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:42:39,746 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-02-05 14:42:39,805 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-05 14:42:39,806 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-02-05 14:42:39,814 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 22 treesize of output 1 [2025-02-05 14:42:39,824 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 18 treesize of output 7 [2025-02-05 14:42:39,876 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-02-05 14:42:39,876 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 31 treesize of output 30 [2025-02-05 14:42:39,881 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 27 treesize of output 15 [2025-02-05 14:42:39,895 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-05 14:42:39,896 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 19 treesize of output 18 [2025-02-05 14:42:40,069 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-05 14:42:40,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 37 [2025-02-05 14:42:40,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:42:40,079 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 42 treesize of output 34 [2025-02-05 14:42:40,089 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-05 14:42:40,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2025-02-05 14:42:40,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:42:40,103 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 30 treesize of output 30 [2025-02-05 14:42:40,116 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:42:40,116 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 27 treesize of output 26 [2025-02-05 14:42:40,207 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:42:40,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:42:40,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:42:40,442 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 154 treesize of output 158 [2025-02-05 14:42:40,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:42:40,461 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 157 treesize of output 161 [2025-02-05 14:42:40,579 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (or (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 Int)) (= (select (select (store |c_#memory_int#1| v_prenex_11 v_prenex_10) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse1 .cse2) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_371 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_369 Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_369)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_371) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (forall ((v_ArrVal_371 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_371) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse2) (or (and (or (forall ((v_prenex_12 Int) (v_prenex_10 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_363 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| v_prenex_11 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_363) v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_12)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_10) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))) .cse2) (forall ((v_prenex_12 Int) (v_prenex_10 (Array Int Int)) (v_prenex_11 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_11) (= (select (select (store (store |c_#memory_int#1| v_prenex_11 (store (select |c_#memory_int#1| v_prenex_11) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_12)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_10) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse1) (or (forall ((v_ArrVal_371 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_363 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_369 Int)) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_363) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_369)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_371) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse2))) is different from false [2025-02-05 14:42:41,098 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2025-02-05 14:42:41,099 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 2 case distinctions, treesize of input 40 treesize of output 43 [2025-02-05 14:42:41,104 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 48 treesize of output 36 [2025-02-05 14:42:41,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:42:41,150 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-02-05 14:42:41,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 37 [2025-02-05 14:42:41,155 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:42:41,157 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 26 treesize of output 18 [2025-02-05 14:42:41,176 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-05 14:42:41,177 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 1 case distinctions, treesize of input 18 treesize of output 1 [2025-02-05 14:42:41,184 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-05 14:42:41,185 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 1 case distinctions, treesize of input 37 treesize of output 1 [2025-02-05 14:42:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 6 not checked. [2025-02-05 14:42:41,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807648579] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:42:41,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:42:41,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 29 [2025-02-05 14:42:41,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578842070] [2025-02-05 14:42:41,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:42:41,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 14:42:41,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:42:41,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 14:42:41,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=667, Unknown=7, NotChecked=52, Total=812 [2025-02-05 14:42:41,262 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:42:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:42:41,662 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-02-05 14:42:41,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 14:42:41,663 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 14:42:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:42:41,664 INFO L225 Difference]: With dead ends: 47 [2025-02-05 14:42:41,664 INFO L226 Difference]: Without dead ends: 45 [2025-02-05 14:42:41,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=146, Invalid=973, Unknown=7, NotChecked=64, Total=1190 [2025-02-05 14:42:41,665 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:42:41,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 118 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 314 Invalid, 0 Unknown, 30 Unchecked, 0.2s Time] [2025-02-05 14:42:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-05 14:42:41,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2025-02-05 14:42:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:42:41,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-02-05 14:42:41,669 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 24 [2025-02-05 14:42:41,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:42:41,669 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-02-05 14:42:41,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:42:41,670 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-02-05 14:42:41,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 14:42:41,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:42:41,670 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:42:41,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 14:42:41,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:42:41,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:42:41,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:42:41,874 INFO L85 PathProgramCache]: Analyzing trace with hash -902419086, now seen corresponding path program 1 times [2025-02-05 14:42:41,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:42:41,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851035669] [2025-02-05 14:42:41,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:42:41,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:42:41,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 14:42:41,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 14:42:41,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:42:41,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:42:42,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:42:42,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851035669] [2025-02-05 14:42:42,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851035669] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:42:42,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544295376] [2025-02-05 14:42:42,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:42:42,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:42:42,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:42:42,411 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:42:42,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 14:42:42,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 14:42:42,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 14:42:42,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:42:42,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:42,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-05 14:42:42,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:42:42,590 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-02-05 14:42:42,612 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-05 14:42:42,613 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 19 treesize of output 16 [2025-02-05 14:42:42,647 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-05 14:42:42,647 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 19 treesize of output 16 [2025-02-05 14:42:42,672 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-05 14:42:42,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-05 14:42:42,704 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-02-05 14:42:42,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-02-05 14:42:42,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2025-02-05 14:42:42,898 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 17 treesize of output 12 [2025-02-05 14:42:43,206 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-02-05 14:42:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:42:43,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:42:43,463 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 41 treesize of output 39 [2025-02-05 14:42:43,471 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 20 [2025-02-05 14:42:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:42:43,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544295376] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:42:43,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:42:43,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2025-02-05 14:42:43,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825343523] [2025-02-05 14:42:43,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:42:43,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 14:42:43,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:42:43,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 14:42:43,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=287, Unknown=3, NotChecked=0, Total=342 [2025-02-05 14:42:43,738 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:42:44,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:42:44,176 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2025-02-05 14:42:44,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 14:42:44,177 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 14:42:44,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:42:44,177 INFO L225 Difference]: With dead ends: 42 [2025-02-05 14:42:44,177 INFO L226 Difference]: Without dead ends: 34 [2025-02-05 14:42:44,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=371, Unknown=3, NotChecked=0, Total=462 [2025-02-05 14:42:44,178 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:42:44,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 114 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 14:42:44,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-05 14:42:44,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-05 14:42:44,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:42:44,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-02-05 14:42:44,181 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 25 [2025-02-05 14:42:44,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:42:44,182 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-02-05 14:42:44,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:42:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-02-05 14:42:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 14:42:44,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:42:44,182 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:42:44,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 14:42:44,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:42:44,383 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:42:44,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:42:44,384 INFO L85 PathProgramCache]: Analyzing trace with hash -291304945, now seen corresponding path program 2 times [2025-02-05 14:42:44,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:42:44,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020263277] [2025-02-05 14:42:44,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:42:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:42:44,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-05 14:42:44,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 14:42:44,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:42:44,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:42:46,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:42:46,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020263277] [2025-02-05 14:42:46,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020263277] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:42:46,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267586894] [2025-02-05 14:42:46,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:42:46,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:42:46,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:42:46,871 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:42:46,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 14:42:46,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-05 14:42:47,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 14:42:47,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:42:47,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:47,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-02-05 14:42:47,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:42:47,062 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-02-05 14:42:47,111 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-02-05 14:42:47,151 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-05 14:42:47,152 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 11 treesize of output 11 [2025-02-05 14:42:47,212 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 18 treesize of output 7 [2025-02-05 14:42:47,219 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-02-05 14:42:47,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2025-02-05 14:42:47,328 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-02-05 14:42:47,328 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 1 case distinctions, treesize of input 54 treesize of output 35 [2025-02-05 14:42:47,339 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:42:47,340 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-05 14:42:47,381 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2025-02-05 14:42:47,381 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 1 case distinctions, treesize of input 30 treesize of output 22 [2025-02-05 14:42:47,499 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2025-02-05 14:42:47,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 80 [2025-02-05 14:42:47,508 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-05 14:42:47,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 39 [2025-02-05 14:42:47,532 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-02-05 14:42:47,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2025-02-05 14:42:48,475 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-02-05 14:42:48,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 179 treesize of output 138 [2025-02-05 14:42:48,522 INFO L349 Elim1Store]: treesize reduction 60, result has 62.5 percent of original size [2025-02-05 14:42:48,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 172 treesize of output 245 [2025-02-05 14:42:48,585 INFO L349 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2025-02-05 14:42:48,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 168 treesize of output 160 [2025-02-05 14:42:52,481 INFO L349 Elim1Store]: treesize reduction 1368, result has 0.1 percent of original size [2025-02-05 14:42:52,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 19 select indices, 19 select index equivalence classes, 1 disjoint index pairs (out of 171 index pairs), introduced 20 new quantified variables, introduced 171 case distinctions, treesize of input 746 treesize of output 494 [2025-02-05 14:42:55,446 INFO L349 Elim1Store]: treesize reduction 8, result has 99.4 percent of original size [2025-02-05 14:42:55,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 20 new quantified variables, introduced 171 case distinctions, treesize of input 719 treesize of output 1706 [2025-02-05 14:42:56,910 INFO L349 Elim1Store]: treesize reduction 236, result has 69.8 percent of original size [2025-02-05 14:42:56,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 1 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 78 case distinctions, treesize of input 314 treesize of output 798 [2025-02-05 14:42:57,347 INFO L349 Elim1Store]: treesize reduction 216, result has 0.5 percent of original size [2025-02-05 14:42:57,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 302 treesize of output 287 [2025-02-05 14:42:57,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:42:57,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 294 treesize of output 450