./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-45.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_amount250_file-45.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 b05815fd5cec927760044a6cdc6a3ae40876f51be4ef175e85dd936d2cf2ad8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:17:54,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:17:54,336 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:17:54,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:17:54,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:17:54,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:17:54,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:17:54,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:17:54,354 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:17:54,354 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:17:54,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:17:54,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:17:54,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:17:54,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:17:54,355 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:17:54,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:17:54,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:17:54,355 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:17:54,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:17:54,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:17:54,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:17:54,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:17:54,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:17:54,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:17:54,355 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:17:54,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:17:54,355 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:17:54,355 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:17:54,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:17:54,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:17:54,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:17:54,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:17:54,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:17:54,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:17:54,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:17:54,356 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:17:54,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:17:54,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:17:54,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:17:54,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:17:54,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:17:54,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:17:54,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:17:54,356 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 -> b05815fd5cec927760044a6cdc6a3ae40876f51be4ef175e85dd936d2cf2ad8e [2025-02-06 02:17:54,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:17:54,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:17:54,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:17:54,575 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:17:54,575 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:17:54,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-45.i [2025-02-06 02:17:55,826 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/379fd1c69/913ec68b94544c6f9ccba78b1e449dec/FLAG4ac06a476 [2025-02-06 02:17:56,120 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:17:56,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-45.i [2025-02-06 02:17:56,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/379fd1c69/913ec68b94544c6f9ccba78b1e449dec/FLAG4ac06a476 [2025-02-06 02:17:56,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/379fd1c69/913ec68b94544c6f9ccba78b1e449dec [2025-02-06 02:17:56,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:17:56,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:17:56,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:17:56,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:17:56,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:17:56,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:17:56" (1/1) ... [2025-02-06 02:17:56,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191d48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:56, skipping insertion in model container [2025-02-06 02:17:56,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:17:56" (1/1) ... [2025-02-06 02:17:56,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:17:56,289 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_amount250_file-45.i[916,929] [2025-02-06 02:17:56,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:17:56,438 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:17:56,448 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_amount250_file-45.i[916,929] [2025-02-06 02:17:56,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:17:56,542 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:17:56,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:56 WrapperNode [2025-02-06 02:17:56,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:17:56,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:17:56,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:17:56,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:17:56,550 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:17:56" (1/1) ... [2025-02-06 02:17:56,566 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:17:56" (1/1) ... [2025-02-06 02:17:56,620 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 450 [2025-02-06 02:17:56,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:17:56,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:17:56,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:17:56,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:17:56,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:56" (1/1) ... [2025-02-06 02:17:56,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:56" (1/1) ... [2025-02-06 02:17:56,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:56" (1/1) ... [2025-02-06 02:17:56,667 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:17:56,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:56" (1/1) ... [2025-02-06 02:17:56,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:56" (1/1) ... [2025-02-06 02:17:56,680 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:56" (1/1) ... [2025-02-06 02:17:56,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:56" (1/1) ... [2025-02-06 02:17:56,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:56" (1/1) ... [2025-02-06 02:17:56,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:56" (1/1) ... [2025-02-06 02:17:56,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:17:56,706 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:17:56,706 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:17:56,706 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:17:56,706 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:56" (1/1) ... [2025-02-06 02:17:56,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:17:56,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:17:56,736 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:17:56,742 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:17:56,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:17:56,755 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:17:56,755 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:17:56,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:17:56,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:17:56,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:17:56,826 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:17:56,828 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:17:57,390 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L352: havoc property_#t~ite32#1;havoc property_#t~bitwise31#1;havoc property_#t~ite34#1;havoc property_#t~bitwise33#1;havoc property_#t~short35#1;havoc property_#t~bitwise36#1;havoc property_#t~short37#1;havoc property_#t~bitwise38#1;havoc property_#t~short39#1;havoc property_#t~ite41#1;havoc property_#t~bitwise40#1;havoc property_#t~short42#1; [2025-02-06 02:17:57,457 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-02-06 02:17:57,460 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:17:57,486 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:17:57,486 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 02:17:57,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:17:57 BoogieIcfgContainer [2025-02-06 02:17:57,487 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:17:57,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:17:57,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:17:57,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:17:57,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:17:56" (1/3) ... [2025-02-06 02:17:57,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151cc8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:17:57, skipping insertion in model container [2025-02-06 02:17:57,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:17:56" (2/3) ... [2025-02-06 02:17:57,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151cc8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:17:57, skipping insertion in model container [2025-02-06 02:17:57,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:17:57" (3/3) ... [2025-02-06 02:17:57,495 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-45.i [2025-02-06 02:17:57,506 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:17:57,509 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-45.i that has 2 procedures, 179 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:17:57,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:17:57,594 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;@22e5aca1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:17:57,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:17:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 138 states have (on average 1.5072463768115942) internal successors, (208), 139 states have internal predecessors, (208), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 02:17:57,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-06 02:17:57,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:57,660 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:57,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:57,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:57,670 INFO L85 PathProgramCache]: Analyzing trace with hash -962456706, now seen corresponding path program 1 times [2025-02-06 02:17:57,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:57,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337915143] [2025-02-06 02:17:57,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:57,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-06 02:17:57,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-06 02:17:57,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:57,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2025-02-06 02:17:58,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:58,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337915143] [2025-02-06 02:17:58,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337915143] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:17:58,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198293093] [2025-02-06 02:17:58,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:58,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:17:58,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:17:58,454 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:17:58,457 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:17:58,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-06 02:17:58,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-06 02:17:58,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:58,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:58,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:17:58,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:17:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2025-02-06 02:17:58,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:17:58,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198293093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:58,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:17:58,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:17:58,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130076024] [2025-02-06 02:17:58,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:58,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:17:58,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:58,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:17:58,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:17:58,687 INFO L87 Difference]: Start difference. First operand has 179 states, 138 states have (on average 1.5072463768115942) internal successors, (208), 139 states have internal predecessors, (208), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2025-02-06 02:17:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:58,729 INFO L93 Difference]: Finished difference Result 351 states and 599 transitions. [2025-02-06 02:17:58,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:17:58,731 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) Word has length 270 [2025-02-06 02:17:58,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:58,736 INFO L225 Difference]: With dead ends: 351 [2025-02-06 02:17:58,737 INFO L226 Difference]: Without dead ends: 175 [2025-02-06 02:17:58,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 271 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:17:58,741 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:58,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:17:58,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-02-06 02:17:58,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-02-06 02:17:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 135 states have (on average 1.4814814814814814) internal successors, (200), 135 states have internal predecessors, (200), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 02:17:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 276 transitions. [2025-02-06 02:17:58,775 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 276 transitions. Word has length 270 [2025-02-06 02:17:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:58,776 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 276 transitions. [2025-02-06 02:17:58,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2025-02-06 02:17:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 276 transitions. [2025-02-06 02:17:58,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-06 02:17:58,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:58,780 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:58,789 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:17:58,981 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:17:58,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:58,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:58,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1233520384, now seen corresponding path program 1 times [2025-02-06 02:17:58,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:58,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541914504] [2025-02-06 02:17:58,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:58,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:59,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-06 02:17:59,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-06 02:17:59,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:59,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-02-06 02:17:59,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:59,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541914504] [2025-02-06 02:17:59,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541914504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:59,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:59,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:17:59,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851002702] [2025-02-06 02:17:59,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:59,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:17:59,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:59,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:17:59,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:17:59,293 INFO L87 Difference]: Start difference. First operand 175 states and 276 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-02-06 02:17:59,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:59,411 INFO L93 Difference]: Finished difference Result 509 states and 804 transitions. [2025-02-06 02:17:59,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:17:59,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 270 [2025-02-06 02:17:59,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:59,415 INFO L225 Difference]: With dead ends: 509 [2025-02-06 02:17:59,418 INFO L226 Difference]: Without dead ends: 337 [2025-02-06 02:17:59,420 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:17:59,420 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 250 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:59,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 690 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:17:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-02-06 02:17:59,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 204. [2025-02-06 02:17:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 164 states have (on average 1.5) internal successors, (246), 164 states have internal predecessors, (246), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 02:17:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 322 transitions. [2025-02-06 02:17:59,448 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 322 transitions. Word has length 270 [2025-02-06 02:17:59,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:59,451 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 322 transitions. [2025-02-06 02:17:59,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-02-06 02:17:59,452 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 322 transitions. [2025-02-06 02:17:59,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-06 02:17:59,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:59,456 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:59,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:17:59,456 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:59,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:59,457 INFO L85 PathProgramCache]: Analyzing trace with hash -903754623, now seen corresponding path program 1 times [2025-02-06 02:17:59,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:59,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572860885] [2025-02-06 02:17:59,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:59,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:59,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-06 02:17:59,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-06 02:17:59,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:59,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:17:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-02-06 02:17:59,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:17:59,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572860885] [2025-02-06 02:17:59,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572860885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:17:59,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:17:59,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:17:59,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040945859] [2025-02-06 02:17:59,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:17:59,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:17:59,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:59,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:17:59,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:17:59,712 INFO L87 Difference]: Start difference. First operand 204 states and 322 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-02-06 02:17:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:17:59,808 INFO L93 Difference]: Finished difference Result 584 states and 923 transitions. [2025-02-06 02:17:59,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:17:59,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 270 [2025-02-06 02:17:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:17:59,812 INFO L225 Difference]: With dead ends: 584 [2025-02-06 02:17:59,812 INFO L226 Difference]: Without dead ends: 383 [2025-02-06 02:17:59,813 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:17:59,813 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 228 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:17:59,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 541 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:17:59,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-02-06 02:17:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 277. [2025-02-06 02:17:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 237 states have (on average 1.5232067510548524) internal successors, (361), 237 states have internal predecessors, (361), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 02:17:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 437 transitions. [2025-02-06 02:17:59,832 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 437 transitions. Word has length 270 [2025-02-06 02:17:59,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:17:59,833 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 437 transitions. [2025-02-06 02:17:59,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-02-06 02:17:59,833 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 437 transitions. [2025-02-06 02:17:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-06 02:17:59,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:17:59,835 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:59,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:17:59,836 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:17:59,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:17:59,836 INFO L85 PathProgramCache]: Analyzing trace with hash 465083105, now seen corresponding path program 1 times [2025-02-06 02:17:59,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:17:59,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659059182] [2025-02-06 02:17:59,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:17:59,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:17:59,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-06 02:17:59,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-06 02:17:59,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:17:59,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:00,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-02-06 02:18:00,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:18:00,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659059182] [2025-02-06 02:18:00,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659059182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:18:00,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:18:00,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:18:00,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435680724] [2025-02-06 02:18:00,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:18:00,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:18:00,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:18:00,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:18:00,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:18:00,009 INFO L87 Difference]: Start difference. First operand 277 states and 437 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-02-06 02:18:00,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:18:00,083 INFO L93 Difference]: Finished difference Result 694 states and 1092 transitions. [2025-02-06 02:18:00,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:18:00,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 270 [2025-02-06 02:18:00,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:18:00,086 INFO L225 Difference]: With dead ends: 694 [2025-02-06 02:18:00,086 INFO L226 Difference]: Without dead ends: 420 [2025-02-06 02:18:00,087 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:18:00,087 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 239 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:18:00,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 504 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:18:00,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-02-06 02:18:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 277. [2025-02-06 02:18:00,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 237 states have (on average 1.5147679324894514) internal successors, (359), 237 states have internal predecessors, (359), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 02:18:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 435 transitions. [2025-02-06 02:18:00,101 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 435 transitions. Word has length 270 [2025-02-06 02:18:00,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:18:00,101 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 435 transitions. [2025-02-06 02:18:00,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-02-06 02:18:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 435 transitions. [2025-02-06 02:18:00,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-06 02:18:00,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:18:00,104 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:00,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:18:00,104 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:18:00,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:18:00,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1231039355, now seen corresponding path program 1 times [2025-02-06 02:18:00,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:18:00,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995929742] [2025-02-06 02:18:00,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:00,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:18:00,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-06 02:18:00,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-06 02:18:00,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:00,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-02-06 02:18:00,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:18:00,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995929742] [2025-02-06 02:18:00,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995929742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:18:00,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:18:00,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:18:00,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572135408] [2025-02-06 02:18:00,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:18:00,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:18:00,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:18:00,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:18:00,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:18:00,752 INFO L87 Difference]: Start difference. First operand 277 states and 435 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-02-06 02:18:01,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:18:01,050 INFO L93 Difference]: Finished difference Result 888 states and 1400 transitions. [2025-02-06 02:18:01,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:18:01,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 270 [2025-02-06 02:18:01,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:18:01,057 INFO L225 Difference]: With dead ends: 888 [2025-02-06 02:18:01,058 INFO L226 Difference]: Without dead ends: 614 [2025-02-06 02:18:01,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:18:01,059 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 265 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:18:01,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 785 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:18:01,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-02-06 02:18:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 529. [2025-02-06 02:18:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 450 states have (on average 1.52) internal successors, (684), 450 states have internal predecessors, (684), 76 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-02-06 02:18:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 836 transitions. [2025-02-06 02:18:01,111 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 836 transitions. Word has length 270 [2025-02-06 02:18:01,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:18:01,112 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 836 transitions. [2025-02-06 02:18:01,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-02-06 02:18:01,113 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 836 transitions. [2025-02-06 02:18:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-06 02:18:01,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:18:01,114 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:01,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:18:01,115 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:18:01,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:18:01,115 INFO L85 PathProgramCache]: Analyzing trace with hash -873310979, now seen corresponding path program 1 times [2025-02-06 02:18:01,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:18:01,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246610338] [2025-02-06 02:18:01,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:01,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:18:01,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-06 02:18:01,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-06 02:18:01,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:01,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-02-06 02:18:01,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:18:01,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246610338] [2025-02-06 02:18:01,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246610338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:18:01,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:18:01,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:18:01,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97410128] [2025-02-06 02:18:01,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:18:01,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:18:01,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:18:01,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:18:01,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:18:01,537 INFO L87 Difference]: Start difference. First operand 529 states and 836 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-02-06 02:18:01,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:18:01,866 INFO L93 Difference]: Finished difference Result 1059 states and 1670 transitions. [2025-02-06 02:18:01,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:18:01,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 271 [2025-02-06 02:18:01,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:18:01,870 INFO L225 Difference]: With dead ends: 1059 [2025-02-06 02:18:01,870 INFO L226 Difference]: Without dead ends: 614 [2025-02-06 02:18:01,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:18:01,871 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 261 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:18:01,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 788 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:18:01,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-02-06 02:18:01,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 530. [2025-02-06 02:18:01,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 451 states have (on average 1.516629711751663) internal successors, (684), 451 states have internal predecessors, (684), 76 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-02-06 02:18:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 836 transitions. [2025-02-06 02:18:01,921 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 836 transitions. Word has length 271 [2025-02-06 02:18:01,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:18:01,921 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 836 transitions. [2025-02-06 02:18:01,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-02-06 02:18:01,921 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 836 transitions. [2025-02-06 02:18:01,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-06 02:18:01,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:18:01,928 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:01,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:18:01,928 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:18:01,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:18:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash 415277829, now seen corresponding path program 1 times [2025-02-06 02:18:01,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:18:01,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697161678] [2025-02-06 02:18:01,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:01,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:18:01,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-06 02:18:02,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-06 02:18:02,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:02,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-02-06 02:18:02,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:18:02,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697161678] [2025-02-06 02:18:02,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697161678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:18:02,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:18:02,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:18:02,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894299215] [2025-02-06 02:18:02,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:18:02,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:18:02,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:18:02,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:18:02,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:18:02,340 INFO L87 Difference]: Start difference. First operand 530 states and 836 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-02-06 02:18:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:18:02,825 INFO L93 Difference]: Finished difference Result 1726 states and 2720 transitions. [2025-02-06 02:18:02,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:18:02,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 272 [2025-02-06 02:18:02,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:18:02,831 INFO L225 Difference]: With dead ends: 1726 [2025-02-06 02:18:02,831 INFO L226 Difference]: Without dead ends: 1359 [2025-02-06 02:18:02,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:18:02,832 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 446 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:18:02,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 872 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:18:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2025-02-06 02:18:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1329. [2025-02-06 02:18:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1172 states have (on average 1.5273037542662116) internal successors, (1790), 1172 states have internal predecessors, (1790), 152 states have call successors, (152), 4 states have call predecessors, (152), 4 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2025-02-06 02:18:02,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 2094 transitions. [2025-02-06 02:18:02,924 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 2094 transitions. Word has length 272 [2025-02-06 02:18:02,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:18:02,926 INFO L471 AbstractCegarLoop]: Abstraction has 1329 states and 2094 transitions. [2025-02-06 02:18:02,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-02-06 02:18:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 2094 transitions. [2025-02-06 02:18:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-06 02:18:02,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:18:02,931 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:02,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:18:02,931 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:18:02,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:18:02,932 INFO L85 PathProgramCache]: Analyzing trace with hash -785347517, now seen corresponding path program 1 times [2025-02-06 02:18:02,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:18:02,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300443868] [2025-02-06 02:18:02,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:02,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:18:02,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-06 02:18:03,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-06 02:18:03,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:03,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-02-06 02:18:04,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:18:04,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300443868] [2025-02-06 02:18:04,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300443868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:18:04,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:18:04,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:18:04,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644562526] [2025-02-06 02:18:04,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:18:04,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:18:04,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:18:04,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:18:04,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:18:04,229 INFO L87 Difference]: Start difference. First operand 1329 states and 2094 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-02-06 02:18:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:18:05,377 INFO L93 Difference]: Finished difference Result 4114 states and 6402 transitions. [2025-02-06 02:18:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:18:05,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 273 [2025-02-06 02:18:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:18:05,390 INFO L225 Difference]: With dead ends: 4114 [2025-02-06 02:18:05,390 INFO L226 Difference]: Without dead ends: 3814 [2025-02-06 02:18:05,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:18:05,393 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 2252 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2252 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:18:05,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2252 Valid, 947 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:18:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3814 states. [2025-02-06 02:18:05,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3814 to 2004. [2025-02-06 02:18:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 1804 states have (on average 1.528270509977827) internal successors, (2757), 1804 states have internal predecessors, (2757), 190 states have call successors, (190), 9 states have call predecessors, (190), 9 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2025-02-06 02:18:05,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 3137 transitions. [2025-02-06 02:18:05,503 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 3137 transitions. Word has length 273 [2025-02-06 02:18:05,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:18:05,503 INFO L471 AbstractCegarLoop]: Abstraction has 2004 states and 3137 transitions. [2025-02-06 02:18:05,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-02-06 02:18:05,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 3137 transitions. [2025-02-06 02:18:05,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-06 02:18:05,506 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:18:05,506 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:05,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:18:05,506 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:18:05,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:18:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1782419870, now seen corresponding path program 1 times [2025-02-06 02:18:05,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:18:05,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069904144] [2025-02-06 02:18:05,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:18:05,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-06 02:18:05,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-06 02:18:05,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:05,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:05,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-02-06 02:18:05,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:18:05,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069904144] [2025-02-06 02:18:05,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069904144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:18:05,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:18:05,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:18:05,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667642502] [2025-02-06 02:18:05,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:18:05,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:18:05,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:18:05,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:18:05,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:18:05,868 INFO L87 Difference]: Start difference. First operand 2004 states and 3137 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-02-06 02:18:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:18:06,029 INFO L93 Difference]: Finished difference Result 5593 states and 8755 transitions. [2025-02-06 02:18:06,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:18:06,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 273 [2025-02-06 02:18:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:18:06,046 INFO L225 Difference]: With dead ends: 5593 [2025-02-06 02:18:06,046 INFO L226 Difference]: Without dead ends: 3931 [2025-02-06 02:18:06,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-06 02:18:06,050 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 262 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:18:06,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 856 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:18:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2025-02-06 02:18:06,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 3925. [2025-02-06 02:18:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3925 states, 3566 states have (on average 1.5266404935501963) internal successors, (5444), 3566 states have internal predecessors, (5444), 342 states have call successors, (342), 16 states have call predecessors, (342), 16 states have return successors, (342), 342 states have call predecessors, (342), 342 states have call successors, (342) [2025-02-06 02:18:06,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 6128 transitions. [2025-02-06 02:18:06,210 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 6128 transitions. Word has length 273 [2025-02-06 02:18:06,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:18:06,210 INFO L471 AbstractCegarLoop]: Abstraction has 3925 states and 6128 transitions. [2025-02-06 02:18:06,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-02-06 02:18:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 6128 transitions. [2025-02-06 02:18:06,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-06 02:18:06,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:18:06,214 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:06,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:18:06,214 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:18:06,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:18:06,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1085870939, now seen corresponding path program 1 times [2025-02-06 02:18:06,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:18:06,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474193432] [2025-02-06 02:18:06,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:06,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:18:06,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-06 02:18:06,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-06 02:18:06,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:06,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-02-06 02:18:06,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:18:06,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474193432] [2025-02-06 02:18:06,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474193432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:18:06,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:18:06,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:18:06,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413589727] [2025-02-06 02:18:06,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:18:06,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:18:06,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:18:06,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:18:06,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:18:06,297 INFO L87 Difference]: Start difference. First operand 3925 states and 6128 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-02-06 02:18:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:18:06,434 INFO L93 Difference]: Finished difference Result 8822 states and 13794 transitions. [2025-02-06 02:18:06,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:18:06,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 274 [2025-02-06 02:18:06,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:18:06,451 INFO L225 Difference]: With dead ends: 8822 [2025-02-06 02:18:06,451 INFO L226 Difference]: Without dead ends: 4974 [2025-02-06 02:18:06,458 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:18:06,458 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 163 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:18:06,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 573 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:18:06,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4974 states. [2025-02-06 02:18:06,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4974 to 3930. [2025-02-06 02:18:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3930 states, 3571 states have (on average 1.5245029403528423) internal successors, (5444), 3571 states have internal predecessors, (5444), 342 states have call successors, (342), 16 states have call predecessors, (342), 16 states have return successors, (342), 342 states have call predecessors, (342), 342 states have call successors, (342) [2025-02-06 02:18:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3930 states to 3930 states and 6128 transitions. [2025-02-06 02:18:06,638 INFO L78 Accepts]: Start accepts. Automaton has 3930 states and 6128 transitions. Word has length 274 [2025-02-06 02:18:06,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:18:06,638 INFO L471 AbstractCegarLoop]: Abstraction has 3930 states and 6128 transitions. [2025-02-06 02:18:06,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-02-06 02:18:06,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3930 states and 6128 transitions. [2025-02-06 02:18:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-06 02:18:06,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:18:06,646 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:06,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:18:06,646 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:18:06,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:18:06,646 INFO L85 PathProgramCache]: Analyzing trace with hash -392478234, now seen corresponding path program 1 times [2025-02-06 02:18:06,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:18:06,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905578283] [2025-02-06 02:18:06,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:06,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:18:06,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-06 02:18:06,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-06 02:18:06,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:06,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:18:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-02-06 02:18:07,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:18:07,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905578283] [2025-02-06 02:18:07,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905578283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:18:07,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:18:07,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:18:07,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732859725] [2025-02-06 02:18:07,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:18:07,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:18:07,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:18:07,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:18:07,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:18:07,056 INFO L87 Difference]: Start difference. First operand 3930 states and 6128 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-02-06 02:18:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:18:07,652 INFO L93 Difference]: Finished difference Result 5356 states and 8339 transitions. [2025-02-06 02:18:07,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:18:07,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 274 [2025-02-06 02:18:07,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:18:07,676 INFO L225 Difference]: With dead ends: 5356 [2025-02-06 02:18:07,680 INFO L226 Difference]: Without dead ends: 3423 [2025-02-06 02:18:07,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:18:07,689 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 199 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:18:07,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 750 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:18:07,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3423 states. [2025-02-06 02:18:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3423 to 3329. [2025-02-06 02:18:07,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 2970 states have (on average 1.5171717171717172) internal successors, (4506), 2970 states have internal predecessors, (4506), 342 states have call successors, (342), 16 states have call predecessors, (342), 16 states have return successors, (342), 342 states have call predecessors, (342), 342 states have call successors, (342) [2025-02-06 02:18:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 5190 transitions. [2025-02-06 02:18:07,881 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 5190 transitions. Word has length 274 [2025-02-06 02:18:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:18:07,881 INFO L471 AbstractCegarLoop]: Abstraction has 3329 states and 5190 transitions. [2025-02-06 02:18:07,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-02-06 02:18:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 5190 transitions. [2025-02-06 02:18:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-06 02:18:07,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:18:07,885 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:07,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:18:07,885 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:18:07,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:18:07,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1534817931, now seen corresponding path program 1 times [2025-02-06 02:18:07,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:18:07,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450174657] [2025-02-06 02:18:07,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:18:07,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:18:07,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-06 02:18:08,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-06 02:18:08,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:18:08,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat