./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/hardness-nfm22/hardness_operatoramount_amount500_file-95.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 d09885049a0031727b27530c803aaab3d322c61ed8e044029287939cd57fd4df --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:52:20,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:52:20,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:52:20,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:52:20,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:52:20,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:52:20,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:52:20,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:52:20,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:52:20,655 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:52:20,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:52:20,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:52:20,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:52:20,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:52:20,656 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:52:20,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:52:20,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:52:20,656 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:52:20,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:52:20,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:52:20,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:52:20,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:52:20,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:52:20,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:52:20,657 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:52:20,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:52:20,657 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:52:20,657 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:52:20,658 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:52:20,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:52:20,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:52:20,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:52:20,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:52:20,658 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:52:20,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:52:20,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:52:20,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:52:20,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:52:20,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:52:20,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:52:20,659 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:52:20,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:52:20,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:52:20,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:52:20,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:52:20,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:52:20,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:52:20,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:52:20,659 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 -> d09885049a0031727b27530c803aaab3d322c61ed8e044029287939cd57fd4df [2025-01-09 14:52:20,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:52:20,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:52:20,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:52:20,950 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:52:20,950 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:52:20,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-95.i [2025-01-09 14:52:22,364 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b54e041a/114dfa3991fe40f6b06556415d29d408/FLAG56a9f07a6 [2025-01-09 14:52:22,746 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:52:22,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-95.i [2025-01-09 14:52:22,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b54e041a/114dfa3991fe40f6b06556415d29d408/FLAG56a9f07a6 [2025-01-09 14:52:22,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b54e041a/114dfa3991fe40f6b06556415d29d408 [2025-01-09 14:52:22,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:52:22,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:52:22,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:52:22,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:52:22,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:52:22,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:52:22" (1/1) ... [2025-01-09 14:52:22,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1afd64a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:22, skipping insertion in model container [2025-01-09 14:52:22,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:52:22" (1/1) ... [2025-01-09 14:52:22,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:52:23,000 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/hardness-nfm22/hardness_operatoramount_amount500_file-95.i[916,929] [2025-01-09 14:52:23,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:52:23,260 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:52:23,271 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/hardness-nfm22/hardness_operatoramount_amount500_file-95.i[916,929] [2025-01-09 14:52:23,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:52:23,410 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:52:23,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:23 WrapperNode [2025-01-09 14:52:23,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:52:23,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:52:23,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:52:23,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:52:23,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:23" (1/1) ... [2025-01-09 14:52:23,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:23" (1/1) ... [2025-01-09 14:52:23,550 INFO L138 Inliner]: procedures = 26, calls = 82, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 688 [2025-01-09 14:52:23,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:52:23,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:52:23,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:52:23,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:52:23,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:23" (1/1) ... [2025-01-09 14:52:23,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:23" (1/1) ... [2025-01-09 14:52:23,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:23" (1/1) ... [2025-01-09 14:52:23,657 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:52:23,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:23" (1/1) ... [2025-01-09 14:52:23,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:23" (1/1) ... [2025-01-09 14:52:23,696 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:23" (1/1) ... [2025-01-09 14:52:23,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:23" (1/1) ... [2025-01-09 14:52:23,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:23" (1/1) ... [2025-01-09 14:52:23,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:23" (1/1) ... [2025-01-09 14:52:23,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:23" (1/1) ... [2025-01-09 14:52:23,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:52:23,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:52:23,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:52:23,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:52:23,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:23" (1/1) ... [2025-01-09 14:52:23,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:52:23,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:23,801 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-01-09 14:52:23,807 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-01-09 14:52:23,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:52:23,830 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:52:23,830 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:52:23,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:52:23,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:52:23,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:52:23,981 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:52:23,982 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:52:25,225 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-01-09 14:52:25,226 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:52:25,244 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:52:25,248 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:52:25,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:52:25 BoogieIcfgContainer [2025-01-09 14:52:25,248 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:52:25,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:52:25,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:52:25,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:52:25,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:52:22" (1/3) ... [2025-01-09 14:52:25,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdd1b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:52:25, skipping insertion in model container [2025-01-09 14:52:25,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:23" (2/3) ... [2025-01-09 14:52:25,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdd1b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:52:25, skipping insertion in model container [2025-01-09 14:52:25,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:52:25" (3/3) ... [2025-01-09 14:52:25,259 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-95.i [2025-01-09 14:52:25,273 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:52:25,277 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-95.i that has 2 procedures, 282 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:52:25,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:52:25,358 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;@43ec2e03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:52:25,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:52:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 282 states, 210 states have (on average 1.5333333333333334) internal successors, (322), 211 states have internal predecessors, (322), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 14:52:25,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-01-09 14:52:25,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:25,397 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:25,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:25,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:25,403 INFO L85 PathProgramCache]: Analyzing trace with hash 603646365, now seen corresponding path program 1 times [2025-01-09 14:52:25,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:25,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391637838] [2025-01-09 14:52:25,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:25,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:25,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-01-09 14:52:25,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-01-09 14:52:25,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:25,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:26,519 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:52:26,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:26,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391637838] [2025-01-09 14:52:26,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391637838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:26,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:26,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:52:26,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062379006] [2025-01-09 14:52:26,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:26,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:52:26,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:26,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:52:26,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:26,560 INFO L87 Difference]: Start difference. First operand has 282 states, 210 states have (on average 1.5333333333333334) internal successors, (322), 211 states have internal predecessors, (322), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:52:26,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:26,770 INFO L93 Difference]: Finished difference Result 828 states and 1497 transitions. [2025-01-09 14:52:26,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:52:26,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 477 [2025-01-09 14:52:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:26,791 INFO L225 Difference]: With dead ends: 828 [2025-01-09 14:52:26,792 INFO L226 Difference]: Without dead ends: 549 [2025-01-09 14:52:26,798 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-01-09 14:52:26,801 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 439 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:26,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1084 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:52:26,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-01-09 14:52:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 322. [2025-01-09 14:52:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 251 states have (on average 1.545816733067729) internal successors, (388), 251 states have internal predecessors, (388), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 14:52:26,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 526 transitions. [2025-01-09 14:52:26,927 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 526 transitions. Word has length 477 [2025-01-09 14:52:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:26,934 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 526 transitions. [2025-01-09 14:52:26,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:52:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 526 transitions. [2025-01-09 14:52:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-01-09 14:52:26,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:26,949 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:26,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 14:52:26,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:26,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:26,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1304811425, now seen corresponding path program 1 times [2025-01-09 14:52:26,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:26,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762914668] [2025-01-09 14:52:26,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:26,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:27,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-01-09 14:52:27,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-01-09 14:52:27,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:27,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:52:27,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:27,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762914668] [2025-01-09 14:52:27,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762914668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:27,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:27,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:52:27,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639830786] [2025-01-09 14:52:27,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:27,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:52:27,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:27,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:52:27,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:27,610 INFO L87 Difference]: Start difference. First operand 322 states and 526 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:52:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:27,777 INFO L93 Difference]: Finished difference Result 955 states and 1562 transitions. [2025-01-09 14:52:27,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:52:27,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 477 [2025-01-09 14:52:27,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:27,789 INFO L225 Difference]: With dead ends: 955 [2025-01-09 14:52:27,789 INFO L226 Difference]: Without dead ends: 636 [2025-01-09 14:52:27,791 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-01-09 14:52:27,792 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 414 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:27,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1245 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:52:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-01-09 14:52:27,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 634. [2025-01-09 14:52:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 493 states have (on average 1.5314401622718052) internal successors, (755), 493 states have internal predecessors, (755), 138 states have call successors, (138), 2 states have call predecessors, (138), 2 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2025-01-09 14:52:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1031 transitions. [2025-01-09 14:52:27,865 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 1031 transitions. Word has length 477 [2025-01-09 14:52:27,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:27,866 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 1031 transitions. [2025-01-09 14:52:27,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:52:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1031 transitions. [2025-01-09 14:52:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-01-09 14:52:27,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:27,874 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:27,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:52:27,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:27,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:27,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1079113313, now seen corresponding path program 1 times [2025-01-09 14:52:27,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:27,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210361995] [2025-01-09 14:52:27,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:27,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:27,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-01-09 14:52:28,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-01-09 14:52:28,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:28,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:52:29,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:29,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210361995] [2025-01-09 14:52:29,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210361995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:29,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:29,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:52:29,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040683077] [2025-01-09 14:52:29,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:29,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:52:29,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:29,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:52:29,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:52:29,278 INFO L87 Difference]: Start difference. First operand 634 states and 1031 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:52:30,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:30,991 INFO L93 Difference]: Finished difference Result 2378 states and 3841 transitions. [2025-01-09 14:52:30,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:52:30,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 477 [2025-01-09 14:52:30,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:31,006 INFO L225 Difference]: With dead ends: 2378 [2025-01-09 14:52:31,007 INFO L226 Difference]: Without dead ends: 1747 [2025-01-09 14:52:31,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:52:31,013 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 930 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 3082 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:31,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 3082 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 14:52:31,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2025-01-09 14:52:31,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1265. [2025-01-09 14:52:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 964 states have (on average 1.4968879668049793) internal successors, (1443), 968 states have internal predecessors, (1443), 292 states have call successors, (292), 8 states have call predecessors, (292), 8 states have return successors, (292), 288 states have call predecessors, (292), 292 states have call successors, (292) [2025-01-09 14:52:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 2027 transitions. [2025-01-09 14:52:31,202 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 2027 transitions. Word has length 477 [2025-01-09 14:52:31,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:31,203 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 2027 transitions. [2025-01-09 14:52:31,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:52:31,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 2027 transitions. [2025-01-09 14:52:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-01-09 14:52:31,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:31,215 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:31,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:52:31,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:31,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:31,217 INFO L85 PathProgramCache]: Analyzing trace with hash -484412823, now seen corresponding path program 1 times [2025-01-09 14:52:31,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:31,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66044312] [2025-01-09 14:52:31,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:31,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:31,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-01-09 14:52:31,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-01-09 14:52:31,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:31,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:52:31,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:31,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66044312] [2025-01-09 14:52:31,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66044312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:31,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:31,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:52:31,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747689316] [2025-01-09 14:52:31,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:31,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:52:31,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:31,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:52:31,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:31,917 INFO L87 Difference]: Start difference. First operand 1265 states and 2027 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:52:32,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:32,357 INFO L93 Difference]: Finished difference Result 3396 states and 5451 transitions. [2025-01-09 14:52:32,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:52:32,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 477 [2025-01-09 14:52:32,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:32,374 INFO L225 Difference]: With dead ends: 3396 [2025-01-09 14:52:32,375 INFO L226 Difference]: Without dead ends: 2134 [2025-01-09 14:52:32,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:52:32,381 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 351 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:32,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1345 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:52:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2025-01-09 14:52:32,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1386. [2025-01-09 14:52:32,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1014 states have (on average 1.4733727810650887) internal successors, (1494), 1018 states have internal predecessors, (1494), 361 states have call successors, (361), 10 states have call predecessors, (361), 10 states have return successors, (361), 357 states have call predecessors, (361), 361 states have call successors, (361) [2025-01-09 14:52:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2216 transitions. [2025-01-09 14:52:32,556 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2216 transitions. Word has length 477 [2025-01-09 14:52:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:32,559 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 2216 transitions. [2025-01-09 14:52:32,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:52:32,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2216 transitions. [2025-01-09 14:52:32,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 14:52:32,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:32,571 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:32,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:52:32,571 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:32,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:32,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1825138743, now seen corresponding path program 1 times [2025-01-09 14:52:32,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:32,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836973] [2025-01-09 14:52:32,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:32,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:32,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 14:52:32,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 14:52:32,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:32,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:33,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:52:33,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:33,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836973] [2025-01-09 14:52:33,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:33,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:33,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:52:33,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170435460] [2025-01-09 14:52:33,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:33,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:52:33,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:33,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:52:33,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:52:33,231 INFO L87 Difference]: Start difference. First operand 1386 states and 2216 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:52:33,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:33,745 INFO L93 Difference]: Finished difference Result 3915 states and 6328 transitions. [2025-01-09 14:52:33,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:52:33,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 478 [2025-01-09 14:52:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:33,766 INFO L225 Difference]: With dead ends: 3915 [2025-01-09 14:52:33,767 INFO L226 Difference]: Without dead ends: 2653 [2025-01-09 14:52:33,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:52:33,775 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 727 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:33,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1855 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:52:33,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2025-01-09 14:52:33,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 1390. [2025-01-09 14:52:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1018 states have (on average 1.4734774066797642) internal successors, (1500), 1022 states have internal predecessors, (1500), 361 states have call successors, (361), 10 states have call predecessors, (361), 10 states have return successors, (361), 357 states have call predecessors, (361), 361 states have call successors, (361) [2025-01-09 14:52:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2222 transitions. [2025-01-09 14:52:33,962 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2222 transitions. Word has length 478 [2025-01-09 14:52:33,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:33,964 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 2222 transitions. [2025-01-09 14:52:33,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:52:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2222 transitions. [2025-01-09 14:52:33,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 14:52:33,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:33,975 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:33,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:52:33,976 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:33,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:33,977 INFO L85 PathProgramCache]: Analyzing trace with hash -500282549, now seen corresponding path program 1 times [2025-01-09 14:52:33,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:33,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446479459] [2025-01-09 14:52:33,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:33,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:34,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 14:52:34,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 14:52:34,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:34,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:52:34,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:34,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446479459] [2025-01-09 14:52:34,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446479459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:34,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:34,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:52:34,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94522636] [2025-01-09 14:52:34,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:34,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:52:34,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:34,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:52:34,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:34,634 INFO L87 Difference]: Start difference. First operand 1390 states and 2222 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:52:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:34,799 INFO L93 Difference]: Finished difference Result 3275 states and 5258 transitions. [2025-01-09 14:52:34,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:52:34,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 478 [2025-01-09 14:52:34,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:34,816 INFO L225 Difference]: With dead ends: 3275 [2025-01-09 14:52:34,816 INFO L226 Difference]: Without dead ends: 2013 [2025-01-09 14:52:34,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-01-09 14:52:34,822 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 283 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:34,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 875 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:52:34,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2025-01-09 14:52:34,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1957. [2025-01-09 14:52:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1957 states, 1445 states have (on average 1.4719723183391002) internal successors, (2127), 1449 states have internal predecessors, (2127), 499 states have call successors, (499), 12 states have call predecessors, (499), 12 states have return successors, (499), 495 states have call predecessors, (499), 499 states have call successors, (499) [2025-01-09 14:52:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3125 transitions. [2025-01-09 14:52:35,014 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3125 transitions. Word has length 478 [2025-01-09 14:52:35,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:35,015 INFO L471 AbstractCegarLoop]: Abstraction has 1957 states and 3125 transitions. [2025-01-09 14:52:35,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:52:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3125 transitions. [2025-01-09 14:52:35,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 14:52:35,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:35,021 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:35,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:52:35,021 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:35,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:35,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1803792705, now seen corresponding path program 1 times [2025-01-09 14:52:35,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:35,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313666568] [2025-01-09 14:52:35,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:35,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:35,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 14:52:36,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 14:52:36,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:36,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 42 proven. 162 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-01-09 14:52:37,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:37,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313666568] [2025-01-09 14:52:37,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313666568] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:52:37,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559535869] [2025-01-09 14:52:37,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:37,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:52:37,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:37,616 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-01-09 14:52:37,617 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-01-09 14:52:37,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 14:52:38,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 14:52:38,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:38,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:38,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 1164 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:52:38,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:52:39,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 5432 proven. 66 refuted. 0 times theorem prover too weak. 3886 trivial. 0 not checked. [2025-01-09 14:52:39,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:52:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 138 proven. 66 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-01-09 14:52:39,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559535869] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:52:39,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:52:39,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-09 14:52:39,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302043497] [2025-01-09 14:52:39,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:52:39,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 14:52:39,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:39,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 14:52:39,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:52:39,955 INFO L87 Difference]: Start difference. First operand 1957 states and 3125 transitions. Second operand has 14 states, 14 states have (on average 23.642857142857142) internal successors, (331), 14 states have internal predecessors, (331), 6 states have call successors, (191), 3 states have call predecessors, (191), 6 states have return successors, (191), 6 states have call predecessors, (191), 6 states have call successors, (191) [2025-01-09 14:52:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:41,109 INFO L93 Difference]: Finished difference Result 3436 states and 5464 transitions. [2025-01-09 14:52:41,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:52:41,111 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 23.642857142857142) internal successors, (331), 14 states have internal predecessors, (331), 6 states have call successors, (191), 3 states have call predecessors, (191), 6 states have return successors, (191), 6 states have call predecessors, (191), 6 states have call successors, (191) Word has length 478 [2025-01-09 14:52:41,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:41,128 INFO L225 Difference]: With dead ends: 3436 [2025-01-09 14:52:41,128 INFO L226 Difference]: Without dead ends: 1607 [2025-01-09 14:52:41,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 951 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:52:41,135 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 727 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:41,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1329 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:52:41,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2025-01-09 14:52:41,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1595. [2025-01-09 14:52:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1215 states have (on average 1.477366255144033) internal successors, (1795), 1217 states have internal predecessors, (1795), 361 states have call successors, (361), 18 states have call predecessors, (361), 18 states have return successors, (361), 359 states have call predecessors, (361), 361 states have call successors, (361) [2025-01-09 14:52:41,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2517 transitions. [2025-01-09 14:52:41,270 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2517 transitions. Word has length 478 [2025-01-09 14:52:41,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:41,272 INFO L471 AbstractCegarLoop]: Abstraction has 1595 states and 2517 transitions. [2025-01-09 14:52:41,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 23.642857142857142) internal successors, (331), 14 states have internal predecessors, (331), 6 states have call successors, (191), 3 states have call predecessors, (191), 6 states have return successors, (191), 6 states have call predecessors, (191), 6 states have call successors, (191) [2025-01-09 14:52:41,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2517 transitions. [2025-01-09 14:52:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-01-09 14:52:41,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:41,277 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:41,290 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-01-09 14:52:41,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:52:41,479 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:41,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:41,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2058765873, now seen corresponding path program 1 times [2025-01-09 14:52:41,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:41,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722656011] [2025-01-09 14:52:41,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:41,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:41,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-01-09 14:52:42,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-01-09 14:52:42,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:42,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 174 proven. 30 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-01-09 14:52:43,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:43,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722656011] [2025-01-09 14:52:43,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722656011] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:52:43,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243370456] [2025-01-09 14:52:43,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:43,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:52:43,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:43,200 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-01-09 14:52:43,203 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-01-09 14:52:43,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-01-09 14:52:43,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-01-09 14:52:43,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:43,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:43,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:52:43,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:52:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 4604 proven. 120 refuted. 0 times theorem prover too weak. 4660 trivial. 0 not checked. [2025-01-09 14:52:43,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:52:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 84 proven. 120 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-01-09 14:52:44,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243370456] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:52:44,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:52:44,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2025-01-09 14:52:44,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943366748] [2025-01-09 14:52:44,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:52:44,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:52:44,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:44,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:52:44,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:52:44,317 INFO L87 Difference]: Start difference. First operand 1595 states and 2517 transitions. Second operand has 11 states, 11 states have (on average 22.90909090909091) internal successors, (252), 11 states have internal predecessors, (252), 4 states have call successors, (149), 2 states have call predecessors, (149), 4 states have return successors, (151), 4 states have call predecessors, (151), 4 states have call successors, (151) [2025-01-09 14:52:45,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:45,216 INFO L93 Difference]: Finished difference Result 3144 states and 4905 transitions. [2025-01-09 14:52:45,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 14:52:45,217 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 22.90909090909091) internal successors, (252), 11 states have internal predecessors, (252), 4 states have call successors, (149), 2 states have call predecessors, (149), 4 states have return successors, (151), 4 states have call predecessors, (151), 4 states have call successors, (151) Word has length 479 [2025-01-09 14:52:45,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:45,229 INFO L225 Difference]: With dead ends: 3144 [2025-01-09 14:52:45,229 INFO L226 Difference]: Without dead ends: 1685 [2025-01-09 14:52:45,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 976 GetRequests, 954 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-01-09 14:52:45,235 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 601 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:45,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1038 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:52:45,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2025-01-09 14:52:45,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1655. [2025-01-09 14:52:45,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1260 states have (on average 1.4492063492063492) internal successors, (1826), 1262 states have internal predecessors, (1826), 361 states have call successors, (361), 33 states have call predecessors, (361), 33 states have return successors, (361), 359 states have call predecessors, (361), 361 states have call successors, (361) [2025-01-09 14:52:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2548 transitions. [2025-01-09 14:52:45,383 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2548 transitions. Word has length 479 [2025-01-09 14:52:45,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:45,384 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2548 transitions. [2025-01-09 14:52:45,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.90909090909091) internal successors, (252), 11 states have internal predecessors, (252), 4 states have call successors, (149), 2 states have call predecessors, (149), 4 states have return successors, (151), 4 states have call predecessors, (151), 4 states have call successors, (151) [2025-01-09 14:52:45,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2548 transitions. [2025-01-09 14:52:45,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-01-09 14:52:45,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:45,391 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:45,403 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-01-09 14:52:45,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:52:45,592 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:45,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:45,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2075847627, now seen corresponding path program 1 times [2025-01-09 14:52:45,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:45,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249236540] [2025-01-09 14:52:45,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:45,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:45,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-09 14:52:45,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-09 14:52:45,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:45,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:52:46,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:46,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249236540] [2025-01-09 14:52:46,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249236540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:46,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:46,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:52:46,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400038360] [2025-01-09 14:52:46,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:46,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:52:46,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:46,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:52:46,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:46,467 INFO L87 Difference]: Start difference. First operand 1655 states and 2548 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:52:46,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:46,807 INFO L93 Difference]: Finished difference Result 3212 states and 4944 transitions. [2025-01-09 14:52:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:52:46,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 480 [2025-01-09 14:52:46,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:46,821 INFO L225 Difference]: With dead ends: 3212 [2025-01-09 14:52:46,821 INFO L226 Difference]: Without dead ends: 1705 [2025-01-09 14:52:46,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:52:46,828 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 673 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:46,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 983 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:52:46,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2025-01-09 14:52:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1675. [2025-01-09 14:52:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1275 states have (on average 1.4392156862745098) internal successors, (1835), 1277 states have internal predecessors, (1835), 361 states have call successors, (361), 38 states have call predecessors, (361), 38 states have return successors, (361), 359 states have call predecessors, (361), 361 states have call successors, (361) [2025-01-09 14:52:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2557 transitions. [2025-01-09 14:52:46,959 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2557 transitions. Word has length 480 [2025-01-09 14:52:46,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:46,960 INFO L471 AbstractCegarLoop]: Abstraction has 1675 states and 2557 transitions. [2025-01-09 14:52:46,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:52:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2557 transitions. [2025-01-09 14:52:46,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-01-09 14:52:46,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:46,971 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:46,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:52:46,972 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:46,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:46,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1689599718, now seen corresponding path program 1 times [2025-01-09 14:52:46,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:46,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630699842] [2025-01-09 14:52:46,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:46,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:47,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-01-09 14:52:48,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-01-09 14:52:48,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:48,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:52:48,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [23698958] [2025-01-09 14:52:48,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:48,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:52:48,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:48,702 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-01-09 14:52:48,704 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-01-09 14:52:48,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-01-09 14:52:49,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-01-09 14:52:49,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:49,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:49,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 1167 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-01-09 14:52:49,388 INFO L279 TraceCheckSpWp]: Computing forward predicates...