./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-88.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 1648b8247576116efcc38ecc57a34288105aaaa4b64d600c2638d97bcecc6c8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:02:10,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:02:10,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:02:10,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:02:10,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:02:10,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:02:10,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:02:10,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:02:10,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:02:10,136 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:02:10,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:02:10,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:02:10,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:02:10,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:02:10,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:02:10,137 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:02:10,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:02:10,137 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:02:10,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:02:10,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:02:10,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:02:10,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:02:10,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:02:10,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:02:10,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:02:10,138 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 -> 1648b8247576116efcc38ecc57a34288105aaaa4b64d600c2638d97bcecc6c8c [2025-02-05 22:02:10,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:02:10,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:02:10,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:02:10,394 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:02:10,394 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:02:10,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-88.i [2025-02-05 22:02:11,591 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64e43f3c7/e2ffeb2d195b4ba9befdbe2fe956b986/FLAG4323f6ea6 [2025-02-05 22:02:11,981 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:02:11,985 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-88.i [2025-02-05 22:02:12,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64e43f3c7/e2ffeb2d195b4ba9befdbe2fe956b986/FLAG4323f6ea6 [2025-02-05 22:02:12,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64e43f3c7/e2ffeb2d195b4ba9befdbe2fe956b986 [2025-02-05 22:02:12,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:02:12,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:02:12,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:02:12,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:02:12,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:02:12,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:02:12" (1/1) ... [2025-02-05 22:02:12,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a01903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:12, skipping insertion in model container [2025-02-05 22:02:12,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:02:12" (1/1) ... [2025-02-05 22:02:12,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:02:12,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-88.i[916,929] [2025-02-05 22:02:12,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:02:12,471 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:02:12,478 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-88.i[916,929] [2025-02-05 22:02:12,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:02:12,549 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:02:12,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:12 WrapperNode [2025-02-05 22:02:12,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:02:12,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:02:12,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:02:12,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:02:12,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:12" (1/1) ... [2025-02-05 22:02:12,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:12" (1/1) ... [2025-02-05 22:02:12,634 INFO L138 Inliner]: procedures = 26, calls = 128, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 877 [2025-02-05 22:02:12,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:02:12,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:02:12,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:02:12,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:02:12,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:12" (1/1) ... [2025-02-05 22:02:12,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:12" (1/1) ... [2025-02-05 22:02:12,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:12" (1/1) ... [2025-02-05 22:02:12,685 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 22:02:12,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:12" (1/1) ... [2025-02-05 22:02:12,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:12" (1/1) ... [2025-02-05 22:02:12,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:12" (1/1) ... [2025-02-05 22:02:12,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:12" (1/1) ... [2025-02-05 22:02:12,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:12" (1/1) ... [2025-02-05 22:02:12,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:12" (1/1) ... [2025-02-05 22:02:12,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:02:12,726 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:02:12,726 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:02:12,726 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:02:12,727 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:12" (1/1) ... [2025-02-05 22:02:12,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:02:12,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:02:12,751 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:02:12,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:02:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:02:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:02:12,771 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:02:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:02:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:02:12,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:02:12,883 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:02:12,884 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:02:13,648 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L732: havoc property_#t~bitwise88#1;havoc property_#t~ite90#1;havoc property_#t~bitwise89#1;havoc property_#t~short91#1; [2025-02-05 22:02:13,830 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-02-05 22:02:13,830 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:02:13,867 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:02:13,870 INFO L337 CfgBuilder]: Removed 3 assume(true) statements. [2025-02-05 22:02:13,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:02:13 BoogieIcfgContainer [2025-02-05 22:02:13,871 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:02:13,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:02:13,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:02:13,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:02:13,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:02:12" (1/3) ... [2025-02-05 22:02:13,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6b0b9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:02:13, skipping insertion in model container [2025-02-05 22:02:13,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:12" (2/3) ... [2025-02-05 22:02:13,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6b0b9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:02:13, skipping insertion in model container [2025-02-05 22:02:13,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:02:13" (3/3) ... [2025-02-05 22:02:13,879 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-88.i [2025-02-05 22:02:13,889 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:02:13,892 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-88.i that has 2 procedures, 368 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:02:13,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:02:13,956 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;@78edecda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:02:13,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:02:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 368 states, 250 states have (on average 1.568) internal successors, (392), 251 states have internal predecessors, (392), 115 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2025-02-05 22:02:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2025-02-05 22:02:13,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:13,997 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:13,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:14,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:14,001 INFO L85 PathProgramCache]: Analyzing trace with hash -53040664, now seen corresponding path program 1 times [2025-02-05 22:02:14,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:14,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661836584] [2025-02-05 22:02:14,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:14,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:14,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-02-05 22:02:14,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-02-05 22:02:14,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:14,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 25992 trivial. 0 not checked. [2025-02-05 22:02:14,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:14,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661836584] [2025-02-05 22:02:14,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661836584] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:02:14,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169727331] [2025-02-05 22:02:14,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:14,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:02:14,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:02:14,541 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:02:14,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:02:14,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-02-05 22:02:14,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-02-05 22:02:14,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:14,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:14,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 1596 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:02:14,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:02:14,939 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 25992 trivial. 0 not checked. [2025-02-05 22:02:14,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:02:14,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169727331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:14,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:02:14,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:02:14,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443539394] [2025-02-05 22:02:14,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:14,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:02:14,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:14,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:02:14,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:02:14,965 INFO L87 Difference]: Start difference. First operand has 368 states, 250 states have (on average 1.568) internal successors, (392), 251 states have internal predecessors, (392), 115 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (115), 2 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 2 states have call successors, (115) [2025-02-05 22:02:15,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:15,027 INFO L93 Difference]: Finished difference Result 727 states and 1350 transitions. [2025-02-05 22:02:15,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:02:15,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (115), 2 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 2 states have call successors, (115) Word has length 727 [2025-02-05 22:02:15,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:15,036 INFO L225 Difference]: With dead ends: 727 [2025-02-05 22:02:15,036 INFO L226 Difference]: Without dead ends: 362 [2025-02-05 22:02:15,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 728 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:02:15,042 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:15,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:02:15,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-02-05 22:02:15,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-02-05 22:02:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 245 states have (on average 1.5551020408163265) internal successors, (381), 245 states have internal predecessors, (381), 115 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2025-02-05 22:02:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 611 transitions. [2025-02-05 22:02:15,106 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 611 transitions. Word has length 727 [2025-02-05 22:02:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:15,106 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 611 transitions. [2025-02-05 22:02:15,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (115), 2 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 2 states have call successors, (115) [2025-02-05 22:02:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 611 transitions. [2025-02-05 22:02:15,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-02-05 22:02:15,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:15,122 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:15,134 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-05 22:02:15,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:02:15,326 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:15,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:15,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1055779298, now seen corresponding path program 1 times [2025-02-05 22:02:15,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:15,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937479240] [2025-02-05 22:02:15,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:15,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:15,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-02-05 22:02:15,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-02-05 22:02:15,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:15,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-02-05 22:02:16,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:16,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937479240] [2025-02-05 22:02:16,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937479240] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:16,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:16,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:16,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631063489] [2025-02-05 22:02:16,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:16,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:16,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:16,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:16,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:16,119 INFO L87 Difference]: Start difference. First operand 362 states and 611 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-05 22:02:16,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:16,237 INFO L93 Difference]: Finished difference Result 973 states and 1648 transitions. [2025-02-05 22:02:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:16,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-02-05 22:02:16,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:16,243 INFO L225 Difference]: With dead ends: 973 [2025-02-05 22:02:16,243 INFO L226 Difference]: Without dead ends: 614 [2025-02-05 22:02:16,244 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-05 22:02:16,245 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 415 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:16,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1337 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:16,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-02-05 22:02:16,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 611. [2025-02-05 22:02:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 431 states have (on average 1.580046403712297) internal successors, (681), 432 states have internal predecessors, (681), 177 states have call successors, (177), 2 states have call predecessors, (177), 2 states have return successors, (177), 176 states have call predecessors, (177), 177 states have call successors, (177) [2025-02-05 22:02:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1035 transitions. [2025-02-05 22:02:16,311 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1035 transitions. Word has length 728 [2025-02-05 22:02:16,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:16,313 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 1035 transitions. [2025-02-05 22:02:16,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-05 22:02:16,313 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1035 transitions. [2025-02-05 22:02:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-02-05 22:02:16,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:16,325 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:16,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:02:16,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:16,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:16,326 INFO L85 PathProgramCache]: Analyzing trace with hash 847080995, now seen corresponding path program 1 times [2025-02-05 22:02:16,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:16,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682669159] [2025-02-05 22:02:16,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:16,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:16,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-02-05 22:02:16,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-02-05 22:02:16,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:16,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-02-05 22:02:16,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:16,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682669159] [2025-02-05 22:02:16,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682669159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:16,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:16,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:16,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192562428] [2025-02-05 22:02:16,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:16,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:16,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:16,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:16,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:16,696 INFO L87 Difference]: Start difference. First operand 611 states and 1035 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-05 22:02:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:16,812 INFO L93 Difference]: Finished difference Result 1637 states and 2786 transitions. [2025-02-05 22:02:16,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:16,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-02-05 22:02:16,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:16,827 INFO L225 Difference]: With dead ends: 1637 [2025-02-05 22:02:16,830 INFO L226 Difference]: Without dead ends: 1029 [2025-02-05 22:02:16,833 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-05 22:02:16,834 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 369 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:16,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1398 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-02-05 22:02:16,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1025. [2025-02-05 22:02:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 783 states have (on average 1.6257982120051087) internal successors, (1273), 786 states have internal predecessors, (1273), 237 states have call successors, (237), 4 states have call predecessors, (237), 4 states have return successors, (237), 234 states have call predecessors, (237), 237 states have call successors, (237) [2025-02-05 22:02:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1747 transitions. [2025-02-05 22:02:16,913 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1747 transitions. Word has length 728 [2025-02-05 22:02:16,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:16,915 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1747 transitions. [2025-02-05 22:02:16,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-05 22:02:16,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1747 transitions. [2025-02-05 22:02:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-02-05 22:02:16,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:16,923 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:16,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:02:16,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:16,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:16,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1476946844, now seen corresponding path program 1 times [2025-02-05 22:02:16,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:16,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647928010] [2025-02-05 22:02:16,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:16,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:16,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-02-05 22:02:17,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-02-05 22:02:17,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:17,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-02-05 22:02:17,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:17,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647928010] [2025-02-05 22:02:17,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647928010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:17,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:17,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:17,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921858047] [2025-02-05 22:02:17,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:17,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:17,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:17,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:17,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:17,225 INFO L87 Difference]: Start difference. First operand 1025 states and 1747 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-05 22:02:17,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:17,330 INFO L93 Difference]: Finished difference Result 2721 states and 4608 transitions. [2025-02-05 22:02:17,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:17,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-02-05 22:02:17,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:17,340 INFO L225 Difference]: With dead ends: 2721 [2025-02-05 22:02:17,340 INFO L226 Difference]: Without dead ends: 1699 [2025-02-05 22:02:17,343 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-05 22:02:17,343 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 380 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:17,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1236 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:02:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2025-02-05 22:02:17,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1696. [2025-02-05 22:02:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1228 states have (on average 1.5798045602605864) internal successors, (1940), 1235 states have internal predecessors, (1940), 459 states have call successors, (459), 8 states have call predecessors, (459), 8 states have return successors, (459), 452 states have call predecessors, (459), 459 states have call successors, (459) [2025-02-05 22:02:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2858 transitions. [2025-02-05 22:02:17,436 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2858 transitions. Word has length 728 [2025-02-05 22:02:17,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:17,437 INFO L471 AbstractCegarLoop]: Abstraction has 1696 states and 2858 transitions. [2025-02-05 22:02:17,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-05 22:02:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2858 transitions. [2025-02-05 22:02:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-02-05 22:02:17,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:17,443 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:17,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:02:17,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:17,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:17,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1793326531, now seen corresponding path program 1 times [2025-02-05 22:02:17,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:17,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898812458] [2025-02-05 22:02:17,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:17,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:17,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-02-05 22:02:17,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-02-05 22:02:17,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:17,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:17,858 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-02-05 22:02:17,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:17,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898812458] [2025-02-05 22:02:17,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898812458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:17,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:17,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:02:17,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068840862] [2025-02-05 22:02:17,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:17,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:02:17,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:17,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:02:17,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:02:17,861 INFO L87 Difference]: Start difference. First operand 1696 states and 2858 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-05 22:02:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:18,152 INFO L93 Difference]: Finished difference Result 5082 states and 8568 transitions. [2025-02-05 22:02:18,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:18,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-02-05 22:02:18,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:18,174 INFO L225 Difference]: With dead ends: 5082 [2025-02-05 22:02:18,174 INFO L226 Difference]: Without dead ends: 3389 [2025-02-05 22:02:18,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:02:18,180 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 660 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:18,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1177 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:02:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3389 states. [2025-02-05 22:02:18,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3389 to 3387. [2025-02-05 22:02:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3387 states, 2452 states have (on average 1.5774877650897228) internal successors, (3868), 2466 states have internal predecessors, (3868), 918 states have call successors, (918), 16 states have call predecessors, (918), 16 states have return successors, (918), 904 states have call predecessors, (918), 918 states have call successors, (918) [2025-02-05 22:02:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 5704 transitions. [2025-02-05 22:02:18,459 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 5704 transitions. Word has length 728 [2025-02-05 22:02:18,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:18,460 INFO L471 AbstractCegarLoop]: Abstraction has 3387 states and 5704 transitions. [2025-02-05 22:02:18,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-05 22:02:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 5704 transitions. [2025-02-05 22:02:18,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-02-05 22:02:18,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:18,471 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:18,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:02:18,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:18,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:18,472 INFO L85 PathProgramCache]: Analyzing trace with hash -142333756, now seen corresponding path program 1 times [2025-02-05 22:02:18,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:18,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145220330] [2025-02-05 22:02:18,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:18,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:18,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-02-05 22:02:18,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-02-05 22:02:18,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:18,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-02-05 22:02:19,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:19,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145220330] [2025-02-05 22:02:19,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145220330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:19,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:19,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:02:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679599167] [2025-02-05 22:02:19,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:19,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:02:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:19,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:02:19,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:02:19,342 INFO L87 Difference]: Start difference. First operand 3387 states and 5704 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-05 22:02:20,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:20,584 INFO L93 Difference]: Finished difference Result 17317 states and 28817 transitions. [2025-02-05 22:02:20,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:02:20,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-02-05 22:02:20,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:20,652 INFO L225 Difference]: With dead ends: 17317 [2025-02-05 22:02:20,652 INFO L226 Difference]: Without dead ends: 13933 [2025-02-05 22:02:20,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:02:20,666 INFO L435 NwaCegarLoop]: 1117 mSDtfsCounter, 1413 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:20,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 2684 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 22:02:20,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13933 states. [2025-02-05 22:02:21,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13933 to 6363. [2025-02-05 22:02:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6363 states, 4588 states have (on average 1.5623365300784655) internal successors, (7168), 4618 states have internal predecessors, (7168), 1742 states have call successors, (1742), 32 states have call predecessors, (1742), 32 states have return successors, (1742), 1712 states have call predecessors, (1742), 1742 states have call successors, (1742) [2025-02-05 22:02:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6363 states to 6363 states and 10652 transitions. [2025-02-05 22:02:21,463 INFO L78 Accepts]: Start accepts. Automaton has 6363 states and 10652 transitions. Word has length 728 [2025-02-05 22:02:21,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:21,465 INFO L471 AbstractCegarLoop]: Abstraction has 6363 states and 10652 transitions. [2025-02-05 22:02:21,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-05 22:02:21,470 INFO L276 IsEmpty]: Start isEmpty. Operand 6363 states and 10652 transitions. [2025-02-05 22:02:21,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-02-05 22:02:21,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:21,483 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:21,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:02:21,484 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:21,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:21,484 INFO L85 PathProgramCache]: Analyzing trace with hash -18260509, now seen corresponding path program 1 times [2025-02-05 22:02:21,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:21,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859100070] [2025-02-05 22:02:21,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:21,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:21,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-02-05 22:02:21,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-02-05 22:02:21,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:21,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-02-05 22:02:21,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:21,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859100070] [2025-02-05 22:02:21,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859100070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:21,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:21,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:21,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368993270] [2025-02-05 22:02:21,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:21,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:21,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:21,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:21,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:21,739 INFO L87 Difference]: Start difference. First operand 6363 states and 10652 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-05 22:02:22,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:22,379 INFO L93 Difference]: Finished difference Result 17805 states and 29678 transitions. [2025-02-05 22:02:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:22,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-02-05 22:02:22,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:22,447 INFO L225 Difference]: With dead ends: 17805 [2025-02-05 22:02:22,448 INFO L226 Difference]: Without dead ends: 11445 [2025-02-05 22:02:22,466 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-05 22:02:22,467 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 355 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:22,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1166 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:22,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11445 states. [2025-02-05 22:02:23,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11445 to 11435. [2025-02-05 22:02:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11435 states, 7996 states have (on average 1.5167583791895949) internal successors, (12128), 8058 states have internal predecessors, (12128), 3374 states have call successors, (3374), 64 states have call predecessors, (3374), 64 states have return successors, (3374), 3312 states have call predecessors, (3374), 3374 states have call successors, (3374) [2025-02-05 22:02:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11435 states to 11435 states and 18876 transitions. [2025-02-05 22:02:23,337 INFO L78 Accepts]: Start accepts. Automaton has 11435 states and 18876 transitions. Word has length 728 [2025-02-05 22:02:23,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:23,338 INFO L471 AbstractCegarLoop]: Abstraction has 11435 states and 18876 transitions. [2025-02-05 22:02:23,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-05 22:02:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 11435 states and 18876 transitions. [2025-02-05 22:02:23,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-02-05 22:02:23,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:23,357 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:23,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:02:23,358 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:23,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:23,358 INFO L85 PathProgramCache]: Analyzing trace with hash -150093115, now seen corresponding path program 1 times [2025-02-05 22:02:23,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:23,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366672359] [2025-02-05 22:02:23,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:23,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:23,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-02-05 22:02:23,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-02-05 22:02:23,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:23,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:23,568 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-02-05 22:02:23,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:23,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366672359] [2025-02-05 22:02:23,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366672359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:23,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:23,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:23,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954502832] [2025-02-05 22:02:23,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:23,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:23,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:23,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:23,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:23,571 INFO L87 Difference]: Start difference. First operand 11435 states and 18876 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-05 22:02:24,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:24,335 INFO L93 Difference]: Finished difference Result 22889 states and 37766 transitions. [2025-02-05 22:02:24,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:24,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-02-05 22:02:24,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:24,389 INFO L225 Difference]: With dead ends: 22889 [2025-02-05 22:02:24,390 INFO L226 Difference]: Without dead ends: 11457 [2025-02-05 22:02:24,424 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-05 22:02:24,425 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 353 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:24,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1222 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:02:24,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11457 states. [2025-02-05 22:02:25,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11457 to 7479. [2025-02-05 22:02:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7479 states, 5708 states have (on average 1.5837421163279608) internal successors, (9040), 5738 states have internal predecessors, (9040), 1734 states have call successors, (1734), 36 states have call predecessors, (1734), 36 states have return successors, (1734), 1704 states have call predecessors, (1734), 1734 states have call successors, (1734) [2025-02-05 22:02:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7479 states to 7479 states and 12508 transitions. [2025-02-05 22:02:25,278 INFO L78 Accepts]: Start accepts. Automaton has 7479 states and 12508 transitions. Word has length 728 [2025-02-05 22:02:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:25,279 INFO L471 AbstractCegarLoop]: Abstraction has 7479 states and 12508 transitions. [2025-02-05 22:02:25,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-05 22:02:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 7479 states and 12508 transitions. [2025-02-05 22:02:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-02-05 22:02:25,289 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:25,289 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:25,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:02:25,289 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:25,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:25,290 INFO L85 PathProgramCache]: Analyzing trace with hash 875398884, now seen corresponding path program 1 times [2025-02-05 22:02:25,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:25,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616728259] [2025-02-05 22:02:25,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:25,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:25,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-02-05 22:02:25,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-02-05 22:02:25,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:25,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-02-05 22:02:27,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:27,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616728259] [2025-02-05 22:02:27,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616728259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:27,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:27,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:02:27,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780811948] [2025-02-05 22:02:27,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:27,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:02:27,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:27,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:02:27,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:02:27,869 INFO L87 Difference]: Start difference. First operand 7479 states and 12508 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 2 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 2 states have call predecessors, (115), 2 states have call successors, (115) [2025-02-05 22:02:32,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 22:02:36,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 22:02:40,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 22:02:44,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 22:02:46,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:46,692 INFO L93 Difference]: Finished difference Result 33739 states and 56244 transitions. [2025-02-05 22:02:46,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:02:46,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 2 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 2 states have call predecessors, (115), 2 states have call successors, (115) Word has length 728 [2025-02-05 22:02:46,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:46,780 INFO L225 Difference]: With dead ends: 33739 [2025-02-05 22:02:46,780 INFO L226 Difference]: Without dead ends: 26263 [2025-02-05 22:02:46,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-02-05 22:02:46,805 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 1325 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 437 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 2110 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 437 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:46,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 2110 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [437 Valid, 850 Invalid, 4 Unknown, 0 Unchecked, 17.4s Time] [2025-02-05 22:02:46,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26263 states. [2025-02-05 22:02:48,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26263 to 18257. [2025-02-05 22:02:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18257 states, 14696 states have (on average 1.618399564507349) internal successors, (23784), 14756 states have internal predecessors, (23784), 3468 states have call successors, (3468), 92 states have call predecessors, (3468), 92 states have return successors, (3468), 3408 states have call predecessors, (3468), 3468 states have call successors, (3468) [2025-02-05 22:02:48,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18257 states to 18257 states and 30720 transitions. [2025-02-05 22:02:48,338 INFO L78 Accepts]: Start accepts. Automaton has 18257 states and 30720 transitions. Word has length 728 [2025-02-05 22:02:48,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:48,340 INFO L471 AbstractCegarLoop]: Abstraction has 18257 states and 30720 transitions. [2025-02-05 22:02:48,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 2 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 2 states have call predecessors, (115), 2 states have call successors, (115) [2025-02-05 22:02:48,340 INFO L276 IsEmpty]: Start isEmpty. Operand 18257 states and 30720 transitions. [2025-02-05 22:02:48,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-02-05 22:02:48,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:48,366 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:48,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:02:48,366 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:48,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:48,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1313408387, now seen corresponding path program 1 times [2025-02-05 22:02:48,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:48,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569002403] [2025-02-05 22:02:48,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:48,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:48,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-02-05 22:02:48,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-02-05 22:02:48,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:48,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-02-05 22:02:51,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:51,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569002403] [2025-02-05 22:02:51,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569002403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:51,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:51,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 22:02:51,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885490523] [2025-02-05 22:02:51,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:51,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 22:02:51,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:51,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 22:02:51,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-05 22:02:51,380 INFO L87 Difference]: Start difference. First operand 18257 states and 30720 transitions. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-05 22:02:57,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 22:03:14,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 22:03:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:21,285 INFO L93 Difference]: Finished difference Result 215821 states and 362082 transitions. [2025-02-05 22:03:21,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 22:03:21,285 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-02-05 22:03:21,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:21,890 INFO L225 Difference]: With dead ends: 215821 [2025-02-05 22:03:21,890 INFO L226 Difference]: Without dead ends: 197567 [2025-02-05 22:03:21,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2025-02-05 22:03:21,963 INFO L435 NwaCegarLoop]: 1290 mSDtfsCounter, 4253 mSDsluCounter, 7124 mSDsCounter, 0 mSdLazyCounter, 4775 mSolverCounterSat, 1392 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4253 SdHoareTripleChecker+Valid, 8414 SdHoareTripleChecker+Invalid, 6169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1392 IncrementalHoareTripleChecker+Valid, 4775 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:21,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4253 Valid, 8414 Invalid, 6169 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1392 Valid, 4775 Invalid, 2 Unknown, 0 Unchecked, 16.3s Time] [2025-02-05 22:03:22,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197567 states. [2025-02-05 22:03:32,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197567 to 130133. [2025-02-05 22:03:33,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130133 states, 105044 states have (on average 1.6167320360991584) internal successors, (169828), 105540 states have internal predecessors, (169828), 24368 states have call successors, (24368), 720 states have call predecessors, (24368), 720 states have return successors, (24368), 23872 states have call predecessors, (24368), 24368 states have call successors, (24368) [2025-02-05 22:03:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130133 states to 130133 states and 218564 transitions. [2025-02-05 22:03:33,387 INFO L78 Accepts]: Start accepts. Automaton has 130133 states and 218564 transitions. Word has length 728 [2025-02-05 22:03:33,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:33,388 INFO L471 AbstractCegarLoop]: Abstraction has 130133 states and 218564 transitions. [2025-02-05 22:03:33,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-05 22:03:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 130133 states and 218564 transitions. [2025-02-05 22:03:33,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-02-05 22:03:33,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:33,454 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:03:33,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 22:03:33,454 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:33,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:33,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2011977886, now seen corresponding path program 1 times [2025-02-05 22:03:33,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:33,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099814752] [2025-02-05 22:03:33,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:33,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:33,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-02-05 22:03:33,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-02-05 22:03:33,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:33,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-02-05 22:03:33,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:33,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099814752] [2025-02-05 22:03:33,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099814752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:33,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:33,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:03:33,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194199532] [2025-02-05 22:03:33,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:33,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:03:33,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:33,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:03:33,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:03:33,785 INFO L87 Difference]: Start difference. First operand 130133 states and 218564 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115)