./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/bor5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/array-crafted/bor5.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 1a4987addfe5f74a2ffcc1ac07d342e5a630d26b982b6fa887540d0e2c4f5965 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:03:47,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:03:47,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 17:03:47,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:03:47,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:03:47,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:03:47,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:03:47,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:03:47,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:03:47,850 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:03:47,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:03:47,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:03:47,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:03:47,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:03:47,851 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:03:47,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:03:47,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:03:47,851 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:03:47,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:03:47,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:03:47,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:03:47,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:03:47,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:03:47,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:03:47,851 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:03:47,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:03:47,851 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:03:47,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:03:47,852 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:03:47,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:03:47,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:03:47,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:03:47,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:03:47,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:03:47,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:03:47,852 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:03:47,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:03:47,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:03:47,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:03:47,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:03:47,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:03:47,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:03:47,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:03:47,852 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 -> 1a4987addfe5f74a2ffcc1ac07d342e5a630d26b982b6fa887540d0e2c4f5965 [2025-02-07 17:03:48,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:03:48,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:03:48,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:03:48,085 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:03:48,085 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:03:48,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bor5.i [2025-02-07 17:03:49,315 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9c09a17a/21d011cbb4e742eb8065d3350a4e3198/FLAG258127d45 [2025-02-07 17:03:49,537 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:03:49,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-crafted/bor5.i [2025-02-07 17:03:49,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9c09a17a/21d011cbb4e742eb8065d3350a4e3198/FLAG258127d45 [2025-02-07 17:03:49,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9c09a17a/21d011cbb4e742eb8065d3350a4e3198 [2025-02-07 17:03:49,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:03:49,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:03:49,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:03:49,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:03:49,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:03:49,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:03:49" (1/1) ... [2025-02-07 17:03:49,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@280b0f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:03:49, skipping insertion in model container [2025-02-07 17:03:49,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:03:49" (1/1) ... [2025-02-07 17:03:49,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:03:49,675 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/array-crafted/bor5.i[1364,1377] [2025-02-07 17:03:49,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:03:49,683 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:03:49,695 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/array-crafted/bor5.i[1364,1377] [2025-02-07 17:03:49,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:03:49,704 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:03:49,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:03:49 WrapperNode [2025-02-07 17:03:49,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:03:49,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:03:49,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:03:49,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:03:49,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:03:49" (1/1) ... [2025-02-07 17:03:49,714 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:03:49" (1/1) ... [2025-02-07 17:03:49,724 INFO L138 Inliner]: procedures = 16, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 75 [2025-02-07 17:03:49,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:03:49,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:03:49,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:03:49,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:03:49,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:03:49" (1/1) ... [2025-02-07 17:03:49,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:03:49" (1/1) ... [2025-02-07 17:03:49,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:03:49" (1/1) ... [2025-02-07 17:03:49,739 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 5 writes are split as follows [0, 0, 5]. [2025-02-07 17:03:49,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:03:49" (1/1) ... [2025-02-07 17:03:49,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:03:49" (1/1) ... [2025-02-07 17:03:49,746 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:03:49" (1/1) ... [2025-02-07 17:03:49,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:03:49" (1/1) ... [2025-02-07 17:03:49,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:03:49" (1/1) ... [2025-02-07 17:03:49,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:03:49" (1/1) ... [2025-02-07 17:03:49,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:03:49,749 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:03:49,749 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:03:49,749 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:03:49,750 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:03:49" (1/1) ... [2025-02-07 17:03:49,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:03:49,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:03:49,773 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-07 17:03:49,777 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-07 17:03:49,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:03:49,790 INFO L130 BoogieDeclarations]: Found specification of procedure bor [2025-02-07 17:03:49,790 INFO L138 BoogieDeclarations]: Found implementation of procedure bor [2025-02-07 17:03:49,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:03:49,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 17:03:49,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 17:03:49,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 17:03:49,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 17:03:49,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 17:03:49,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 17:03:49,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:03:49,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:03:49,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 17:03:49,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 17:03:49,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 17:03:49,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 17:03:49,839 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:03:49,843 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:03:49,964 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-07 17:03:49,964 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:03:49,981 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:03:49,981 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:03:49,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:03:49 BoogieIcfgContainer [2025-02-07 17:03:49,982 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:03:49,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:03:49,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:03:49,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:03:49,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:03:49" (1/3) ... [2025-02-07 17:03:49,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed9aea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:03:49, skipping insertion in model container [2025-02-07 17:03:49,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:03:49" (2/3) ... [2025-02-07 17:03:49,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed9aea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:03:49, skipping insertion in model container [2025-02-07 17:03:49,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:03:49" (3/3) ... [2025-02-07 17:03:49,988 INFO L128 eAbstractionObserver]: Analyzing ICFG bor5.i [2025-02-07 17:03:49,997 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:03:49,998 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bor5.i that has 2 procedures, 25 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-07 17:03:50,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:03:50,036 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;@691ddf0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:03:50,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:03:50,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 17:03:50,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 17:03:50,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:03:50,043 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:03:50,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:03:50,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:03:50,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1131066325, now seen corresponding path program 1 times [2025-02-07 17:03:50,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:03:50,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099434309] [2025-02-07 17:03:50,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:03:50,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:03:50,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 17:03:50,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 17:03:50,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:03:50,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:03:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:03:50,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:03:50,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099434309] [2025-02-07 17:03:50,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099434309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:03:50,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:03:50,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:03:50,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978608528] [2025-02-07 17:03:50,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:03:50,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:03:50,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:03:50,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:03:50,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:03:50,303 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 17:03:50,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:03:50,359 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2025-02-07 17:03:50,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:03:50,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2025-02-07 17:03:50,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:03:50,365 INFO L225 Difference]: With dead ends: 48 [2025-02-07 17:03:50,365 INFO L226 Difference]: Without dead ends: 22 [2025-02-07 17:03:50,367 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-07 17:03:50,370 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:03:50,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:03:50,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-07 17:03:50,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-07 17:03:50,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 17:03:50,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-02-07 17:03:50,395 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 24 [2025-02-07 17:03:50,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:03:50,396 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-02-07 17:03:50,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 17:03:50,397 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-02-07 17:03:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 17:03:50,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:03:50,398 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:03:50,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:03:50,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:03:50,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:03:50,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2019015697, now seen corresponding path program 1 times [2025-02-07 17:03:50,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:03:50,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174519023] [2025-02-07 17:03:50,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:03:50,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:03:50,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 17:03:50,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 17:03:50,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:03:50,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:03:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 17:03:50,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:03:50,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174519023] [2025-02-07 17:03:50,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174519023] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:03:50,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412162889] [2025-02-07 17:03:50,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:03:50,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:03:50,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:03:50,546 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-07 17:03:50,548 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-07 17:03:50,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 17:03:50,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 17:03:50,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:03:50,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:03:50,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 17:03:50,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:03:50,682 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:03:50,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:03:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:03:50,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412162889] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:03:50,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:03:50,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-02-07 17:03:50,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389536789] [2025-02-07 17:03:50,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:03:50,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 17:03:50,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:03:50,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 17:03:50,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-07 17:03:50,726 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-07 17:03:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:03:50,823 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2025-02-07 17:03:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 17:03:50,824 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 25 [2025-02-07 17:03:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:03:50,825 INFO L225 Difference]: With dead ends: 46 [2025-02-07 17:03:50,825 INFO L226 Difference]: Without dead ends: 28 [2025-02-07 17:03:50,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-07 17:03:50,826 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:03:50,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 92 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:03:50,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-07 17:03:50,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2025-02-07 17:03:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 17:03:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-02-07 17:03:50,832 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 25 [2025-02-07 17:03:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:03:50,832 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-02-07 17:03:50,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-07 17:03:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-02-07 17:03:50,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 17:03:50,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:03:50,834 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:03:50,845 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-07 17:03:51,040 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-07 17:03:51,040 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:03:51,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:03:51,042 INFO L85 PathProgramCache]: Analyzing trace with hash 240769340, now seen corresponding path program 1 times [2025-02-07 17:03:51,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:03:51,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559743857] [2025-02-07 17:03:51,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:03:51,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:03:51,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 17:03:51,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 17:03:51,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:03:51,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:03:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-07 17:03:51,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:03:51,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559743857] [2025-02-07 17:03:51,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559743857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:03:51,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:03:51,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:03:51,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461064754] [2025-02-07 17:03:51,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:03:51,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:03:51,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:03:51,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:03:51,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:03:51,173 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 17:03:51,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:03:51,204 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-02-07 17:03:51,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:03:51,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-02-07 17:03:51,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:03:51,205 INFO L225 Difference]: With dead ends: 39 [2025-02-07 17:03:51,205 INFO L226 Difference]: Without dead ends: 25 [2025-02-07 17:03:51,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:03:51,205 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:03:51,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 31 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:03:51,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-07 17:03:51,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-07 17:03:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 17:03:51,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2025-02-07 17:03:51,209 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 35 [2025-02-07 17:03:51,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:03:51,210 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2025-02-07 17:03:51,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 17:03:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2025-02-07 17:03:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-07 17:03:51,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:03:51,211 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:03:51,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 17:03:51,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:03:51,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:03:51,212 INFO L85 PathProgramCache]: Analyzing trace with hash 321110560, now seen corresponding path program 1 times [2025-02-07 17:03:51,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:03:51,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528273408] [2025-02-07 17:03:51,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:03:51,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:03:51,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-07 17:03:51,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-07 17:03:51,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:03:51,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:03:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 17:03:54,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:03:54,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528273408] [2025-02-07 17:03:54,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528273408] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:03:54,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119143846] [2025-02-07 17:03:54,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:03:54,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:03:54,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:03:54,652 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-07 17:03:54,654 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-07 17:03:54,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-07 17:03:54,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-07 17:03:54,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:03:54,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:03:54,725 WARN L254 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-02-07 17:03:54,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:03:54,831 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 15 treesize of output 1 [2025-02-07 17:03:55,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:03:55,255 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 64 treesize of output 40 [2025-02-07 17:03:55,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:03:55,977 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 124 treesize of output 75 [2025-02-07 17:03:56,118 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 0 case distinctions, treesize of input 87 treesize of output 51 [2025-02-07 17:03:56,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:03:56,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 181 treesize of output 129 [2025-02-07 17:03:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:03:56,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:04:31,713 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 74 treesize of output 66 [2025-02-07 17:04:31,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:04:31,718 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 53 treesize of output 47 [2025-02-07 17:04:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 17:04:31,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119143846] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:04:31,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:04:31,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31, 29] total 81 [2025-02-07 17:04:31,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039030923] [2025-02-07 17:04:31,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:04:31,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2025-02-07 17:04:31,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:04:31,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2025-02-07 17:04:31,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=6051, Unknown=8, NotChecked=0, Total=6480 [2025-02-07 17:04:31,852 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 81 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 71 states have internal predecessors, (83), 9 states have call successors, (9), 3 states have call predecessors, (9), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 17:04:35,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 17:04:40,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 17:04:44,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 17:04:48,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 17:05:23,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 17:05:27,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 17:05:31,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]