./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-33.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_fillercode_fillercodestructure_filler-pr-co_file-33.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 5c234e2fefe11c7ac0093946cc9cf5ef419837c81c25df397f2c3f9610af0164 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:20:45,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:20:45,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 23:20:45,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:20:45,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:20:45,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:20:45,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:20:45,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:20:45,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:20:45,472 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:20:45,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:20:45,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:20:45,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:20:45,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:20:45,474 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:20:45,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:20:45,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:20:45,474 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:20:45,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:20:45,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:20:45,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:20:45,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:20:45,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:20:45,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:20:45,474 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:20:45,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:20:45,474 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:20:45,475 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:20:45,475 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:20:45,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:20:45,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:20:45,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:20:45,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:20:45,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:20:45,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:20:45,476 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:20:45,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:20:45,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:20:45,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:20:45,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:20:45,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:20:45,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:20:45,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:20:45,476 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 -> 5c234e2fefe11c7ac0093946cc9cf5ef419837c81c25df397f2c3f9610af0164 [2025-02-05 23:20:45,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:20:45,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:20:45,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:20:45,731 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:20:45,731 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:20:45,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-33.i [2025-02-05 23:20:46,920 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88067e0f5/4fef188d3ee24aa389ce6a099a11d0c2/FLAG56da10744 [2025-02-05 23:20:47,176 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:20:47,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-33.i [2025-02-05 23:20:47,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88067e0f5/4fef188d3ee24aa389ce6a099a11d0c2/FLAG56da10744 [2025-02-05 23:20:47,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88067e0f5/4fef188d3ee24aa389ce6a099a11d0c2 [2025-02-05 23:20:47,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:20:47,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:20:47,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:20:47,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:20:47,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:20:47,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:20:47" (1/1) ... [2025-02-05 23:20:47,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a3954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:20:47, skipping insertion in model container [2025-02-05 23:20:47,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:20:47" (1/1) ... [2025-02-05 23:20:47,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:20:47,608 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_fillercode_fillercodestructure_filler-pr-co_file-33.i[919,932] [2025-02-05 23:20:47,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:20:47,660 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:20:47,667 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_fillercode_fillercodestructure_filler-pr-co_file-33.i[919,932] [2025-02-05 23:20:47,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:20:47,700 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:20:47,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:20:47 WrapperNode [2025-02-05 23:20:47,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:20:47,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:20:47,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:20:47,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:20:47,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:20:47" (1/1) ... [2025-02-05 23:20:47,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:20:47" (1/1) ... [2025-02-05 23:20:47,736 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2025-02-05 23:20:47,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:20:47,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:20:47,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:20:47,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:20:47,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:20:47" (1/1) ... [2025-02-05 23:20:47,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:20:47" (1/1) ... [2025-02-05 23:20:47,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:20:47" (1/1) ... [2025-02-05 23:20:47,764 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-05 23:20:47,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:20:47" (1/1) ... [2025-02-05 23:20:47,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:20:47" (1/1) ... [2025-02-05 23:20:47,774 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:20:47" (1/1) ... [2025-02-05 23:20:47,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:20:47" (1/1) ... [2025-02-05 23:20:47,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:20:47" (1/1) ... [2025-02-05 23:20:47,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:20:47" (1/1) ... [2025-02-05 23:20:47,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:20:47,784 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:20:47,784 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:20:47,785 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:20:47,785 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:20:47" (1/1) ... [2025-02-05 23:20:47,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:20:47,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:20:47,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 23:20:47,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 23:20:47,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:20:47,825 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:20:47,825 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:20:47,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:20:47,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:20:47,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:20:47,890 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:20:47,892 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:20:48,263 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L184: havoc property_#t~ite23#1;havoc property_#t~bitwise22#1; [2025-02-05 23:20:48,291 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-02-05 23:20:48,292 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:20:48,303 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:20:48,306 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:20:48,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:20:48 BoogieIcfgContainer [2025-02-05 23:20:48,307 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:20:48,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:20:48,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:20:48,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:20:48,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:20:47" (1/3) ... [2025-02-05 23:20:48,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f05a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:20:48, skipping insertion in model container [2025-02-05 23:20:48,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:20:47" (2/3) ... [2025-02-05 23:20:48,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f05a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:20:48, skipping insertion in model container [2025-02-05 23:20:48,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:20:48" (3/3) ... [2025-02-05 23:20:48,318 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-33.i [2025-02-05 23:20:48,328 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:20:48,329 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-33.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:20:48,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:20:48,394 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;@19ab47bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:20:48,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:20:48,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 64 states have internal predecessors, (89), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 23:20:48,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 23:20:48,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:20:48,411 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:20:48,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:20:48,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:20:48,415 INFO L85 PathProgramCache]: Analyzing trace with hash -214456676, now seen corresponding path program 1 times [2025-02-05 23:20:48,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:20:48,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270642489] [2025-02-05 23:20:48,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:20:48,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:20:48,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 23:20:48,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 23:20:48,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:20:48,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:20:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-02-05 23:20:48,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:20:48,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270642489] [2025-02-05 23:20:48,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270642489] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:20:48,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50657869] [2025-02-05 23:20:48,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:20:48,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:20:48,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:20:48,726 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:20:48,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 23:20:48,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 23:20:48,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 23:20:48,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:20:48,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:20:48,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:20:48,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:20:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-02-05 23:20:48,886 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:20:48,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50657869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:20:48,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:20:48,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:20:48,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048824529] [2025-02-05 23:20:48,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:20:48,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:20:48,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:20:48,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:20:48,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:20:48,912 INFO L87 Difference]: Start difference. First operand has 100 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 64 states have internal predecessors, (89), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:20:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:20:48,949 INFO L93 Difference]: Finished difference Result 192 states and 339 transitions. [2025-02-05 23:20:48,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:20:48,952 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 214 [2025-02-05 23:20:48,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:20:48,959 INFO L225 Difference]: With dead ends: 192 [2025-02-05 23:20:48,959 INFO L226 Difference]: Without dead ends: 95 [2025-02-05 23:20:48,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 215 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-05 23:20:48,964 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:20:48,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:20:48,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-05 23:20:48,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-05 23:20:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 59 states have internal predecessors, (76), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 23:20:49,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 144 transitions. [2025-02-05 23:20:49,005 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 144 transitions. Word has length 214 [2025-02-05 23:20:49,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:20:49,005 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 144 transitions. [2025-02-05 23:20:49,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:20:49,006 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 144 transitions. [2025-02-05 23:20:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 23:20:49,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:20:49,009 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:20:49,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 23:20:49,209 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-05 23:20:49,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:20:49,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:20:49,211 INFO L85 PathProgramCache]: Analyzing trace with hash -890860834, now seen corresponding path program 1 times [2025-02-05 23:20:49,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:20:49,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465268521] [2025-02-05 23:20:49,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:20:49,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:20:49,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 23:20:49,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 23:20:49,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:20:49,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:20:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:20:49,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:20:49,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465268521] [2025-02-05 23:20:49,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465268521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:20:49,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:20:49,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:20:49,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399016328] [2025-02-05 23:20:49,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:20:49,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:20:49,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:20:49,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:20:49,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:20:49,629 INFO L87 Difference]: Start difference. First operand 95 states and 144 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:20:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:20:49,724 INFO L93 Difference]: Finished difference Result 267 states and 411 transitions. [2025-02-05 23:20:49,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:20:49,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 214 [2025-02-05 23:20:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:20:49,729 INFO L225 Difference]: With dead ends: 267 [2025-02-05 23:20:49,730 INFO L226 Difference]: Without dead ends: 175 [2025-02-05 23:20:49,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:20:49,732 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 88 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:20:49,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 390 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:20:49,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-02-05 23:20:49,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2025-02-05 23:20:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 101 states have (on average 1.2772277227722773) internal successors, (129), 101 states have internal predecessors, (129), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 23:20:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 265 transitions. [2025-02-05 23:20:49,778 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 265 transitions. Word has length 214 [2025-02-05 23:20:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:20:49,779 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 265 transitions. [2025-02-05 23:20:49,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:20:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 265 transitions. [2025-02-05 23:20:49,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 23:20:49,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:20:49,781 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:20:49,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:20:49,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:20:49,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:20:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash 874043467, now seen corresponding path program 1 times [2025-02-05 23:20:49,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:20:49,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861907606] [2025-02-05 23:20:49,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:20:49,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:20:49,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 23:20:49,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 23:20:49,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:20:49,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:20:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:20:50,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:20:50,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861907606] [2025-02-05 23:20:50,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861907606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:20:50,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:20:50,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:20:50,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209862030] [2025-02-05 23:20:50,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:20:50,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:20:50,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:20:50,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:20:50,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:20:50,685 INFO L87 Difference]: Start difference. First operand 172 states and 265 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:20:51,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:20:51,064 INFO L93 Difference]: Finished difference Result 281 states and 432 transitions. [2025-02-05 23:20:51,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:20:51,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-02-05 23:20:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:20:51,069 INFO L225 Difference]: With dead ends: 281 [2025-02-05 23:20:51,070 INFO L226 Difference]: Without dead ends: 172 [2025-02-05 23:20:51,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:20:51,072 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 100 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:20:51,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 482 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 23:20:51,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-02-05 23:20:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-02-05 23:20:51,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 101 states have (on average 1.2574257425742574) internal successors, (127), 101 states have internal predecessors, (127), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 23:20:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 263 transitions. [2025-02-05 23:20:51,118 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 263 transitions. Word has length 215 [2025-02-05 23:20:51,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:20:51,118 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 263 transitions. [2025-02-05 23:20:51,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:20:51,119 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 263 transitions. [2025-02-05 23:20:51,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 23:20:51,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:20:51,121 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:20:51,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:20:51,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:20:51,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:20:51,123 INFO L85 PathProgramCache]: Analyzing trace with hash 29571596, now seen corresponding path program 1 times [2025-02-05 23:20:51,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:20:51,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412421551] [2025-02-05 23:20:51,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:20:51,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:20:51,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 23:20:51,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 23:20:51,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:20:51,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:20:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:20:51,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:20:51,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412421551] [2025-02-05 23:20:51,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412421551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:20:51,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:20:51,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:20:51,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139745800] [2025-02-05 23:20:51,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:20:51,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:20:51,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:20:51,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:20:51,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:20:51,531 INFO L87 Difference]: Start difference. First operand 172 states and 263 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:20:51,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:20:51,822 INFO L93 Difference]: Finished difference Result 302 states and 457 transitions. [2025-02-05 23:20:51,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:20:51,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-02-05 23:20:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:20:51,824 INFO L225 Difference]: With dead ends: 302 [2025-02-05 23:20:51,824 INFO L226 Difference]: Without dead ends: 193 [2025-02-05 23:20:51,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:20:51,825 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 89 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:20:51,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 361 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:20:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-05 23:20:51,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 178. [2025-02-05 23:20:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 107 states have (on average 1.2523364485981308) internal successors, (134), 107 states have internal predecessors, (134), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 23:20:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 270 transitions. [2025-02-05 23:20:51,850 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 270 transitions. Word has length 215 [2025-02-05 23:20:51,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:20:51,851 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 270 transitions. [2025-02-05 23:20:51,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:20:51,851 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 270 transitions. [2025-02-05 23:20:51,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-05 23:20:51,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:20:51,854 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:20:51,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:20:51,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:20:51,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:20:51,855 INFO L85 PathProgramCache]: Analyzing trace with hash 81744917, now seen corresponding path program 1 times [2025-02-05 23:20:51,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:20:51,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82532489] [2025-02-05 23:20:51,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:20:51,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:20:51,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 23:20:51,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 23:20:51,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:20:51,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:20:55,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:20:55,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:20:55,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82532489] [2025-02-05 23:20:55,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82532489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:20:55,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:20:55,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 23:20:55,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499666997] [2025-02-05 23:20:55,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:20:55,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 23:20:55,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:20:55,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 23:20:55,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 23:20:55,337 INFO L87 Difference]: Start difference. First operand 178 states and 270 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:20:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:20:56,921 INFO L93 Difference]: Finished difference Result 408 states and 607 transitions. [2025-02-05 23:20:56,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 23:20:56,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2025-02-05 23:20:56,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:20:56,924 INFO L225 Difference]: With dead ends: 408 [2025-02-05 23:20:56,925 INFO L226 Difference]: Without dead ends: 307 [2025-02-05 23:20:56,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-02-05 23:20:56,926 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 445 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:20:56,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 632 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 23:20:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-02-05 23:20:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 190. [2025-02-05 23:20:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 119 states have (on average 1.2605042016806722) internal successors, (150), 119 states have internal predecessors, (150), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 23:20:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 286 transitions. [2025-02-05 23:20:56,960 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 286 transitions. Word has length 217 [2025-02-05 23:20:56,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:20:56,960 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 286 transitions. [2025-02-05 23:20:56,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:20:56,960 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 286 transitions. [2025-02-05 23:20:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-05 23:20:56,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:20:56,963 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:20:56,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 23:20:56,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:20:56,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:20:56,967 INFO L85 PathProgramCache]: Analyzing trace with hash 210827636, now seen corresponding path program 1 times [2025-02-05 23:20:56,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:20:56,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649613855] [2025-02-05 23:20:56,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:20:56,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:20:56,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 23:20:57,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 23:20:57,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:20:57,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:21:05,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:21:05,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:21:05,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649613855] [2025-02-05 23:21:05,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649613855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:21:05,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:21:05,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 23:21:05,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781863473] [2025-02-05 23:21:05,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:21:05,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 23:21:05,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:21:05,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 23:21:05,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-02-05 23:21:05,487 INFO L87 Difference]: Start difference. First operand 190 states and 286 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:21:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:21:07,816 INFO L93 Difference]: Finished difference Result 280 states and 390 transitions. [2025-02-05 23:21:07,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 23:21:07,816 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2025-02-05 23:21:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:21:07,818 INFO L225 Difference]: With dead ends: 280 [2025-02-05 23:21:07,818 INFO L226 Difference]: Without dead ends: 278 [2025-02-05 23:21:07,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2025-02-05 23:21:07,819 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 415 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:21:07,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 785 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 23:21:07,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-02-05 23:21:07,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 207. [2025-02-05 23:21:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 136 states have (on average 1.25) internal successors, (170), 136 states have internal predecessors, (170), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 23:21:07,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 306 transitions. [2025-02-05 23:21:07,834 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 306 transitions. Word has length 217 [2025-02-05 23:21:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:21:07,834 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 306 transitions. [2025-02-05 23:21:07,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:21:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 306 transitions. [2025-02-05 23:21:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-05 23:21:07,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:21:07,836 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:21:07,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:21:07,837 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:21:07,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:21:07,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1596626827, now seen corresponding path program 1 times [2025-02-05 23:21:07,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:21:07,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810136221] [2025-02-05 23:21:07,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:21:07,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:21:07,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 23:21:08,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 23:21:08,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:21:08,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:21:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:21:17,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:21:17,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810136221] [2025-02-05 23:21:17,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810136221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:21:17,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:21:17,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 23:21:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104667820] [2025-02-05 23:21:17,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:21:17,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 23:21:17,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:21:17,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 23:21:17,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:21:17,644 INFO L87 Difference]: Start difference. First operand 207 states and 306 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:21:19,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:21:19,739 INFO L93 Difference]: Finished difference Result 246 states and 356 transitions. [2025-02-05 23:21:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 23:21:19,739 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 217 [2025-02-05 23:21:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:21:19,741 INFO L225 Difference]: With dead ends: 246 [2025-02-05 23:21:19,741 INFO L226 Difference]: Without dead ends: 244 [2025-02-05 23:21:19,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2025-02-05 23:21:19,742 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 281 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:21:19,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 846 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 23:21:19,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-02-05 23:21:19,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 207. [2025-02-05 23:21:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 136 states have (on average 1.25) internal successors, (170), 136 states have internal predecessors, (170), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 23:21:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 306 transitions. [2025-02-05 23:21:19,760 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 306 transitions. Word has length 217 [2025-02-05 23:21:19,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:21:19,761 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 306 transitions. [2025-02-05 23:21:19,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:21:19,761 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 306 transitions. [2025-02-05 23:21:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-05 23:21:19,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:21:19,763 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:21:19,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 23:21:19,763 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:21:19,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:21:19,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1435054614, now seen corresponding path program 1 times [2025-02-05 23:21:19,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:21:19,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973846286] [2025-02-05 23:21:19,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:21:19,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:21:19,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 23:21:19,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 23:21:19,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:21:19,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:21:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 6 proven. 93 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-02-05 23:21:23,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:21:23,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973846286] [2025-02-05 23:21:23,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973846286] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:21:23,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6455591] [2025-02-05 23:21:23,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:21:23,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:21:23,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:21:23,329 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:21:23,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 23:21:23,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 23:21:23,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 23:21:23,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:21:23,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:21:23,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-05 23:21:23,437 INFO L279 TraceCheckSpWp]: Computing forward predicates...