./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-79.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-79.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 72bf3c0845cdd2bb0ceb7773d767081845ae984de3bbd8e14ca740b1ff59160d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:50:34,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:50:34,060 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:50:34,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:50:34,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:50:34,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:50:34,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:50:34,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:50:34,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:50:34,077 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:50:34,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:50:34,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:50:34,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:50:34,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:50:34,077 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:50:34,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:50:34,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:50:34,078 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:50:34,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:50:34,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:50:34,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:50:34,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:50:34,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:50:34,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:50:34,078 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:50:34,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:50:34,078 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:50:34,078 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:50:34,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:50:34,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:50:34,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:50:34,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:50:34,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:50:34,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:50:34,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:50:34,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:50:34,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:50:34,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:50:34,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:50:34,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:50:34,080 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:50:34,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:50:34,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:50:34,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:50:34,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:50:34,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:50:34,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:50:34,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:50:34,080 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 -> 72bf3c0845cdd2bb0ceb7773d767081845ae984de3bbd8e14ca740b1ff59160d [2025-01-09 14:50:34,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:50:34,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:50:34,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:50:34,320 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:50:34,320 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:50:34,321 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-79.i [2025-01-09 14:50:35,498 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67154aadd/79595a522bff4cf48990462a28a89363/FLAG1cc4029e4 [2025-01-09 14:50:35,884 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:50:35,888 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-79.i [2025-01-09 14:50:35,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67154aadd/79595a522bff4cf48990462a28a89363/FLAG1cc4029e4 [2025-01-09 14:50:35,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67154aadd/79595a522bff4cf48990462a28a89363 [2025-01-09 14:50:35,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:50:35,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:50:35,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:50:35,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:50:35,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:50:35,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:50:35" (1/1) ... [2025-01-09 14:50:35,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@faa19b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:35, skipping insertion in model container [2025-01-09 14:50:35,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:50:35" (1/1) ... [2025-01-09 14:50:35,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:50:36,046 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-79.i[916,929] [2025-01-09 14:50:36,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:50:36,209 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:50:36,218 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-79.i[916,929] [2025-01-09 14:50:36,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:50:36,336 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:50:36,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:36 WrapperNode [2025-01-09 14:50:36,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:50:36,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:50:36,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:50:36,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:50:36,346 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:50:36" (1/1) ... [2025-01-09 14:50:36,369 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:50:36" (1/1) ... [2025-01-09 14:50:36,475 INFO L138 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 751 [2025-01-09 14:50:36,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:50:36,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:50:36,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:50:36,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:50:36,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:36" (1/1) ... [2025-01-09 14:50:36,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:36" (1/1) ... [2025-01-09 14:50:36,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:36" (1/1) ... [2025-01-09 14:50:36,588 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:50:36,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:36" (1/1) ... [2025-01-09 14:50:36,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:36" (1/1) ... [2025-01-09 14:50:36,625 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:36" (1/1) ... [2025-01-09 14:50:36,633 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:36" (1/1) ... [2025-01-09 14:50:36,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:36" (1/1) ... [2025-01-09 14:50:36,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:36" (1/1) ... [2025-01-09 14:50:36,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:36" (1/1) ... [2025-01-09 14:50:36,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:50:36,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:50:36,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:50:36,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:50:36,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:36" (1/1) ... [2025-01-09 14:50:36,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:50:36,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:50:36,717 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:50:36,724 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:50:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:50:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:50:36,742 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:50:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:50:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:50:36,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:50:36,859 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:50:36,860 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:50:37,867 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2025-01-09 14:50:37,867 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:50:37,877 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:50:37,877 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:50:37,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:50:37 BoogieIcfgContainer [2025-01-09 14:50:37,878 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:50:37,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:50:37,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:50:37,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:50:37,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:50:35" (1/3) ... [2025-01-09 14:50:37,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92682e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:50:37, skipping insertion in model container [2025-01-09 14:50:37,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:36" (2/3) ... [2025-01-09 14:50:37,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92682e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:50:37, skipping insertion in model container [2025-01-09 14:50:37,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:50:37" (3/3) ... [2025-01-09 14:50:37,884 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-79.i [2025-01-09 14:50:37,892 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:50:37,894 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-79.i that has 2 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:50:37,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:50:37,979 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;@23c7b413, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:50:37,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:50:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 237 states have (on average 1.5654008438818565) internal successors, (371), 238 states have internal predecessors, (371), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 14:50:38,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-01-09 14:50:38,004 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:38,004 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:38,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:38,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:38,009 INFO L85 PathProgramCache]: Analyzing trace with hash -804487731, now seen corresponding path program 1 times [2025-01-09 14:50:38,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:38,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222117691] [2025-01-09 14:50:38,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:38,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:38,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-01-09 14:50:38,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-01-09 14:50:38,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:38,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2025-01-09 14:50:38,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:38,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222117691] [2025-01-09 14:50:38,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222117691] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:50:38,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518795386] [2025-01-09 14:50:38,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:38,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:38,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:50:38,523 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:50:38,525 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:50:38,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-01-09 14:50:38,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-01-09 14:50:38,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:38,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:38,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:50:38,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:50:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2025-01-09 14:50:38,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:50:38,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518795386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:38,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:50:38,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:50:38,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540807773] [2025-01-09 14:50:38,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:38,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:50:38,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:38,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:50:38,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:50:38,870 INFO L87 Difference]: Start difference. First operand has 302 states, 237 states have (on average 1.5654008438818565) internal successors, (371), 238 states have internal predecessors, (371), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) Second operand has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (62), 2 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 2 states have call successors, (62) [2025-01-09 14:50:38,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:38,929 INFO L93 Difference]: Finished difference Result 594 states and 1041 transitions. [2025-01-09 14:50:38,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:50:38,931 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (62), 2 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 2 states have call successors, (62) Word has length 437 [2025-01-09 14:50:38,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:38,937 INFO L225 Difference]: With dead ends: 594 [2025-01-09 14:50:38,937 INFO L226 Difference]: Without dead ends: 295 [2025-01-09 14:50:38,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:50:38,945 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:38,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:50:38,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-01-09 14:50:39,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-01-09 14:50:39,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 231 states have (on average 1.5541125541125542) internal successors, (359), 231 states have internal predecessors, (359), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 14:50:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 483 transitions. [2025-01-09 14:50:39,016 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 483 transitions. Word has length 437 [2025-01-09 14:50:39,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:39,017 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 483 transitions. [2025-01-09 14:50:39,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (62), 2 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 2 states have call successors, (62) [2025-01-09 14:50:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 483 transitions. [2025-01-09 14:50:39,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-01-09 14:50:39,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:39,027 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:39,037 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:50:39,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:50:39,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:39,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:39,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1138414631, now seen corresponding path program 1 times [2025-01-09 14:50:39,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:39,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234646316] [2025-01-09 14:50:39,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:39,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:39,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-01-09 14:50:39,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-01-09 14:50:39,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:39,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:50:39,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:39,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234646316] [2025-01-09 14:50:39,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234646316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:39,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:39,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:50:39,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735707120] [2025-01-09 14:50:39,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:39,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:50:39,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:39,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:50:39,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:50:39,716 INFO L87 Difference]: Start difference. First operand 295 states and 483 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:50:39,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:39,796 INFO L93 Difference]: Finished difference Result 768 states and 1258 transitions. [2025-01-09 14:50:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:50:39,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 437 [2025-01-09 14:50:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:39,803 INFO L225 Difference]: With dead ends: 768 [2025-01-09 14:50:39,803 INFO L226 Difference]: Without dead ends: 476 [2025-01-09 14:50:39,804 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:50:39,805 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 279 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:39,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 973 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:50:39,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-01-09 14:50:39,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 473. [2025-01-09 14:50:39,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 398 states have (on average 1.5804020100502512) internal successors, (629), 399 states have internal predecessors, (629), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 14:50:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 773 transitions. [2025-01-09 14:50:39,836 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 773 transitions. Word has length 437 [2025-01-09 14:50:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:39,837 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 773 transitions. [2025-01-09 14:50:39,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:50:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 773 transitions. [2025-01-09 14:50:39,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-01-09 14:50:39,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:39,842 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:39,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:50:39,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:39,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:39,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2014433637, now seen corresponding path program 1 times [2025-01-09 14:50:39,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:39,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687245706] [2025-01-09 14:50:39,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:39,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:39,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-01-09 14:50:39,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-01-09 14:50:39,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:39,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:50:40,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:40,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687245706] [2025-01-09 14:50:40,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687245706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:40,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:40,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:50:40,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928859757] [2025-01-09 14:50:40,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:40,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:50:40,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:40,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:50:40,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:50:40,319 INFO L87 Difference]: Start difference. First operand 473 states and 773 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:50:40,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:40,734 INFO L93 Difference]: Finished difference Result 1712 states and 2793 transitions. [2025-01-09 14:50:40,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:50:40,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 437 [2025-01-09 14:50:40,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:40,750 INFO L225 Difference]: With dead ends: 1712 [2025-01-09 14:50:40,751 INFO L226 Difference]: Without dead ends: 1242 [2025-01-09 14:50:40,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:50:40,752 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 683 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:40,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 1659 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:50:40,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2025-01-09 14:50:40,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1236. [2025-01-09 14:50:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1073 states have (on average 1.549860205032619) internal successors, (1663), 1077 states have internal predecessors, (1663), 156 states have call successors, (156), 6 states have call predecessors, (156), 6 states have return successors, (156), 152 states have call predecessors, (156), 156 states have call successors, (156) [2025-01-09 14:50:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1975 transitions. [2025-01-09 14:50:40,838 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1975 transitions. Word has length 437 [2025-01-09 14:50:40,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:40,839 INFO L471 AbstractCegarLoop]: Abstraction has 1236 states and 1975 transitions. [2025-01-09 14:50:40,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:50:40,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1975 transitions. [2025-01-09 14:50:40,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-01-09 14:50:40,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:40,844 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:40,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:50:40,845 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:40,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1456317341, now seen corresponding path program 1 times [2025-01-09 14:50:40,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:40,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563342268] [2025-01-09 14:50:40,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:40,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:40,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-01-09 14:50:40,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-01-09 14:50:40,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:40,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:50:41,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:41,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563342268] [2025-01-09 14:50:41,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563342268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:41,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:41,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:50:41,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792960001] [2025-01-09 14:50:41,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:41,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:50:41,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:41,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:50:41,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:50:41,141 INFO L87 Difference]: Start difference. First operand 1236 states and 1975 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:50:41,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:41,225 INFO L93 Difference]: Finished difference Result 3113 states and 4974 transitions. [2025-01-09 14:50:41,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:50:41,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 437 [2025-01-09 14:50:41,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:41,233 INFO L225 Difference]: With dead ends: 3113 [2025-01-09 14:50:41,234 INFO L226 Difference]: Without dead ends: 1880 [2025-01-09 14:50:41,236 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:50:41,237 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 254 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:41,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 963 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:50:41,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2025-01-09 14:50:41,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1600. [2025-01-09 14:50:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1423 states have (on average 1.566408995080815) internal successors, (2229), 1429 states have internal predecessors, (2229), 168 states have call successors, (168), 8 states have call predecessors, (168), 8 states have return successors, (168), 162 states have call predecessors, (168), 168 states have call successors, (168) [2025-01-09 14:50:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2565 transitions. [2025-01-09 14:50:41,316 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2565 transitions. Word has length 437 [2025-01-09 14:50:41,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:41,317 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2565 transitions. [2025-01-09 14:50:41,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:50:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2565 transitions. [2025-01-09 14:50:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-01-09 14:50:41,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:41,326 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:41,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:50:41,326 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:41,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:41,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2048038095, now seen corresponding path program 1 times [2025-01-09 14:50:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:41,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326365208] [2025-01-09 14:50:41,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:41,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:41,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-09 14:50:41,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-09 14:50:41,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:41,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:50:41,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:41,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326365208] [2025-01-09 14:50:41,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326365208] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:41,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:41,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:50:41,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752590000] [2025-01-09 14:50:41,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:41,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:50:41,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:41,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:50:41,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:50:41,588 INFO L87 Difference]: Start difference. First operand 1600 states and 2565 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:50:41,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:41,688 INFO L93 Difference]: Finished difference Result 3334 states and 5353 transitions. [2025-01-09 14:50:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:50:41,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 438 [2025-01-09 14:50:41,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:41,698 INFO L225 Difference]: With dead ends: 3334 [2025-01-09 14:50:41,698 INFO L226 Difference]: Without dead ends: 1737 [2025-01-09 14:50:41,701 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:50:41,703 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 425 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:41,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 874 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:50:41,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2025-01-09 14:50:41,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1568. [2025-01-09 14:50:41,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1391 states have (on average 1.5039539899352983) internal successors, (2092), 1397 states have internal predecessors, (2092), 168 states have call successors, (168), 8 states have call predecessors, (168), 8 states have return successors, (168), 162 states have call predecessors, (168), 168 states have call successors, (168) [2025-01-09 14:50:41,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2428 transitions. [2025-01-09 14:50:41,796 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2428 transitions. Word has length 438 [2025-01-09 14:50:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:41,796 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2428 transitions. [2025-01-09 14:50:41,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:50:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2428 transitions. [2025-01-09 14:50:41,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-01-09 14:50:41,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:41,802 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:41,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:50:41,802 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:41,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:41,803 INFO L85 PathProgramCache]: Analyzing trace with hash -551720901, now seen corresponding path program 1 times [2025-01-09 14:50:41,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:41,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076555911] [2025-01-09 14:50:41,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:41,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:41,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-01-09 14:50:41,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-01-09 14:50:41,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:41,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:50:42,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:42,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076555911] [2025-01-09 14:50:42,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076555911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:42,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:42,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:50:42,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226925092] [2025-01-09 14:50:42,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:42,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:50:42,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:42,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:50:42,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:50:42,417 INFO L87 Difference]: Start difference. First operand 1568 states and 2428 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:50:42,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:42,845 INFO L93 Difference]: Finished difference Result 3158 states and 4897 transitions. [2025-01-09 14:50:42,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:50:42,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 439 [2025-01-09 14:50:42,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:42,854 INFO L225 Difference]: With dead ends: 3158 [2025-01-09 14:50:42,854 INFO L226 Difference]: Without dead ends: 1593 [2025-01-09 14:50:42,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:50:42,858 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 550 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:42,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 2100 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:50:42,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2025-01-09 14:50:42,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1530. [2025-01-09 14:50:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1353 states have (on average 1.4722838137472283) internal successors, (1992), 1359 states have internal predecessors, (1992), 168 states have call successors, (168), 8 states have call predecessors, (168), 8 states have return successors, (168), 162 states have call predecessors, (168), 168 states have call successors, (168) [2025-01-09 14:50:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 2328 transitions. [2025-01-09 14:50:42,943 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 2328 transitions. Word has length 439 [2025-01-09 14:50:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:42,944 INFO L471 AbstractCegarLoop]: Abstraction has 1530 states and 2328 transitions. [2025-01-09 14:50:42,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:50:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 2328 transitions. [2025-01-09 14:50:42,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-01-09 14:50:42,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:42,950 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:42,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:50:42,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:42,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:42,951 INFO L85 PathProgramCache]: Analyzing trace with hash 475771487, now seen corresponding path program 1 times [2025-01-09 14:50:42,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:42,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737437769] [2025-01-09 14:50:42,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:42,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:42,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-01-09 14:50:43,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-01-09 14:50:43,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:43,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:50:44,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:44,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737437769] [2025-01-09 14:50:44,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737437769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:44,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:44,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:50:44,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258006078] [2025-01-09 14:50:44,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:44,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:50:44,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:44,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:50:44,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:50:44,093 INFO L87 Difference]: Start difference. First operand 1530 states and 2328 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:50:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:44,500 INFO L93 Difference]: Finished difference Result 4378 states and 6672 transitions. [2025-01-09 14:50:44,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:50:44,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 440 [2025-01-09 14:50:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:44,512 INFO L225 Difference]: With dead ends: 4378 [2025-01-09 14:50:44,512 INFO L226 Difference]: Without dead ends: 2851 [2025-01-09 14:50:44,514 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:50:44,516 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 376 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:44,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1324 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:50:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2025-01-09 14:50:44,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2745. [2025-01-09 14:50:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2745 states, 2505 states have (on average 1.4994011976047905) internal successors, (3756), 2511 states have internal predecessors, (3756), 230 states have call successors, (230), 9 states have call predecessors, (230), 9 states have return successors, (230), 224 states have call predecessors, (230), 230 states have call successors, (230) [2025-01-09 14:50:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2745 states and 4216 transitions. [2025-01-09 14:50:44,630 INFO L78 Accepts]: Start accepts. Automaton has 2745 states and 4216 transitions. Word has length 440 [2025-01-09 14:50:44,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:44,630 INFO L471 AbstractCegarLoop]: Abstraction has 2745 states and 4216 transitions. [2025-01-09 14:50:44,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:50:44,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 4216 transitions. [2025-01-09 14:50:44,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-09 14:50:44,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:44,634 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:44,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:50:44,634 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:44,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash 793703941, now seen corresponding path program 1 times [2025-01-09 14:50:44,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:44,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389544347] [2025-01-09 14:50:44,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:44,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:44,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 14:50:45,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 14:50:45,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:45,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:50:45,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:45,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389544347] [2025-01-09 14:50:45,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389544347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:45,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:45,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:50:45,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285511408] [2025-01-09 14:50:45,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:45,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:50:45,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:45,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:50:45,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:50:45,426 INFO L87 Difference]: Start difference. First operand 2745 states and 4216 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:50:45,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:45,726 INFO L93 Difference]: Finished difference Result 5458 states and 8334 transitions. [2025-01-09 14:50:45,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:50:45,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 441 [2025-01-09 14:50:45,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:45,740 INFO L225 Difference]: With dead ends: 5458 [2025-01-09 14:50:45,741 INFO L226 Difference]: Without dead ends: 2851 [2025-01-09 14:50:45,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:50:45,745 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 375 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:45,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1813 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:50:45,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2025-01-09 14:50:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2745. [2025-01-09 14:50:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2745 states, 2505 states have (on average 1.493812375249501) internal successors, (3742), 2511 states have internal predecessors, (3742), 230 states have call successors, (230), 9 states have call predecessors, (230), 9 states have return successors, (230), 224 states have call predecessors, (230), 230 states have call successors, (230) [2025-01-09 14:50:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2745 states and 4202 transitions. [2025-01-09 14:50:45,902 INFO L78 Accepts]: Start accepts. Automaton has 2745 states and 4202 transitions. Word has length 441 [2025-01-09 14:50:45,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:45,902 INFO L471 AbstractCegarLoop]: Abstraction has 2745 states and 4202 transitions. [2025-01-09 14:50:45,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:50:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 4202 transitions. [2025-01-09 14:50:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-01-09 14:50:45,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:45,908 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:45,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:50:45,908 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:45,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash -70391656, now seen corresponding path program 1 times [2025-01-09 14:50:45,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:45,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324095334] [2025-01-09 14:50:45,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:45,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:45,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-01-09 14:50:47,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-01-09 14:50:47,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:47,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 27 proven. 156 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-01-09 14:50:48,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:48,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324095334] [2025-01-09 14:50:48,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324095334] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:50:48,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774444212] [2025-01-09 14:50:48,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:48,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:48,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:50:48,370 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:50:48,371 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:50:48,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-01-09 14:50:48,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-01-09 14:50:48,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:48,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:48,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 14:50:48,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:50:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 2973 proven. 135 refuted. 0 times theorem prover too weak. 4456 trivial. 0 not checked. [2025-01-09 14:50:49,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:50:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 48 proven. 135 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-01-09 14:50:50,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774444212] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:50:50,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:50:50,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 17 [2025-01-09 14:50:50,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710322510] [2025-01-09 14:50:50,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:50:50,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:50:50,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:50,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:50:50,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:50:50,440 INFO L87 Difference]: Start difference. First operand 2745 states and 4202 transitions. Second operand has 17 states, 17 states have (on average 16.235294117647058) internal successors, (276), 17 states have internal predecessors, (276), 6 states have call successors, (186), 3 states have call predecessors, (186), 6 states have return successors, (186), 6 states have call predecessors, (186), 6 states have call successors, (186) [2025-01-09 14:50:52,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:52,105 INFO L93 Difference]: Finished difference Result 7759 states and 11743 transitions. [2025-01-09 14:50:52,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 14:50:52,106 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 16.235294117647058) internal successors, (276), 17 states have internal predecessors, (276), 6 states have call successors, (186), 3 states have call predecessors, (186), 6 states have return successors, (186), 6 states have call predecessors, (186), 6 states have call successors, (186) Word has length 443 [2025-01-09 14:50:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:52,127 INFO L225 Difference]: With dead ends: 7759 [2025-01-09 14:50:52,128 INFO L226 Difference]: Without dead ends: 5130 [2025-01-09 14:50:52,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 877 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=304, Invalid=956, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 14:50:52,134 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 2443 mSDsluCounter, 3165 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2453 SdHoareTripleChecker+Valid, 3543 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 1718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:52,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2453 Valid, 3543 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 1718 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:50:52,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5130 states. [2025-01-09 14:50:52,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5130 to 4538. [2025-01-09 14:50:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4538 states, 4122 states have (on average 1.4696749150897623) internal successors, (6058), 4134 states have internal predecessors, (6058), 390 states have call successors, (390), 25 states have call predecessors, (390), 25 states have return successors, (390), 378 states have call predecessors, (390), 390 states have call successors, (390) [2025-01-09 14:50:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4538 states to 4538 states and 6838 transitions. [2025-01-09 14:50:52,364 INFO L78 Accepts]: Start accepts. Automaton has 4538 states and 6838 transitions. Word has length 443 [2025-01-09 14:50:52,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:52,365 INFO L471 AbstractCegarLoop]: Abstraction has 4538 states and 6838 transitions. [2025-01-09 14:50:52,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 16.235294117647058) internal successors, (276), 17 states have internal predecessors, (276), 6 states have call successors, (186), 3 states have call predecessors, (186), 6 states have return successors, (186), 6 states have call predecessors, (186), 6 states have call successors, (186) [2025-01-09 14:50:52,370 INFO L276 IsEmpty]: Start isEmpty. Operand 4538 states and 6838 transitions. [2025-01-09 14:50:52,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-01-09 14:50:52,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:52,374 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:52,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:50:52,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:52,575 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:52,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:52,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1584804026, now seen corresponding path program 1 times [2025-01-09 14:50:52,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:52,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54214670] [2025-01-09 14:50:52,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:52,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:52,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-01-09 14:50:53,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-01-09 14:50:53,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:53,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 33 proven. 150 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-01-09 14:50:53,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:53,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54214670] [2025-01-09 14:50:53,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54214670] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:50:53,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017681970] [2025-01-09 14:50:53,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:53,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:53,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:50:53,672 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:50:53,674 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:50:53,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-01-09 14:50:53,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-01-09 14:50:53,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:53,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:53,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 1094 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 14:50:53,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:50:54,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 2437 proven. 147 refuted. 0 times theorem prover too weak. 4980 trivial. 0 not checked. [2025-01-09 14:50:54,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:50:54,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 36 proven. 147 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-01-09 14:50:54,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017681970] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:50:54,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:50:54,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 17 [2025-01-09 14:50:54,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218794308] [2025-01-09 14:50:54,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:50:54,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:50:54,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:54,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:50:54,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:50:54,982 INFO L87 Difference]: Start difference. First operand 4538 states and 6838 transitions. Second operand has 17 states, 17 states have (on average 15.882352941176471) internal successors, (270), 17 states have internal predecessors, (270), 6 states have call successors, (186), 3 states have call predecessors, (186), 6 states have return successors, (186), 6 states have call predecessors, (186), 6 states have call successors, (186) [2025-01-09 14:50:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:56,587 INFO L93 Difference]: Finished difference Result 9097 states and 13707 transitions. [2025-01-09 14:50:56,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 14:50:56,588 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 15.882352941176471) internal successors, (270), 17 states have internal predecessors, (270), 6 states have call successors, (186), 3 states have call predecessors, (186), 6 states have return successors, (186), 6 states have call predecessors, (186), 6 states have call successors, (186) Word has length 444 [2025-01-09 14:50:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:56,604 INFO L225 Difference]: With dead ends: 9097 [2025-01-09 14:50:56,604 INFO L226 Difference]: Without dead ends: 4711 [2025-01-09 14:50:56,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 913 GetRequests, 879 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=304, Invalid=956, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 14:50:56,611 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 2441 mSDsluCounter, 3343 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2453 SdHoareTripleChecker+Valid, 3776 SdHoareTripleChecker+Invalid, 2265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:56,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2453 Valid, 3776 Invalid, 2265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 1795 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:50:56,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4711 states. [2025-01-09 14:50:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4711 to 3703. [2025-01-09 14:50:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3703 states, 3198 states have (on average 1.4434021263289556) internal successors, (4616), 3204 states have internal predecessors, (4616), 470 states have call successors, (470), 34 states have call predecessors, (470), 34 states have return successors, (470), 464 states have call predecessors, (470), 470 states have call successors, (470) [2025-01-09 14:50:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3703 states to 3703 states and 5556 transitions. [2025-01-09 14:50:56,789 INFO L78 Accepts]: Start accepts. Automaton has 3703 states and 5556 transitions. Word has length 444 [2025-01-09 14:50:56,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:56,789 INFO L471 AbstractCegarLoop]: Abstraction has 3703 states and 5556 transitions. [2025-01-09 14:50:56,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.882352941176471) internal successors, (270), 17 states have internal predecessors, (270), 6 states have call successors, (186), 3 states have call predecessors, (186), 6 states have return successors, (186), 6 states have call predecessors, (186), 6 states have call successors, (186) [2025-01-09 14:50:56,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3703 states and 5556 transitions. [2025-01-09 14:50:56,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-01-09 14:50:56,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:56,793 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:56,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:50:56,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:56,997 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:56,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:56,998 INFO L85 PathProgramCache]: Analyzing trace with hash 82304119, now seen corresponding path program 1 times [2025-01-09 14:50:56,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:56,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254751588] [2025-01-09 14:50:56,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:56,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:57,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-01-09 14:50:57,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-01-09 14:50:57,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:57,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:50:57,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:57,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254751588] [2025-01-09 14:50:57,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254751588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:57,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:57,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:50:57,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916160672] [2025-01-09 14:50:57,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:57,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:50:57,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:57,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:50:57,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:50:57,955 INFO L87 Difference]: Start difference. First operand 3703 states and 5556 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:50:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:58,384 INFO L93 Difference]: Finished difference Result 6659 states and 9999 transitions. [2025-01-09 14:50:58,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:50:58,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 445 [2025-01-09 14:50:58,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:58,401 INFO L225 Difference]: With dead ends: 6659 [2025-01-09 14:50:58,401 INFO L226 Difference]: Without dead ends: 4503 [2025-01-09 14:50:58,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:50:58,404 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 870 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:58,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1657 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:50:58,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4503 states. [2025-01-09 14:50:58,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4503 to 4011. [2025-01-09 14:50:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4011 states, 3506 states have (on average 1.4560752994865944) internal successors, (5105), 3512 states have internal predecessors, (5105), 470 states have call successors, (470), 34 states have call predecessors, (470), 34 states have return successors, (470), 464 states have call predecessors, (470), 470 states have call successors, (470) [2025-01-09 14:50:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4011 states to 4011 states and 6045 transitions. [2025-01-09 14:50:58,595 INFO L78 Accepts]: Start accepts. Automaton has 4011 states and 6045 transitions. Word has length 445 [2025-01-09 14:50:58,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:58,595 INFO L471 AbstractCegarLoop]: Abstraction has 4011 states and 6045 transitions. [2025-01-09 14:50:58,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:50:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 4011 states and 6045 transitions. [2025-01-09 14:50:58,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-01-09 14:50:58,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:58,598 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:58,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:50:58,599 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:58,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:58,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1536670795, now seen corresponding path program 1 times [2025-01-09 14:50:58,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:58,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078135162] [2025-01-09 14:50:58,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:58,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:58,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-01-09 14:50:59,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-01-09 14:50:59,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:59,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 120 proven. 63 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-01-09 14:51:00,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:00,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078135162] [2025-01-09 14:51:00,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078135162] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:51:00,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695655486] [2025-01-09 14:51:00,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:00,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:51:00,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:51:00,502 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:51:00,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:51:00,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-01-09 14:51:00,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-01-09 14:51:00,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:00,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:00,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 14:51:00,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:51:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 3160 proven. 96 refuted. 0 times theorem prover too weak. 4308 trivial. 0 not checked. [2025-01-09 14:51:01,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:51:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 135 proven. 48 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-01-09 14:51:01,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695655486] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:51:01,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:51:01,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 17 [2025-01-09 14:51:01,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991093027] [2025-01-09 14:51:01,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:51:01,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:51:01,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:01,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:51:01,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:51:01,770 INFO L87 Difference]: Start difference. First operand 4011 states and 6045 transitions. Second operand has 17 states, 16 states have (on average 18.0625) internal successors, (289), 16 states have internal predecessors, (289), 7 states have call successors, (141), 3 states have call predecessors, (141), 5 states have return successors, (142), 6 states have call predecessors, (142), 7 states have call successors, (142) [2025-01-09 14:51:03,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:03,679 INFO L93 Difference]: Finished difference Result 11845 states and 17701 transitions. [2025-01-09 14:51:03,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 14:51:03,679 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 18.0625) internal successors, (289), 16 states have internal predecessors, (289), 7 states have call successors, (141), 3 states have call predecessors, (141), 5 states have return successors, (142), 6 states have call predecessors, (142), 7 states have call successors, (142) Word has length 445 [2025-01-09 14:51:03,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:03,697 INFO L225 Difference]: With dead ends: 11845 [2025-01-09 14:51:03,697 INFO L226 Difference]: Without dead ends: 8059 [2025-01-09 14:51:03,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 885 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 14:51:03,703 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 1694 mSDsluCounter, 2865 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 601 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 601 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:03,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 3483 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [601 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:51:03,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8059 states. [2025-01-09 14:51:04,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8059 to 7955. [2025-01-09 14:51:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7955 states, 6973 states have (on average 1.4439982790764376) internal successors, (10069), 6985 states have internal predecessors, (10069), 878 states have call successors, (878), 103 states have call predecessors, (878), 103 states have return successors, (878), 866 states have call predecessors, (878), 878 states have call successors, (878) [2025-01-09 14:51:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7955 states to 7955 states and 11825 transitions. [2025-01-09 14:51:04,067 INFO L78 Accepts]: Start accepts. Automaton has 7955 states and 11825 transitions. Word has length 445 [2025-01-09 14:51:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:04,067 INFO L471 AbstractCegarLoop]: Abstraction has 7955 states and 11825 transitions. [2025-01-09 14:51:04,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 18.0625) internal successors, (289), 16 states have internal predecessors, (289), 7 states have call successors, (141), 3 states have call predecessors, (141), 5 states have return successors, (142), 6 states have call predecessors, (142), 7 states have call successors, (142) [2025-01-09 14:51:04,068 INFO L276 IsEmpty]: Start isEmpty. Operand 7955 states and 11825 transitions. [2025-01-09 14:51:04,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-01-09 14:51:04,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:04,071 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:04,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 14:51:04,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 14:51:04,276 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:04,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:04,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1968277716, now seen corresponding path program 1 times [2025-01-09 14:51:04,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:04,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110766332] [2025-01-09 14:51:04,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:04,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:04,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-01-09 14:51:04,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-01-09 14:51:04,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:04,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:05,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 120 proven. 63 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-01-09 14:51:05,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:05,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110766332] [2025-01-09 14:51:05,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110766332] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:51:05,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994703918] [2025-01-09 14:51:05,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:05,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:51:05,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:51:05,831 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:51:05,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:51:05,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-01-09 14:51:06,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-01-09 14:51:06,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:06,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:06,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 14:51:06,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:51:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 3469 proven. 351 refuted. 0 times theorem prover too weak. 3744 trivial. 0 not checked. [2025-01-09 14:51:07,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:51:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 180 proven. 360 refuted. 0 times theorem prover too weak. 7024 trivial. 0 not checked. [2025-01-09 14:51:08,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994703918] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:51:08,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:51:08,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31 [2025-01-09 14:51:08,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981259020] [2025-01-09 14:51:08,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:51:08,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 14:51:08,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:08,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 14:51:08,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2025-01-09 14:51:08,308 INFO L87 Difference]: Start difference. First operand 7955 states and 11825 transitions. Second operand has 31 states, 29 states have (on average 11.586206896551724) internal successors, (336), 29 states have internal predecessors, (336), 11 states have call successors, (165), 4 states have call predecessors, (165), 8 states have return successors, (166), 10 states have call predecessors, (166), 11 states have call successors, (166) [2025-01-09 14:51:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:15,230 INFO L93 Difference]: Finished difference Result 24698 states and 36232 transitions. [2025-01-09 14:51:15,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2025-01-09 14:51:15,231 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 11.586206896551724) internal successors, (336), 29 states have internal predecessors, (336), 11 states have call successors, (165), 4 states have call predecessors, (165), 8 states have return successors, (166), 10 states have call predecessors, (166), 11 states have call successors, (166) Word has length 446 [2025-01-09 14:51:15,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:15,270 INFO L225 Difference]: With dead ends: 24698 [2025-01-09 14:51:15,270 INFO L226 Difference]: Without dead ends: 17216 [2025-01-09 14:51:15,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1043 GetRequests, 896 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8313 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4640, Invalid=17412, Unknown=0, NotChecked=0, Total=22052 [2025-01-09 14:51:15,288 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 11475 mSDsluCounter, 2842 mSDsCounter, 0 mSdLazyCounter, 2248 mSolverCounterSat, 2587 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11475 SdHoareTripleChecker+Valid, 3220 SdHoareTripleChecker+Invalid, 4835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2587 IncrementalHoareTripleChecker+Valid, 2248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:15,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11475 Valid, 3220 Invalid, 4835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2587 Valid, 2248 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 14:51:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17216 states. [2025-01-09 14:51:15,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17216 to 13305. [2025-01-09 14:51:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13305 states, 12022 states have (on average 1.4352021294293795) internal successors, (17254), 12054 states have internal predecessors, (17254), 1082 states have call successors, (1082), 200 states have call predecessors, (1082), 200 states have return successors, (1082), 1050 states have call predecessors, (1082), 1082 states have call successors, (1082) [2025-01-09 14:51:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13305 states to 13305 states and 19418 transitions. [2025-01-09 14:51:16,015 INFO L78 Accepts]: Start accepts. Automaton has 13305 states and 19418 transitions. Word has length 446 [2025-01-09 14:51:16,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:16,015 INFO L471 AbstractCegarLoop]: Abstraction has 13305 states and 19418 transitions. [2025-01-09 14:51:16,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 11.586206896551724) internal successors, (336), 29 states have internal predecessors, (336), 11 states have call successors, (165), 4 states have call predecessors, (165), 8 states have return successors, (166), 10 states have call predecessors, (166), 11 states have call successors, (166) [2025-01-09 14:51:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 13305 states and 19418 transitions. [2025-01-09 14:51:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-01-09 14:51:16,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:16,020 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:16,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 14:51:16,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 14:51:16,221 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:16,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:16,222 INFO L85 PathProgramCache]: Analyzing trace with hash -139196982, now seen corresponding path program 1 times [2025-01-09 14:51:16,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:16,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309343819] [2025-01-09 14:51:16,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:16,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:16,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-01-09 14:51:17,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-01-09 14:51:17,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:17,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat