./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.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 4530217ca1f20f3cb75b415cf917b29c2da92488d9a0626f4e89358462ce0871 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:02:56,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:02:56,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:02:56,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:02:56,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:02:57,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:02:57,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:02:57,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:02:57,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:02:57,004 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:02:57,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:02:57,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:02:57,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:02:57,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:02:57,005 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:02:57,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:02:57,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:02:57,005 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:02:57,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:02:57,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:02:57,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:02:57,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:02:57,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:02:57,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:02:57,006 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:02:57,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:02:57,006 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:02:57,007 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:02:57,007 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:02:57,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:02:57,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:02:57,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:02:57,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:02:57,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:02:57,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:02:57,008 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:02:57,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:02:57,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:02:57,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:02:57,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:02:57,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:02:57,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:02:57,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:02:57,008 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 -> 4530217ca1f20f3cb75b415cf917b29c2da92488d9a0626f4e89358462ce0871 [2025-02-06 02:02:57,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:02:57,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:02:57,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:02:57,262 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:02:57,262 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:02:57,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i [2025-02-06 02:02:58,643 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/983212ee0/788da8b0072d48119f9944fe5b67af5f/FLAG35a33f45b [2025-02-06 02:02:58,962 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:02:58,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i [2025-02-06 02:02:58,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/983212ee0/788da8b0072d48119f9944fe5b67af5f/FLAG35a33f45b [2025-02-06 02:02:59,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/983212ee0/788da8b0072d48119f9944fe5b67af5f [2025-02-06 02:02:59,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:02:59,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:02:59,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:02:59,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:02:59,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:02:59,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:02:59" (1/1) ... [2025-02-06 02:02:59,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@708b35f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:02:59, skipping insertion in model container [2025-02-06 02:02:59,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:02:59" (1/1) ... [2025-02-06 02:02:59,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:02:59,383 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_amount100_file-61.i[916,929] [2025-02-06 02:02:59,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:02:59,524 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:02:59,537 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_amount100_file-61.i[916,929] [2025-02-06 02:02:59,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:02:59,618 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:02:59,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:02:59 WrapperNode [2025-02-06 02:02:59,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:02:59,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:02:59,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:02:59,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:02:59,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:02:59" (1/1) ... [2025-02-06 02:02:59,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:02:59" (1/1) ... [2025-02-06 02:02:59,714 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2025-02-06 02:02:59,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:02:59,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:02:59,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:02:59,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:02:59,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:02:59" (1/1) ... [2025-02-06 02:02:59,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:02:59" (1/1) ... [2025-02-06 02:02:59,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:02:59" (1/1) ... [2025-02-06 02:02:59,760 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-02-06 02:02:59,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:02:59" (1/1) ... [2025-02-06 02:02:59,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:02:59" (1/1) ... [2025-02-06 02:02:59,771 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:02:59" (1/1) ... [2025-02-06 02:02:59,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:02:59" (1/1) ... [2025-02-06 02:02:59,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:02:59" (1/1) ... [2025-02-06 02:02:59,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:02:59" (1/1) ... [2025-02-06 02:02:59,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:02:59,786 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:02:59,786 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:02:59,786 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:02:59,787 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:02:59" (1/1) ... [2025-02-06 02:02:59,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:02:59,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:02:59,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:02:59,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:02:59,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:02:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:02:59,846 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:02:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:02:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:02:59,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:02:59,925 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:02:59,927 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:03:00,421 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L197: havoc property_#t~bitwise20#1;havoc property_#t~short21#1;havoc property_#t~ite23#1;havoc property_#t~bitwise22#1;havoc property_#t~short24#1; [2025-02-06 02:03:00,462 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-02-06 02:03:00,462 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:03:00,502 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:03:00,504 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:03:00,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:03:00 BoogieIcfgContainer [2025-02-06 02:03:00,505 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:03:00,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:03:00,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:03:00,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:03:00,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:02:59" (1/3) ... [2025-02-06 02:03:00,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3abb12a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:03:00, skipping insertion in model container [2025-02-06 02:03:00,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:02:59" (2/3) ... [2025-02-06 02:03:00,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3abb12a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:03:00, skipping insertion in model container [2025-02-06 02:03:00,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:03:00" (3/3) ... [2025-02-06 02:03:00,514 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-61.i [2025-02-06 02:03:00,527 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:03:00,529 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-61.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:03:00,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:03:00,604 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;@36b67418, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:03:00,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:03:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 77 states have internal predecessors, (112), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 02:03:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 02:03:00,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:03:00,624 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:03:00,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:03:00,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:03:00,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1838748449, now seen corresponding path program 1 times [2025-02-06 02:03:00,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:03:00,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649333919] [2025-02-06 02:03:00,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:03:00,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:03:00,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 02:03:00,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 02:03:00,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:03:00,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:03:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-06 02:03:01,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:03:01,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649333919] [2025-02-06 02:03:01,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649333919] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:03:01,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976167018] [2025-02-06 02:03:01,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:03:01,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:03:01,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:03:01,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:03:01,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:03:01,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 02:03:01,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 02:03:01,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:03:01,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:03:01,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:03:01,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:03:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-06 02:03:01,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:03:01,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976167018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:03:01,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:03:01,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:03:01,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780169528] [2025-02-06 02:03:01,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:03:01,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:03:01,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:03:01,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:03:01,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:03:01,344 INFO L87 Difference]: Start difference. First operand has 105 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 77 states have internal predecessors, (112), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 02:03:01,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:03:01,380 INFO L93 Difference]: Finished difference Result 204 states and 349 transitions. [2025-02-06 02:03:01,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:03:01,382 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 175 [2025-02-06 02:03:01,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:03:01,389 INFO L225 Difference]: With dead ends: 204 [2025-02-06 02:03:01,390 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 02:03:01,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 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-02-06 02:03:01,399 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:03:01,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:03:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 02:03:01,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-02-06 02:03:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.445945945945946) internal successors, (107), 74 states have internal predecessors, (107), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 02:03:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 159 transitions. [2025-02-06 02:03:01,446 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 159 transitions. Word has length 175 [2025-02-06 02:03:01,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:03:01,447 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 159 transitions. [2025-02-06 02:03:01,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 02:03:01,448 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 159 transitions. [2025-02-06 02:03:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 02:03:01,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:03:01,451 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:03:01,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:03:01,651 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-02-06 02:03:01,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:03:01,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:03:01,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1682742147, now seen corresponding path program 1 times [2025-02-06 02:03:01,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:03:01,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126283056] [2025-02-06 02:03:01,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:03:01,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:03:01,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 02:03:02,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 02:03:02,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:03:02,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:03:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 02:03:08,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:03:08,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126283056] [2025-02-06 02:03:08,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126283056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:03:08,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:03:08,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:03:08,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049877680] [2025-02-06 02:03:08,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:03:08,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:03:08,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:03:08,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:03:08,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:03:08,071 INFO L87 Difference]: Start difference. First operand 102 states and 159 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 02:03:10,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:03:10,398 INFO L93 Difference]: Finished difference Result 473 states and 739 transitions. [2025-02-06 02:03:10,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:03:10,398 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-02-06 02:03:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:03:10,406 INFO L225 Difference]: With dead ends: 473 [2025-02-06 02:03:10,407 INFO L226 Difference]: Without dead ends: 374 [2025-02-06 02:03:10,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:03:10,411 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 903 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:03:10,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 680 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 02:03:10,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-02-06 02:03:10,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 169. [2025-02-06 02:03:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 114 states have internal predecessors, (163), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 02:03:10,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 267 transitions. [2025-02-06 02:03:10,459 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 267 transitions. Word has length 175 [2025-02-06 02:03:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:03:10,461 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 267 transitions. [2025-02-06 02:03:10,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 02:03:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 267 transitions. [2025-02-06 02:03:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 02:03:10,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:03:10,466 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:03:10,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:03:10,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:03:10,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:03:10,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2101690972, now seen corresponding path program 1 times [2025-02-06 02:03:10,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:03:10,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299788180] [2025-02-06 02:03:10,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:03:10,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:03:10,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 02:03:10,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 02:03:10,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:03:10,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:03:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 02:03:10,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:03:10,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299788180] [2025-02-06 02:03:10,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299788180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:03:10,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:03:10,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:03:10,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283557957] [2025-02-06 02:03:10,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:03:10,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:03:10,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:03:10,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:03:10,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:03:10,750 INFO L87 Difference]: Start difference. First operand 169 states and 267 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 02:03:10,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:03:10,821 INFO L93 Difference]: Finished difference Result 276 states and 429 transitions. [2025-02-06 02:03:10,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:03:10,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-02-06 02:03:10,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:03:10,824 INFO L225 Difference]: With dead ends: 276 [2025-02-06 02:03:10,824 INFO L226 Difference]: Without dead ends: 177 [2025-02-06 02:03:10,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:03:10,826 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 94 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:03:10,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 177 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:03:10,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-02-06 02:03:10,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-02-06 02:03:10,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 120 states have internal predecessors, (167), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 02:03:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 271 transitions. [2025-02-06 02:03:10,856 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 271 transitions. Word has length 175 [2025-02-06 02:03:10,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:03:10,858 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 271 transitions. [2025-02-06 02:03:10,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 02:03:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 271 transitions. [2025-02-06 02:03:10,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-06 02:03:10,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:03:10,863 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:03:10,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:03:10,864 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:03:10,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:03:10,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1989498030, now seen corresponding path program 1 times [2025-02-06 02:03:10,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:03:10,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507288891] [2025-02-06 02:03:10,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:03:10,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:03:10,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-06 02:03:10,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-06 02:03:10,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:03:10,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:03:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 02:03:12,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:03:12,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507288891] [2025-02-06 02:03:12,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507288891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:03:12,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:03:12,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:03:12,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23415459] [2025-02-06 02:03:12,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:03:12,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:03:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:03:12,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:03:12,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:03:12,864 INFO L87 Difference]: Start difference. First operand 177 states and 271 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 02:03:13,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:03:13,995 INFO L93 Difference]: Finished difference Result 466 states and 715 transitions. [2025-02-06 02:03:13,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:03:13,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-02-06 02:03:13,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:03:13,999 INFO L225 Difference]: With dead ends: 466 [2025-02-06 02:03:13,999 INFO L226 Difference]: Without dead ends: 363 [2025-02-06 02:03:13,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:03:14,000 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 720 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:03:14,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 543 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:03:14,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-06 02:03:14,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 196. [2025-02-06 02:03:14,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 139 states have (on average 1.4316546762589928) internal successors, (199), 139 states have internal predecessors, (199), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 02:03:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 303 transitions. [2025-02-06 02:03:14,030 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 303 transitions. Word has length 176 [2025-02-06 02:03:14,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:03:14,033 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 303 transitions. [2025-02-06 02:03:14,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 02:03:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 303 transitions. [2025-02-06 02:03:14,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-06 02:03:14,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:03:14,036 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:03:14,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:03:14,038 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:03:14,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:03:14,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2012066259, now seen corresponding path program 1 times [2025-02-06 02:03:14,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:03:14,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80764521] [2025-02-06 02:03:14,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:03:14,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:03:14,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-06 02:03:14,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-06 02:03:14,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:03:14,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:03:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 02:03:15,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:03:15,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80764521] [2025-02-06 02:03:15,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80764521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:03:15,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:03:15,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:03:15,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862035979] [2025-02-06 02:03:15,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:03:15,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:03:15,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:03:15,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:03:15,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:03:15,656 INFO L87 Difference]: Start difference. First operand 196 states and 303 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 02:03:17,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:03:17,218 INFO L93 Difference]: Finished difference Result 478 states and 727 transitions. [2025-02-06 02:03:17,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 02:03:17,219 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-02-06 02:03:17,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:03:17,224 INFO L225 Difference]: With dead ends: 478 [2025-02-06 02:03:17,224 INFO L226 Difference]: Without dead ends: 375 [2025-02-06 02:03:17,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2025-02-06 02:03:17,226 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 771 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:03:17,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 726 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:03:17,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-02-06 02:03:17,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 225. [2025-02-06 02:03:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 168 states have (on average 1.4642857142857142) internal successors, (246), 168 states have internal predecessors, (246), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 02:03:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 350 transitions. [2025-02-06 02:03:17,255 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 350 transitions. Word has length 176 [2025-02-06 02:03:17,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:03:17,257 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 350 transitions. [2025-02-06 02:03:17,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 02:03:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 350 transitions. [2025-02-06 02:03:17,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-06 02:03:17,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:03:17,259 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:03:17,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:03:17,259 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:03:17,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:03:17,264 INFO L85 PathProgramCache]: Analyzing trace with hash -216171215, now seen corresponding path program 1 times [2025-02-06 02:03:17,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:03:17,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452283609] [2025-02-06 02:03:17,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:03:17,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:03:17,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-06 02:03:17,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-06 02:03:17,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:03:17,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:03:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 02:03:17,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:03:17,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452283609] [2025-02-06 02:03:17,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452283609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:03:17,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:03:17,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:03:17,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141379456] [2025-02-06 02:03:17,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:03:17,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:03:17,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:03:17,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:03:17,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:03:17,583 INFO L87 Difference]: Start difference. First operand 225 states and 350 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 02:03:17,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:03:17,765 INFO L93 Difference]: Finished difference Result 358 states and 557 transitions. [2025-02-06 02:03:17,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:03:17,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2025-02-06 02:03:17,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:03:17,769 INFO L225 Difference]: With dead ends: 358 [2025-02-06 02:03:17,769 INFO L226 Difference]: Without dead ends: 221 [2025-02-06 02:03:17,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:03:17,770 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 131 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:03:17,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 308 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:03:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-02-06 02:03:17,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2025-02-06 02:03:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 164 states have (on average 1.4451219512195121) internal successors, (237), 164 states have internal predecessors, (237), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 02:03:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 341 transitions. [2025-02-06 02:03:17,789 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 341 transitions. Word has length 178 [2025-02-06 02:03:17,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:03:17,789 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 341 transitions. [2025-02-06 02:03:17,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 02:03:17,790 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 341 transitions. [2025-02-06 02:03:17,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 02:03:17,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:03:17,791 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:03:17,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:03:17,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:03:17,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:03:17,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2144123014, now seen corresponding path program 1 times [2025-02-06 02:03:17,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:03:17,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301864127] [2025-02-06 02:03:17,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:03:17,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:03:17,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 02:03:17,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 02:03:17,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:03:17,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:03:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-02-06 02:03:18,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:03:18,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301864127] [2025-02-06 02:03:18,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301864127] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:03:18,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442005376] [2025-02-06 02:03:18,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:03:18,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:03:18,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:03:18,081 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:03:18,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:03:18,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 02:03:18,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 02:03:18,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:03:18,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:03:18,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:03:18,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:03:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-02-06 02:03:18,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:03:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-02-06 02:03:18,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442005376] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:03:18,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:03:18,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-02-06 02:03:18,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659624568] [2025-02-06 02:03:18,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:03:18,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:03:18,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:03:18,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:03:18,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:03:18,902 INFO L87 Difference]: Start difference. First operand 221 states and 341 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 3 states have call successors, (77) [2025-02-06 02:03:19,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:03:19,128 INFO L93 Difference]: Finished difference Result 348 states and 522 transitions. [2025-02-06 02:03:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:03:19,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 3 states have call successors, (77) Word has length 180 [2025-02-06 02:03:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:03:19,131 INFO L225 Difference]: With dead ends: 348 [2025-02-06 02:03:19,131 INFO L226 Difference]: Without dead ends: 226 [2025-02-06 02:03:19,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:03:19,132 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 67 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:03:19,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 280 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:03:19,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-02-06 02:03:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2025-02-06 02:03:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 159 states have (on average 1.389937106918239) internal successors, (221), 159 states have internal predecessors, (221), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 02:03:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 325 transitions. [2025-02-06 02:03:19,154 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 325 transitions. Word has length 180 [2025-02-06 02:03:19,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:03:19,155 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 325 transitions. [2025-02-06 02:03:19,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 3 states have call successors, (77) [2025-02-06 02:03:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 325 transitions. [2025-02-06 02:03:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 02:03:19,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:03:19,157 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:03:19,166 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-02-06 02:03:19,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:03:19,358 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:03:19,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:03:19,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1799865630, now seen corresponding path program 1 times [2025-02-06 02:03:19,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:03:19,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023972959] [2025-02-06 02:03:19,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:03:19,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:03:19,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 02:03:19,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 02:03:19,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:03:19,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:03:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 02:03:19,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:03:19,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023972959] [2025-02-06 02:03:19,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023972959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:03:19,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:03:19,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:03:19,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903624507] [2025-02-06 02:03:19,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:03:19,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:03:19,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:03:19,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:03:19,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:03:19,624 INFO L87 Difference]: Start difference. First operand 218 states and 325 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 02:03:19,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:03:19,892 INFO L93 Difference]: Finished difference Result 493 states and 723 transitions. [2025-02-06 02:03:19,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:03:19,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 180 [2025-02-06 02:03:19,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:03:19,895 INFO L225 Difference]: With dead ends: 493 [2025-02-06 02:03:19,895 INFO L226 Difference]: Without dead ends: 332 [2025-02-06 02:03:19,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:03:19,896 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 144 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:03:19,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 764 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:03:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-02-06 02:03:19,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 266. [2025-02-06 02:03:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 207 states have internal predecessors, (292), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 02:03:19,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 396 transitions. [2025-02-06 02:03:19,924 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 396 transitions. Word has length 180 [2025-02-06 02:03:19,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:03:19,925 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 396 transitions. [2025-02-06 02:03:19,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 02:03:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 396 transitions. [2025-02-06 02:03:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 02:03:19,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:03:19,928 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:03:19,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:03:19,929 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:03:19,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:03:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash -458960851, now seen corresponding path program 1 times [2025-02-06 02:03:19,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:03:19,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991783840] [2025-02-06 02:03:19,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:03:19,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:03:19,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 02:03:19,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 02:03:19,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:03:19,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:03:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 02:03:20,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:03:20,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991783840] [2025-02-06 02:03:20,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991783840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:03:20,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:03:20,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:03:20,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412859766] [2025-02-06 02:03:20,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:03:20,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:03:20,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:03:20,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:03:20,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:03:20,028 INFO L87 Difference]: Start difference. First operand 266 states and 396 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 02:03:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:03:20,098 INFO L93 Difference]: Finished difference Result 467 states and 692 transitions. [2025-02-06 02:03:20,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:03:20,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 180 [2025-02-06 02:03:20,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:03:20,101 INFO L225 Difference]: With dead ends: 467 [2025-02-06 02:03:20,101 INFO L226 Difference]: Without dead ends: 335 [2025-02-06 02:03:20,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:03:20,102 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 47 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:03:20,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 289 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:03:20,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-02-06 02:03:20,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 314. [2025-02-06 02:03:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 255 states have (on average 1.4392156862745098) internal successors, (367), 255 states have internal predecessors, (367), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 02:03:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 471 transitions. [2025-02-06 02:03:20,131 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 471 transitions. Word has length 180 [2025-02-06 02:03:20,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:03:20,131 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 471 transitions. [2025-02-06 02:03:20,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 02:03:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 471 transitions. [2025-02-06 02:03:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 02:03:20,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:03:20,134 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:03:20,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:03:20,135 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:03:20,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:03:20,135 INFO L85 PathProgramCache]: Analyzing trace with hash 271180857, now seen corresponding path program 1 times [2025-02-06 02:03:20,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:03:20,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409082013] [2025-02-06 02:03:20,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:03:20,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:03:20,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 02:03:20,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 02:03:20,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:03:20,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:03:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 02:03:20,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:03:20,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409082013] [2025-02-06 02:03:20,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409082013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:03:20,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:03:20,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:03:20,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240722039] [2025-02-06 02:03:20,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:03:20,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:03:20,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:03:20,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:03:20,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:03:20,355 INFO L87 Difference]: Start difference. First operand 314 states and 471 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 02:03:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:03:20,558 INFO L93 Difference]: Finished difference Result 642 states and 963 transitions. [2025-02-06 02:03:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:03:20,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 180 [2025-02-06 02:03:20,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:03:20,561 INFO L225 Difference]: With dead ends: 642 [2025-02-06 02:03:20,562 INFO L226 Difference]: Without dead ends: 413 [2025-02-06 02:03:20,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:03:20,563 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 213 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:03:20,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 504 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:03:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-02-06 02:03:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 288. [2025-02-06 02:03:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 229 states have (on average 1.4148471615720524) internal successors, (324), 229 states have internal predecessors, (324), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 02:03:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 428 transitions. [2025-02-06 02:03:20,584 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 428 transitions. Word has length 180 [2025-02-06 02:03:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:03:20,584 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 428 transitions. [2025-02-06 02:03:20,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 02:03:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 428 transitions. [2025-02-06 02:03:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-06 02:03:20,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:03:20,586 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:03:20,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:03:20,586 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:03:20,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:03:20,587 INFO L85 PathProgramCache]: Analyzing trace with hash -246718605, now seen corresponding path program 1 times [2025-02-06 02:03:20,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:03:20,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978577346] [2025-02-06 02:03:20,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:03:20,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:03:20,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-06 02:03:20,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-06 02:03:20,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:03:20,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:03:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-02-06 02:03:20,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:03:20,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978577346] [2025-02-06 02:03:20,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978577346] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:03:20,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479072396] [2025-02-06 02:03:20,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:03:20,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:03:20,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:03:20,992 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:03:20,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:03:21,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-06 02:03:21,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-06 02:03:21,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:03:21,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:03:21,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 02:03:21,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:03:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 435 proven. 60 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-02-06 02:03:21,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:03:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-02-06 02:03:22,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479072396] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:03:22,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:03:22,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2025-02-06 02:03:22,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681395150] [2025-02-06 02:03:22,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:03:22,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 02:03:22,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:03:22,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 02:03:22,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-06 02:03:22,121 INFO L87 Difference]: Start difference. First operand 288 states and 428 transitions. Second operand has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 4 states have call successors, (72), 2 states have call predecessors, (72), 4 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) [2025-02-06 02:03:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:03:23,267 INFO L93 Difference]: Finished difference Result 696 states and 1003 transitions. [2025-02-06 02:03:23,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 02:03:23,268 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 4 states have call successors, (72), 2 states have call predecessors, (72), 4 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) Word has length 181 [2025-02-06 02:03:23,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:03:23,272 INFO L225 Difference]: With dead ends: 696 [2025-02-06 02:03:23,272 INFO L226 Difference]: Without dead ends: 444 [2025-02-06 02:03:23,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 356 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=263, Invalid=927, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 02:03:23,274 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 416 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:03:23,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 749 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:03:23,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-02-06 02:03:23,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 272. [2025-02-06 02:03:23,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 211 states have (on average 1.3270142180094786) internal successors, (280), 211 states have internal predecessors, (280), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 02:03:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 384 transitions. [2025-02-06 02:03:23,302 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 384 transitions. Word has length 181 [2025-02-06 02:03:23,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:03:23,303 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 384 transitions. [2025-02-06 02:03:23,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 4 states have call successors, (72), 2 states have call predecessors, (72), 4 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) [2025-02-06 02:03:23,303 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 384 transitions. [2025-02-06 02:03:23,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-06 02:03:23,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:03:23,305 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:03:23,314 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-02-06 02:03:23,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:03:23,506 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:03:23,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:03:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash 387790437, now seen corresponding path program 1 times [2025-02-06 02:03:23,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:03:23,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639772250] [2025-02-06 02:03:23,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:03:23,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:03:23,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-06 02:03:23,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-06 02:03:23,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:03:23,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat