./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d295d755d44127829d46828e377e22a38631a635ad7a6b559c09be673317721a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:34:19,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:34:19,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:34:19,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:34:19,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:34:19,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:34:19,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:34:19,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:34:19,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:34:19,965 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:34:19,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:34:19,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:34:19,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:34:19,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:34:19,966 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:34:19,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:34:19,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:34:19,966 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:34:19,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:34:19,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:34:19,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:34:19,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:34:19,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:34:19,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:34:19,966 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:34:19,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:34:19,966 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:34:19,967 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:34:19,967 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:34:19,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:34:19,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:34:19,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:34:19,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:34:19,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:34:19,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:34:19,967 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:34:19,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:34:19,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:34:19,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:34:19,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:34:19,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:34:19,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:34:19,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:34:19,967 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/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 -> d295d755d44127829d46828e377e22a38631a635ad7a6b559c09be673317721a [2025-03-16 20:34:20,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:34:20,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:34:20,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:34:20,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:34:20,199 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:34:20,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c [2025-03-16 20:34:21,374 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d2ad1f74/11bb607976d147628e8ae6d9761f04be/FLAG64999640e [2025-03-16 20:34:21,834 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:34:21,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c [2025-03-16 20:34:21,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d2ad1f74/11bb607976d147628e8ae6d9761f04be/FLAG64999640e [2025-03-16 20:34:21,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d2ad1f74/11bb607976d147628e8ae6d9761f04be [2025-03-16 20:34:21,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:34:21,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:34:21,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:34:21,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:34:21,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:34:21,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:34:21" (1/1) ... [2025-03-16 20:34:21,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37de6d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:21, skipping insertion in model container [2025-03-16 20:34:21,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:34:21" (1/1) ... [2025-03-16 20:34:21,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:34:22,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c[20426,20439] [2025-03-16 20:34:22,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c[22763,22776] [2025-03-16 20:34:22,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:34:22,687 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:34:22,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c[20426,20439] [2025-03-16 20:34:22,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c[22763,22776] [2025-03-16 20:34:22,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:34:22,990 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:34:22,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:22 WrapperNode [2025-03-16 20:34:22,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:34:22,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:34:22,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:34:22,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:34:22,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:22" (1/1) ... [2025-03-16 20:34:23,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:22" (1/1) ... [2025-03-16 20:34:23,281 INFO L138 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5215 [2025-03-16 20:34:23,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:34:23,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:34:23,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:34:23,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:34:23,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:22" (1/1) ... [2025-03-16 20:34:23,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:22" (1/1) ... [2025-03-16 20:34:23,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:22" (1/1) ... [2025-03-16 20:34:23,459 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-03-16 20:34:23,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:22" (1/1) ... [2025-03-16 20:34:23,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:22" (1/1) ... [2025-03-16 20:34:23,565 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:22" (1/1) ... [2025-03-16 20:34:23,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:22" (1/1) ... [2025-03-16 20:34:23,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:22" (1/1) ... [2025-03-16 20:34:23,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:22" (1/1) ... [2025-03-16 20:34:23,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:34:23,660 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:34:23,660 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:34:23,660 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:34:23,662 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:22" (1/1) ... [2025-03-16 20:34:23,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:34:23,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:34:23,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:34:23,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:34:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:34:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:34:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:34:23,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:34:23,777 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:34:23,778 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:34:27,112 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc calculate_output_#t~ret46#1; [2025-03-16 20:34:27,113 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3764: havoc calculate_output2_#t~ret47#1; [2025-03-16 20:34:27,113 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5254: havoc calculate_output3_#t~ret48#1; [2025-03-16 20:34:27,252 INFO L? ?]: Removed 751 outVars from TransFormulas that were not future-live. [2025-03-16 20:34:27,252 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:34:27,277 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:34:27,282 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:34:27,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:34:27 BoogieIcfgContainer [2025-03-16 20:34:27,282 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:34:27,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:34:27,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:34:27,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:34:27,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:34:21" (1/3) ... [2025-03-16 20:34:27,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51081798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:34:27, skipping insertion in model container [2025-03-16 20:34:27,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:22" (2/3) ... [2025-03-16 20:34:27,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51081798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:34:27, skipping insertion in model container [2025-03-16 20:34:27,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:34:27" (3/3) ... [2025-03-16 20:34:27,290 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c [2025-03-16 20:34:27,300 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:34:27,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c that has 1 procedures, 865 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:34:27,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:34:27,370 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;@2b9350f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:34:27,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:34:27,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 865 states, 862 states have (on average 1.9698375870069607) internal successors, (1698), 864 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:27,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:34:27,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:27,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:34:27,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:27,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:27,383 INFO L85 PathProgramCache]: Analyzing trace with hash 700562919, now seen corresponding path program 1 times [2025-03-16 20:34:27,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:27,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207621639] [2025-03-16 20:34:27,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:27,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:27,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:34:27,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:34:27,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:27,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:34:27,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:27,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207621639] [2025-03-16 20:34:27,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207621639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:27,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:27,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:34:27,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753509176] [2025-03-16 20:34:27,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:27,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:34:27,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:27,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:34:27,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:34:27,570 INFO L87 Difference]: Start difference. First operand has 865 states, 862 states have (on average 1.9698375870069607) internal successors, (1698), 864 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:27,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:27,648 INFO L93 Difference]: Finished difference Result 1676 states and 3290 transitions. [2025-03-16 20:34:27,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:34:27,654 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-16 20:34:27,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:27,668 INFO L225 Difference]: With dead ends: 1676 [2025-03-16 20:34:27,668 INFO L226 Difference]: Without dead ends: 861 [2025-03-16 20:34:27,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-03-16 20:34:27,679 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:27,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-03-16 20:34:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2025-03-16 20:34:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 859 states have (on average 1.8963911525029105) internal successors, (1629), 860 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1629 transitions. [2025-03-16 20:34:27,762 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1629 transitions. Word has length 19 [2025-03-16 20:34:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:27,762 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1629 transitions. [2025-03-16 20:34:27,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1629 transitions. [2025-03-16 20:34:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:34:27,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:27,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:34:27,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:34:27,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:27,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash 268101418, now seen corresponding path program 1 times [2025-03-16 20:34:27,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:27,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354863005] [2025-03-16 20:34:27,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:27,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:27,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:34:27,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:34:27,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:27,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:34:27,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:27,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354863005] [2025-03-16 20:34:27,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354863005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:27,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:27,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:34:27,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438786272] [2025-03-16 20:34:27,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:27,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:27,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:27,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:27,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:27,905 INFO L87 Difference]: Start difference. First operand 861 states and 1629 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:30,548 INFO L93 Difference]: Finished difference Result 2365 states and 4502 transitions. [2025-03-16 20:34:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:30,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-16 20:34:30,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:30,555 INFO L225 Difference]: With dead ends: 2365 [2025-03-16 20:34:30,555 INFO L226 Difference]: Without dead ends: 1612 [2025-03-16 20:34:30,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-16 20:34:30,556 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 1040 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:30,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 305 Invalid, 3088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 20:34:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2025-03-16 20:34:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1612. [2025-03-16 20:34:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1610 states have (on average 1.8434782608695652) internal successors, (2968), 1611 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2968 transitions. [2025-03-16 20:34:30,609 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2968 transitions. Word has length 19 [2025-03-16 20:34:30,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:30,609 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 2968 transitions. [2025-03-16 20:34:30,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2968 transitions. [2025-03-16 20:34:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 20:34:30,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:30,610 INFO L218 NwaCegarLoop]: trace histogram [1, 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-03-16 20:34:30,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:34:30,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:30,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:30,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1382121296, now seen corresponding path program 1 times [2025-03-16 20:34:30,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:30,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044052731] [2025-03-16 20:34:30,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:30,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:30,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 20:34:30,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 20:34:30,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:30,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:34:30,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:30,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044052731] [2025-03-16 20:34:30,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044052731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:30,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:30,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:34:30,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972539310] [2025-03-16 20:34:30,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:30,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:34:30,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:30,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:34:30,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:34:30,805 INFO L87 Difference]: Start difference. First operand 1612 states and 2968 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:30,879 INFO L93 Difference]: Finished difference Result 1668 states and 3057 transitions. [2025-03-16 20:34:30,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:34:30,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-16 20:34:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:30,886 INFO L225 Difference]: With dead ends: 1668 [2025-03-16 20:34:30,886 INFO L226 Difference]: Without dead ends: 1612 [2025-03-16 20:34:30,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:34:30,887 INFO L435 NwaCegarLoop]: 1628 mSDtfsCounter, 0 mSDsluCounter, 3202 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4830 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:30,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4830 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:30,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2025-03-16 20:34:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1612. [2025-03-16 20:34:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1610 states have (on average 1.8124223602484473) internal successors, (2918), 1611 states have internal predecessors, (2918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2918 transitions. [2025-03-16 20:34:30,915 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2918 transitions. Word has length 25 [2025-03-16 20:34:30,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:30,915 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 2918 transitions. [2025-03-16 20:34:30,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:30,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2918 transitions. [2025-03-16 20:34:30,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 20:34:30,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:30,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:34:30,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:34:30,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:30,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:30,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1833953211, now seen corresponding path program 1 times [2025-03-16 20:34:30,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:30,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160782242] [2025-03-16 20:34:30,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:30,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:30,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 20:34:30,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 20:34:30,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:30,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:34:31,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:31,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160782242] [2025-03-16 20:34:31,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160782242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:31,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:31,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:31,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990084454] [2025-03-16 20:34:31,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:31,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:31,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:31,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:31,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:31,183 INFO L87 Difference]: Start difference. First operand 1612 states and 2918 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:31,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:31,519 INFO L93 Difference]: Finished difference Result 2354 states and 4122 transitions. [2025-03-16 20:34:31,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 20:34:31,520 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 20:34:31,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:31,528 INFO L225 Difference]: With dead ends: 2354 [2025-03-16 20:34:31,528 INFO L226 Difference]: Without dead ends: 2301 [2025-03-16 20:34:31,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-03-16 20:34:31,531 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 11475 mSDsluCounter, 3510 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11475 SdHoareTripleChecker+Valid, 5085 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:31,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11475 Valid, 5085 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:34:31,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2025-03-16 20:34:31,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 1663. [2025-03-16 20:34:31,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1661 states have (on average 1.806742925948224) internal successors, (3001), 1662 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 3001 transitions. [2025-03-16 20:34:31,569 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 3001 transitions. Word has length 74 [2025-03-16 20:34:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:31,570 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 3001 transitions. [2025-03-16 20:34:31,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 3001 transitions. [2025-03-16 20:34:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 20:34:31,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:31,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:34:31,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:34:31,572 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:31,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:31,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1455262201, now seen corresponding path program 1 times [2025-03-16 20:34:31,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:31,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985815039] [2025-03-16 20:34:31,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:31,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:31,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 20:34:31,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 20:34:31,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:31,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:34:31,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:31,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985815039] [2025-03-16 20:34:31,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985815039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:31,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:31,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:31,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073195960] [2025-03-16 20:34:31,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:31,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:31,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:31,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:31,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:31,987 INFO L87 Difference]: Start difference. First operand 1663 states and 3001 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:32,239 INFO L93 Difference]: Finished difference Result 1769 states and 3171 transitions. [2025-03-16 20:34:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:34:32,240 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 20:34:32,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:32,245 INFO L225 Difference]: With dead ends: 1769 [2025-03-16 20:34:32,245 INFO L226 Difference]: Without dead ends: 1665 [2025-03-16 20:34:32,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-16 20:34:32,246 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 6048 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6048 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:32,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6048 Valid, 2068 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:34:32,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-03-16 20:34:32,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1663. [2025-03-16 20:34:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1661 states have (on average 1.8061408789885611) internal successors, (3000), 1662 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 3000 transitions. [2025-03-16 20:34:32,277 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 3000 transitions. Word has length 76 [2025-03-16 20:34:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:32,277 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 3000 transitions. [2025-03-16 20:34:32,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:32,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 3000 transitions. [2025-03-16 20:34:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 20:34:32,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:32,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:34:32,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:34:32,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:32,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1456304886, now seen corresponding path program 1 times [2025-03-16 20:34:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:32,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043575196] [2025-03-16 20:34:32,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:32,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:32,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 20:34:32,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 20:34:32,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:32,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:34:32,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:32,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043575196] [2025-03-16 20:34:32,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043575196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:32,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:32,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:32,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751629185] [2025-03-16 20:34:32,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:32,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:32,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:32,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:32,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:32,381 INFO L87 Difference]: Start difference. First operand 1663 states and 3000 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:32,403 INFO L93 Difference]: Finished difference Result 1860 states and 3317 transitions. [2025-03-16 20:34:32,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:32,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 20:34:32,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:32,409 INFO L225 Difference]: With dead ends: 1860 [2025-03-16 20:34:32,409 INFO L226 Difference]: Without dead ends: 1756 [2025-03-16 20:34:32,410 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-03-16 20:34:32,410 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 1496 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:32,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1659 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:32,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2025-03-16 20:34:32,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1754. [2025-03-16 20:34:32,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 1752 states have (on average 1.7950913242009132) internal successors, (3145), 1753 states have internal predecessors, (3145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 3145 transitions. [2025-03-16 20:34:32,442 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 3145 transitions. Word has length 76 [2025-03-16 20:34:32,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:32,442 INFO L471 AbstractCegarLoop]: Abstraction has 1754 states and 3145 transitions. [2025-03-16 20:34:32,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:32,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3145 transitions. [2025-03-16 20:34:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 20:34:32,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:32,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:34:32,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:34:32,443 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:32,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:32,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2132497085, now seen corresponding path program 1 times [2025-03-16 20:34:32,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:32,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771374889] [2025-03-16 20:34:32,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:32,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:32,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 20:34:32,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 20:34:32,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:32,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:34:32,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:32,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771374889] [2025-03-16 20:34:32,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771374889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:32,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:32,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:34:32,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324380062] [2025-03-16 20:34:32,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:32,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:34:32,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:32,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:34:32,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:34:32,681 INFO L87 Difference]: Start difference. First operand 1754 states and 3145 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:32,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:32,722 INFO L93 Difference]: Finished difference Result 1760 states and 3152 transitions. [2025-03-16 20:34:32,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:34:32,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 20:34:32,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:32,728 INFO L225 Difference]: With dead ends: 1760 [2025-03-16 20:34:32,728 INFO L226 Difference]: Without dead ends: 1758 [2025-03-16 20:34:32,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:34:32,729 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 0 mSDsluCounter, 6289 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7864 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:32,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7864 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2025-03-16 20:34:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1758. [2025-03-16 20:34:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 1756 states have (on average 1.7927107061503418) internal successors, (3148), 1757 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:32,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 3148 transitions. [2025-03-16 20:34:32,760 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 3148 transitions. Word has length 77 [2025-03-16 20:34:32,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:32,761 INFO L471 AbstractCegarLoop]: Abstraction has 1758 states and 3148 transitions. [2025-03-16 20:34:32,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:32,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3148 transitions. [2025-03-16 20:34:32,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:32,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:32,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:34:32,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:34:32,762 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:32,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:32,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1167662761, now seen corresponding path program 1 times [2025-03-16 20:34:32,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:32,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836281052] [2025-03-16 20:34:32,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:32,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:32,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:32,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:32,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:32,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:34:32,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:32,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836281052] [2025-03-16 20:34:32,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836281052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:32,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:32,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:32,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203670988] [2025-03-16 20:34:32,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:32,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:32,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:32,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:32,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:32,827 INFO L87 Difference]: Start difference. First operand 1758 states and 3148 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:32,853 INFO L93 Difference]: Finished difference Result 1968 states and 3481 transitions. [2025-03-16 20:34:32,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:32,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:34:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:32,858 INFO L225 Difference]: With dead ends: 1968 [2025-03-16 20:34:32,859 INFO L226 Difference]: Without dead ends: 1860 [2025-03-16 20:34:32,861 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-03-16 20:34:32,861 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 1514 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:32,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1737 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:32,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2025-03-16 20:34:32,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1858. [2025-03-16 20:34:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1856 states have (on average 1.7807112068965518) internal successors, (3305), 1857 states have internal predecessors, (3305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 3305 transitions. [2025-03-16 20:34:32,893 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 3305 transitions. Word has length 78 [2025-03-16 20:34:32,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:32,894 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 3305 transitions. [2025-03-16 20:34:32,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 3305 transitions. [2025-03-16 20:34:32,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:32,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:32,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:34:32,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:34:32,895 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:32,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:32,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1361821271, now seen corresponding path program 1 times [2025-03-16 20:34:32,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:32,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870728888] [2025-03-16 20:34:32,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:32,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:32,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:32,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:32,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:32,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:34:32,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:32,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870728888] [2025-03-16 20:34:32,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870728888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:32,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:32,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:32,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165865038] [2025-03-16 20:34:32,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:32,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:32,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:32,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:32,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:32,950 INFO L87 Difference]: Start difference. First operand 1858 states and 3305 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:32,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:32,976 INFO L93 Difference]: Finished difference Result 2428 states and 4205 transitions. [2025-03-16 20:34:32,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:32,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:34:32,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:32,982 INFO L225 Difference]: With dead ends: 2428 [2025-03-16 20:34:32,982 INFO L226 Difference]: Without dead ends: 2131 [2025-03-16 20:34:32,985 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-03-16 20:34:32,987 INFO L435 NwaCegarLoop]: 1652 mSDtfsCounter, 1512 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:32,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1743 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2025-03-16 20:34:33,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 2129. [2025-03-16 20:34:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2129 states, 2127 states have (on average 1.7522331922896097) internal successors, (3727), 2128 states have internal predecessors, (3727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 3727 transitions. [2025-03-16 20:34:33,026 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 3727 transitions. Word has length 78 [2025-03-16 20:34:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:33,026 INFO L471 AbstractCegarLoop]: Abstraction has 2129 states and 3727 transitions. [2025-03-16 20:34:33,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:33,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 3727 transitions. [2025-03-16 20:34:33,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:33,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:33,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:34:33,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:34:33,027 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:33,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:33,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1652303017, now seen corresponding path program 1 times [2025-03-16 20:34:33,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:33,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401011926] [2025-03-16 20:34:33,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:33,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:33,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:33,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:33,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:33,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:33,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:34:33,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:33,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401011926] [2025-03-16 20:34:33,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401011926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:33,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:33,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:33,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551618470] [2025-03-16 20:34:33,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:33,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:33,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:33,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:33,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:33,113 INFO L87 Difference]: Start difference. First operand 2129 states and 3727 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:33,146 INFO L93 Difference]: Finished difference Result 3217 states and 5429 transitions. [2025-03-16 20:34:33,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:33,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:34:33,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:33,155 INFO L225 Difference]: With dead ends: 3217 [2025-03-16 20:34:33,155 INFO L226 Difference]: Without dead ends: 2649 [2025-03-16 20:34:33,156 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-03-16 20:34:33,156 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 1510 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:33,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1745 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:33,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2025-03-16 20:34:33,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 2647. [2025-03-16 20:34:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2647 states, 2645 states have (on average 1.7100189035916824) internal successors, (4523), 2646 states have internal predecessors, (4523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 4523 transitions. [2025-03-16 20:34:33,209 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 4523 transitions. Word has length 78 [2025-03-16 20:34:33,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:33,209 INFO L471 AbstractCegarLoop]: Abstraction has 2647 states and 4523 transitions. [2025-03-16 20:34:33,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:33,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 4523 transitions. [2025-03-16 20:34:33,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:33,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:33,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:34:33,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:34:33,210 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:33,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:33,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1799305303, now seen corresponding path program 1 times [2025-03-16 20:34:33,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:33,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722220820] [2025-03-16 20:34:33,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:33,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:33,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:33,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:33,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:33,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:34:33,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:33,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722220820] [2025-03-16 20:34:33,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722220820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:33,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:33,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:33,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202745060] [2025-03-16 20:34:33,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:33,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:33,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:33,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:33,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:33,256 INFO L87 Difference]: Start difference. First operand 2647 states and 4523 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:33,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:33,290 INFO L93 Difference]: Finished difference Result 4723 states and 7733 transitions. [2025-03-16 20:34:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:33,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:34:33,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:33,300 INFO L225 Difference]: With dead ends: 4723 [2025-03-16 20:34:33,300 INFO L226 Difference]: Without dead ends: 3637 [2025-03-16 20:34:33,303 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-03-16 20:34:33,304 INFO L435 NwaCegarLoop]: 1648 mSDtfsCounter, 1508 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:33,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1747 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:33,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2025-03-16 20:34:33,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3635. [2025-03-16 20:34:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3635 states, 3633 states have (on average 1.6567575006881365) internal successors, (6019), 3634 states have internal predecessors, (6019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 6019 transitions. [2025-03-16 20:34:33,368 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 6019 transitions. Word has length 78 [2025-03-16 20:34:33,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:33,368 INFO L471 AbstractCegarLoop]: Abstraction has 3635 states and 6019 transitions. [2025-03-16 20:34:33,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 6019 transitions. [2025-03-16 20:34:33,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:33,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:33,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:34:33,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:34:33,369 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:33,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:33,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1042264663, now seen corresponding path program 1 times [2025-03-16 20:34:33,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:33,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348335860] [2025-03-16 20:34:33,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:33,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:33,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:33,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:33,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:33,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:34:33,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:33,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348335860] [2025-03-16 20:34:33,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348335860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:33,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:33,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:33,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769992164] [2025-03-16 20:34:33,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:33,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:33,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:33,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:33,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:33,416 INFO L87 Difference]: Start difference. First operand 3635 states and 6019 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:33,468 INFO L93 Difference]: Finished difference Result 7591 states and 12053 transitions. [2025-03-16 20:34:33,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:33,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:34:33,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:33,483 INFO L225 Difference]: With dead ends: 7591 [2025-03-16 20:34:33,483 INFO L226 Difference]: Without dead ends: 5517 [2025-03-16 20:34:33,488 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-03-16 20:34:33,488 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 1504 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:33,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1743 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:33,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5517 states. [2025-03-16 20:34:33,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5517 to 5515. [2025-03-16 20:34:33,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5515 states, 5513 states have (on average 1.599673499002358) internal successors, (8819), 5514 states have internal predecessors, (8819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:33,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5515 states to 5515 states and 8819 transitions. [2025-03-16 20:34:33,613 INFO L78 Accepts]: Start accepts. Automaton has 5515 states and 8819 transitions. Word has length 78 [2025-03-16 20:34:33,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:33,613 INFO L471 AbstractCegarLoop]: Abstraction has 5515 states and 8819 transitions. [2025-03-16 20:34:33,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:33,614 INFO L276 IsEmpty]: Start isEmpty. Operand 5515 states and 8819 transitions. [2025-03-16 20:34:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:33,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:33,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:34:33,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:34:33,614 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:33,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:33,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1592053591, now seen corresponding path program 1 times [2025-03-16 20:34:33,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:33,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439831877] [2025-03-16 20:34:33,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:33,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:33,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:33,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:33,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:33,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:34:33,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:33,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439831877] [2025-03-16 20:34:33,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439831877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:33,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:33,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:33,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173134495] [2025-03-16 20:34:33,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:33,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:33,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:33,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:33,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:33,668 INFO L87 Difference]: Start difference. First operand 5515 states and 8819 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:33,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:33,749 INFO L93 Difference]: Finished difference Result 13039 states and 20117 transitions. [2025-03-16 20:34:33,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:33,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:34:33,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:33,770 INFO L225 Difference]: With dead ends: 13039 [2025-03-16 20:34:33,770 INFO L226 Difference]: Without dead ends: 9085 [2025-03-16 20:34:33,776 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-03-16 20:34:33,777 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 1502 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:33,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1745 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:33,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9085 states. [2025-03-16 20:34:33,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9085 to 9083. [2025-03-16 20:34:33,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9083 states, 9081 states have (on average 1.5455346327496973) internal successors, (14035), 9082 states have internal predecessors, (14035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9083 states to 9083 states and 14035 transitions. [2025-03-16 20:34:33,974 INFO L78 Accepts]: Start accepts. Automaton has 9083 states and 14035 transitions. Word has length 78 [2025-03-16 20:34:33,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:33,975 INFO L471 AbstractCegarLoop]: Abstraction has 9083 states and 14035 transitions. [2025-03-16 20:34:33,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 9083 states and 14035 transitions. [2025-03-16 20:34:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:33,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:33,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:34:33,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:34:33,977 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:33,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:33,977 INFO L85 PathProgramCache]: Analyzing trace with hash -976082263, now seen corresponding path program 1 times [2025-03-16 20:34:33,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:33,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138269522] [2025-03-16 20:34:33,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:33,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:33,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:33,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:33,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:33,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:34:34,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:34,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138269522] [2025-03-16 20:34:34,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138269522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:34,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:34,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:34,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418085004] [2025-03-16 20:34:34,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:34,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:34,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:34,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:34,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:34,033 INFO L87 Difference]: Start difference. First operand 9083 states and 14035 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:34,167 INFO L93 Difference]: Finished difference Result 23359 states and 35093 transitions. [2025-03-16 20:34:34,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:34,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:34:34,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:34,195 INFO L225 Difference]: With dead ends: 23359 [2025-03-16 20:34:34,196 INFO L226 Difference]: Without dead ends: 15837 [2025-03-16 20:34:34,208 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-03-16 20:34:34,208 INFO L435 NwaCegarLoop]: 1646 mSDtfsCounter, 1506 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:34,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1749 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:34,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15837 states. [2025-03-16 20:34:34,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15837 to 15835. [2025-03-16 20:34:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15835 states, 15833 states have (on average 1.4968104591675615) internal successors, (23699), 15834 states have internal predecessors, (23699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15835 states to 15835 states and 23699 transitions. [2025-03-16 20:34:34,618 INFO L78 Accepts]: Start accepts. Automaton has 15835 states and 23699 transitions. Word has length 78 [2025-03-16 20:34:34,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:34,618 INFO L471 AbstractCegarLoop]: Abstraction has 15835 states and 23699 transitions. [2025-03-16 20:34:34,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 15835 states and 23699 transitions. [2025-03-16 20:34:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 20:34:34,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:34,620 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:34:34,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:34:34,620 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:34,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:34,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1256930850, now seen corresponding path program 1 times [2025-03-16 20:34:34,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:34,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778791604] [2025-03-16 20:34:34,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:34,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:34,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:34:34,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:34:34,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:34,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:34:34,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:34,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778791604] [2025-03-16 20:34:34,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778791604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:34,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:34,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:34,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388454419] [2025-03-16 20:34:34,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:34,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:34:34,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:34,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:34:34,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:34:34,762 INFO L87 Difference]: Start difference. First operand 15835 states and 23699 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:38,910 INFO L93 Difference]: Finished difference Result 19592 states and 30589 transitions. [2025-03-16 20:34:38,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:34:38,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-16 20:34:38,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:38,940 INFO L225 Difference]: With dead ends: 19592 [2025-03-16 20:34:38,940 INFO L226 Difference]: Without dead ends: 18088 [2025-03-16 20:34:38,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:34:38,946 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 2456 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2456 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 6302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:38,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2456 Valid, 851 Invalid, 6302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-16 20:34:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18088 states. [2025-03-16 20:34:39,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18088 to 18088. [2025-03-16 20:34:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18088 states, 18086 states have (on average 1.4833572929337608) internal successors, (26828), 18087 states have internal predecessors, (26828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:39,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18088 states to 18088 states and 26828 transitions. [2025-03-16 20:34:39,248 INFO L78 Accepts]: Start accepts. Automaton has 18088 states and 26828 transitions. Word has length 88 [2025-03-16 20:34:39,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:39,248 INFO L471 AbstractCegarLoop]: Abstraction has 18088 states and 26828 transitions. [2025-03-16 20:34:39,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:39,249 INFO L276 IsEmpty]: Start isEmpty. Operand 18088 states and 26828 transitions. [2025-03-16 20:34:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 20:34:39,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:39,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:34:39,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:34:39,250 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:39,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:39,250 INFO L85 PathProgramCache]: Analyzing trace with hash 555648419, now seen corresponding path program 1 times [2025-03-16 20:34:39,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:39,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698740465] [2025-03-16 20:34:39,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:39,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:39,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 20:34:39,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 20:34:39,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:39,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 20:34:39,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:39,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698740465] [2025-03-16 20:34:39,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698740465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:39,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:39,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:34:39,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763084058] [2025-03-16 20:34:39,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:39,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:39,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:39,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:39,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:39,308 INFO L87 Difference]: Start difference. First operand 18088 states and 26828 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:41,574 INFO L93 Difference]: Finished difference Result 24849 states and 37880 transitions. [2025-03-16 20:34:41,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:41,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-16 20:34:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:41,604 INFO L225 Difference]: With dead ends: 24849 [2025-03-16 20:34:41,604 INFO L226 Difference]: Without dead ends: 21092 [2025-03-16 20:34:41,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-16 20:34:41,612 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 866 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:41,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 614 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 20:34:41,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21092 states. [2025-03-16 20:34:41,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21092 to 21092. [2025-03-16 20:34:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21092 states, 21090 states have (on average 1.4486486486486487) internal successors, (30552), 21091 states have internal predecessors, (30552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21092 states to 21092 states and 30552 transitions. [2025-03-16 20:34:42,042 INFO L78 Accepts]: Start accepts. Automaton has 21092 states and 30552 transitions. Word has length 90 [2025-03-16 20:34:42,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:42,042 INFO L471 AbstractCegarLoop]: Abstraction has 21092 states and 30552 transitions. [2025-03-16 20:34:42,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 21092 states and 30552 transitions. [2025-03-16 20:34:42,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:34:42,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:42,046 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:34:42,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:34:42,046 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:42,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:42,048 INFO L85 PathProgramCache]: Analyzing trace with hash -687087655, now seen corresponding path program 1 times [2025-03-16 20:34:42,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:42,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847319351] [2025-03-16 20:34:42,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:42,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:42,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:34:42,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:34:42,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:42,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:34:42,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:42,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847319351] [2025-03-16 20:34:42,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847319351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:42,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:42,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:42,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603208857] [2025-03-16 20:34:42,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:42,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:42,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:42,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:42,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:42,253 INFO L87 Difference]: Start difference. First operand 21092 states and 30552 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:43,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:43,679 INFO L93 Difference]: Finished difference Result 119604 states and 174496 transitions. [2025-03-16 20:34:43,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:34:43,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 20:34:43,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:43,834 INFO L225 Difference]: With dead ends: 119604 [2025-03-16 20:34:43,834 INFO L226 Difference]: Without dead ends: 109618 [2025-03-16 20:34:43,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:34:43,863 INFO L435 NwaCegarLoop]: 1664 mSDtfsCounter, 9845 mSDsluCounter, 2966 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9845 SdHoareTripleChecker+Valid, 4630 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:43,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9845 Valid, 4630 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:34:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109618 states. [2025-03-16 20:34:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109618 to 33252. [2025-03-16 20:34:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33252 states, 33250 states have (on average 1.4481804511278196) internal successors, (48152), 33251 states have internal predecessors, (48152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33252 states to 33252 states and 48152 transitions. [2025-03-16 20:34:44,864 INFO L78 Accepts]: Start accepts. Automaton has 33252 states and 48152 transitions. Word has length 100 [2025-03-16 20:34:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:44,864 INFO L471 AbstractCegarLoop]: Abstraction has 33252 states and 48152 transitions. [2025-03-16 20:34:44,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 33252 states and 48152 transitions. [2025-03-16 20:34:44,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:34:44,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:44,869 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:34:44,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:34:44,869 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:44,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:44,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1078395609, now seen corresponding path program 1 times [2025-03-16 20:34:44,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:44,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575287256] [2025-03-16 20:34:44,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:44,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:44,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:34:44,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:34:44,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:44,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:34:45,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:45,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575287256] [2025-03-16 20:34:45,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575287256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:45,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:45,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:45,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946803353] [2025-03-16 20:34:45,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:45,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:45,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:45,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:45,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:45,097 INFO L87 Difference]: Start difference. First operand 33252 states and 48152 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:47,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:47,206 INFO L93 Difference]: Finished difference Result 133876 states and 195232 transitions. [2025-03-16 20:34:47,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:34:47,206 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 20:34:47,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:47,369 INFO L225 Difference]: With dead ends: 133876 [2025-03-16 20:34:47,370 INFO L226 Difference]: Without dead ends: 119602 [2025-03-16 20:34:47,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:34:47,408 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 9847 mSDsluCounter, 2927 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9847 SdHoareTripleChecker+Valid, 4590 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:47,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9847 Valid, 4590 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:34:47,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119602 states. [2025-03-16 20:34:48,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119602 to 52516. [2025-03-16 20:34:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52516 states, 52514 states have (on average 1.4470807784590776) internal successors, (75992), 52515 states have internal predecessors, (75992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:49,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52516 states to 52516 states and 75992 transitions. [2025-03-16 20:34:49,069 INFO L78 Accepts]: Start accepts. Automaton has 52516 states and 75992 transitions. Word has length 100 [2025-03-16 20:34:49,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:49,070 INFO L471 AbstractCegarLoop]: Abstraction has 52516 states and 75992 transitions. [2025-03-16 20:34:49,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:49,070 INFO L276 IsEmpty]: Start isEmpty. Operand 52516 states and 75992 transitions. [2025-03-16 20:34:49,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:34:49,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:49,076 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:34:49,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:34:49,076 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:49,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:49,077 INFO L85 PathProgramCache]: Analyzing trace with hash -202447399, now seen corresponding path program 1 times [2025-03-16 20:34:49,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:49,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348247440] [2025-03-16 20:34:49,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:49,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:49,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:34:49,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:34:49,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:49,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:34:49,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:49,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348247440] [2025-03-16 20:34:49,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348247440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:49,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:49,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:49,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772863025] [2025-03-16 20:34:49,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:49,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:49,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:49,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:49,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:49,231 INFO L87 Difference]: Start difference. First operand 52516 states and 75992 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:51,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:51,744 INFO L93 Difference]: Finished difference Result 148148 states and 215904 transitions. [2025-03-16 20:34:51,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:34:51,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 20:34:51,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:51,926 INFO L225 Difference]: With dead ends: 148148 [2025-03-16 20:34:51,926 INFO L226 Difference]: Without dead ends: 133874 [2025-03-16 20:34:51,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:34:51,962 INFO L435 NwaCegarLoop]: 1661 mSDtfsCounter, 9866 mSDsluCounter, 2892 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9866 SdHoareTripleChecker+Valid, 4553 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:51,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9866 Valid, 4553 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:34:52,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133874 states. [2025-03-16 20:34:53,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133874 to 66788. [2025-03-16 20:34:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66788 states, 66786 states have (on average 1.447369209115683) internal successors, (96664), 66787 states have internal predecessors, (96664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66788 states to 66788 states and 96664 transitions. [2025-03-16 20:34:54,121 INFO L78 Accepts]: Start accepts. Automaton has 66788 states and 96664 transitions. Word has length 100 [2025-03-16 20:34:54,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:54,121 INFO L471 AbstractCegarLoop]: Abstraction has 66788 states and 96664 transitions. [2025-03-16 20:34:54,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 66788 states and 96664 transitions. [2025-03-16 20:34:54,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:34:54,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:54,127 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:34:54,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:34:54,127 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:54,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:54,128 INFO L85 PathProgramCache]: Analyzing trace with hash 640911577, now seen corresponding path program 1 times [2025-03-16 20:34:54,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:54,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118556928] [2025-03-16 20:34:54,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:54,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:54,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:34:54,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:34:54,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:54,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:34:54,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:54,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118556928] [2025-03-16 20:34:54,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118556928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:54,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:54,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:54,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648261547] [2025-03-16 20:34:54,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:54,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:54,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:54,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:54,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:54,290 INFO L87 Difference]: Start difference. First operand 66788 states and 96664 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:57,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:57,947 INFO L93 Difference]: Finished difference Result 162420 states and 236576 transitions. [2025-03-16 20:34:57,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:34:57,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 20:34:57,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:58,193 INFO L225 Difference]: With dead ends: 162420 [2025-03-16 20:34:58,193 INFO L226 Difference]: Without dead ends: 148146 [2025-03-16 20:34:58,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:34:58,241 INFO L435 NwaCegarLoop]: 1659 mSDtfsCounter, 9955 mSDsluCounter, 2810 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9955 SdHoareTripleChecker+Valid, 4469 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:58,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9955 Valid, 4469 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:34:58,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148146 states. [2025-03-16 20:35:00,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148146 to 81060. [2025-03-16 20:35:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81060 states, 81058 states have (on average 1.4475560709615338) internal successors, (117336), 81059 states have internal predecessors, (117336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81060 states to 81060 states and 117336 transitions. [2025-03-16 20:35:00,964 INFO L78 Accepts]: Start accepts. Automaton has 81060 states and 117336 transitions. Word has length 100 [2025-03-16 20:35:00,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:00,964 INFO L471 AbstractCegarLoop]: Abstraction has 81060 states and 117336 transitions. [2025-03-16 20:35:00,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 81060 states and 117336 transitions. [2025-03-16 20:35:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:35:00,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:00,970 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:35:00,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:35:00,970 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:00,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:00,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1397952217, now seen corresponding path program 1 times [2025-03-16 20:35:00,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:00,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646200602] [2025-03-16 20:35:00,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:00,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:00,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:35:00,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:35:00,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:00,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 20:35:01,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:01,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646200602] [2025-03-16 20:35:01,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646200602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:01,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:01,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:35:01,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253289048] [2025-03-16 20:35:01,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:01,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:35:01,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:01,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:35:01,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:35:01,111 INFO L87 Difference]: Start difference. First operand 81060 states and 117336 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:04,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:04,069 INFO L93 Difference]: Finished difference Result 176692 states and 257248 transitions. [2025-03-16 20:35:04,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:35:04,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 20:35:04,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:04,259 INFO L225 Difference]: With dead ends: 176692 [2025-03-16 20:35:04,259 INFO L226 Difference]: Without dead ends: 162418 [2025-03-16 20:35:04,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:35:04,294 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 10036 mSDsluCounter, 2872 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10036 SdHoareTripleChecker+Valid, 4529 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:04,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10036 Valid, 4529 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:35:04,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162418 states. [2025-03-16 20:35:07,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162418 to 95332. [2025-03-16 20:35:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95332 states, 95330 states have (on average 1.44768698206231) internal successors, (138008), 95331 states have internal predecessors, (138008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95332 states to 95332 states and 138008 transitions. [2025-03-16 20:35:07,819 INFO L78 Accepts]: Start accepts. Automaton has 95332 states and 138008 transitions. Word has length 100 [2025-03-16 20:35:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:07,820 INFO L471 AbstractCegarLoop]: Abstraction has 95332 states and 138008 transitions. [2025-03-16 20:35:07,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 95332 states and 138008 transitions. [2025-03-16 20:35:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:35:07,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:07,826 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:35:07,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 20:35:07,826 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:07,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:07,826 INFO L85 PathProgramCache]: Analyzing trace with hash 848163289, now seen corresponding path program 1 times [2025-03-16 20:35:07,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:07,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392247971] [2025-03-16 20:35:07,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:07,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:07,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:35:07,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:35:07,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:07,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:07,996 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:35:07,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:07,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392247971] [2025-03-16 20:35:07,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392247971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:07,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:07,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:35:07,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781387652] [2025-03-16 20:35:07,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:07,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:35:07,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:07,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:35:07,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:35:07,997 INFO L87 Difference]: Start difference. First operand 95332 states and 138008 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)