./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.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.8.ufo.UNBOUNDED.pals+Problem12_label06.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 6d316a7ba22efd80f1b38cf51bd9ff0ce90b0827d98cb289348ffc09e69061f8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:37:26,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:37:26,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:37:27,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:37:27,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:37:27,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:37:27,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:37:27,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:37:27,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:37:27,020 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:37:27,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:37:27,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:37:27,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:37:27,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:37:27,020 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:37:27,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:37:27,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:37:27,020 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:37:27,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:37:27,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:37:27,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:37:27,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:37:27,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:37:27,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:37:27,021 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:37:27,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:37:27,021 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:37:27,021 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:37:27,021 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:37:27,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:37:27,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:37:27,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:37:27,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:37:27,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:37:27,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:37:27,022 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:37:27,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:37:27,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:37:27,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:37:27,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:37:27,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:37:27,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:37:27,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:37:27,023 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 -> 6d316a7ba22efd80f1b38cf51bd9ff0ce90b0827d98cb289348ffc09e69061f8 [2025-03-16 20:37:27,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:37:27,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:37:27,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:37:27,252 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:37:27,252 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:37:27,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c [2025-03-16 20:37:28,428 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1bc946d0/0cb1b63cb7b641189cd87afe39191394/FLAG2d998becb [2025-03-16 20:37:28,952 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:37:28,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c [2025-03-16 20:37:28,982 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1bc946d0/0cb1b63cb7b641189cd87afe39191394/FLAG2d998becb [2025-03-16 20:37:28,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1bc946d0/0cb1b63cb7b641189cd87afe39191394 [2025-03-16 20:37:28,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:37:29,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:37:29,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:37:29,003 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:37:29,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:37:29,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:37:28" (1/1) ... [2025-03-16 20:37:29,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d5b8a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:29, skipping insertion in model container [2025-03-16 20:37:29,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:37:28" (1/1) ... [2025-03-16 20:37:29,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:37:29,432 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.8.ufo.UNBOUNDED.pals+Problem12_label06.c[26888,26901] [2025-03-16 20:37:29,471 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.8.ufo.UNBOUNDED.pals+Problem12_label06.c[29705,29718] [2025-03-16 20:37:29,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:37:29,892 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:37:29,921 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.8.ufo.UNBOUNDED.pals+Problem12_label06.c[26888,26901] [2025-03-16 20:37:29,927 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.8.ufo.UNBOUNDED.pals+Problem12_label06.c[29705,29718] [2025-03-16 20:37:30,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:37:30,194 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:37:30,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:30 WrapperNode [2025-03-16 20:37:30,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:37:30,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:37:30,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:37:30,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:37:30,202 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:37:30" (1/1) ... [2025-03-16 20:37:30,234 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:37:30" (1/1) ... [2025-03-16 20:37:30,502 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5285 [2025-03-16 20:37:30,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:37:30,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:37:30,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:37:30,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:37:30,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:30" (1/1) ... [2025-03-16 20:37:30,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:30" (1/1) ... [2025-03-16 20:37:30,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:30" (1/1) ... [2025-03-16 20:37:30,673 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:37:30,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:30" (1/1) ... [2025-03-16 20:37:30,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:30" (1/1) ... [2025-03-16 20:37:30,831 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:30" (1/1) ... [2025-03-16 20:37:30,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:30" (1/1) ... [2025-03-16 20:37:30,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:30" (1/1) ... [2025-03-16 20:37:30,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:30" (1/1) ... [2025-03-16 20:37:30,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:37:30,916 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:37:30,916 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:37:30,916 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:37:30,917 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:30" (1/1) ... [2025-03-16 20:37:30,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:37:30,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:37:30,941 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:37:30,945 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:37:30,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:37:30,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:37:30,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:37:30,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:37:31,072 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:37:31,074 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:37:34,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375: havoc calculate_output_#t~ret49#1; [2025-03-16 20:37:34,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3854: havoc calculate_output2_#t~ret50#1; [2025-03-16 20:37:34,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5344: havoc calculate_output3_#t~ret51#1; [2025-03-16 20:37:34,377 INFO L? ?]: Removed 755 outVars from TransFormulas that were not future-live. [2025-03-16 20:37:34,377 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:37:34,404 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:37:34,404 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:37:34,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:37:34 BoogieIcfgContainer [2025-03-16 20:37:34,407 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:37:34,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:37:34,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:37:34,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:37:34,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:37:28" (1/3) ... [2025-03-16 20:37:34,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bfcba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:37:34, skipping insertion in model container [2025-03-16 20:37:34,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:30" (2/3) ... [2025-03-16 20:37:34,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bfcba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:37:34, skipping insertion in model container [2025-03-16 20:37:34,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:37:34" (3/3) ... [2025-03-16 20:37:34,417 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c [2025-03-16 20:37:34,427 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:37:34,430 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c that has 1 procedures, 884 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:37:34,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:37:34,511 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;@642d4e55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:37:34,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:37:34,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 881 states have (on average 1.9670828603859252) internal successors, (1733), 883 states have internal predecessors, (1733), 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:37:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 20:37:34,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:34,524 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] [2025-03-16 20:37:34,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:34,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:34,528 INFO L85 PathProgramCache]: Analyzing trace with hash -523118104, now seen corresponding path program 1 times [2025-03-16 20:37:34,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:34,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438249821] [2025-03-16 20:37:34,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:34,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:34,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 20:37:34,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 20:37:34,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:34,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:34,696 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:37:34,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:34,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438249821] [2025-03-16 20:37:34,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438249821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:34,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:34,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:37:34,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502665814] [2025-03-16 20:37:34,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:34,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:37:34,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:34,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:37:34,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:37:34,719 INFO L87 Difference]: Start difference. First operand has 884 states, 881 states have (on average 1.9670828603859252) internal successors, (1733), 883 states have internal predecessors, (1733), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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:37:34,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:34,782 INFO L93 Difference]: Finished difference Result 1703 states and 3338 transitions. [2025-03-16 20:37:34,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:37:34,788 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 23 [2025-03-16 20:37:34,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:34,799 INFO L225 Difference]: With dead ends: 1703 [2025-03-16 20:37:34,799 INFO L226 Difference]: Without dead ends: 880 [2025-03-16 20:37:34,802 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:37:34,804 INFO L435 NwaCegarLoop]: 1668 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, 1668 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:37:34,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:34,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-16 20:37:34,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2025-03-16 20:37:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 1.8952164009111618) internal successors, (1664), 879 states have internal predecessors, (1664), 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:37:34,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1664 transitions. [2025-03-16 20:37:34,859 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1664 transitions. Word has length 23 [2025-03-16 20:37:34,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:34,859 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1664 transitions. [2025-03-16 20:37:34,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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:37:34,859 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1664 transitions. [2025-03-16 20:37:34,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 20:37:34,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:34,860 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] [2025-03-16 20:37:34,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:37:34,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:34,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:34,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1825235799, now seen corresponding path program 1 times [2025-03-16 20:37:34,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:34,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526939946] [2025-03-16 20:37:34,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:34,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:34,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 20:37:34,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 20:37:34,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:34,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:35,024 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:37:35,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:35,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526939946] [2025-03-16 20:37:35,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526939946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:35,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:35,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:37:35,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856263201] [2025-03-16 20:37:35,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:35,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:35,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:35,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:35,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:35,027 INFO L87 Difference]: Start difference. First operand 880 states and 1664 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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:37:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:37,589 INFO L93 Difference]: Finished difference Result 2384 states and 4537 transitions. [2025-03-16 20:37:37,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:37,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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 23 [2025-03-16 20:37:37,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:37,596 INFO L225 Difference]: With dead ends: 2384 [2025-03-16 20:37:37,596 INFO L226 Difference]: Without dead ends: 1631 [2025-03-16 20:37:37,597 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:37:37,598 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 1020 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:37,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 653 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 20:37:37,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2025-03-16 20:37:37,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2025-03-16 20:37:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.6519337016574585) internal successors, (2691), 1630 states have internal predecessors, (2691), 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:37:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2691 transitions. [2025-03-16 20:37:37,650 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2691 transitions. Word has length 23 [2025-03-16 20:37:37,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:37,653 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2691 transitions. [2025-03-16 20:37:37,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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:37:37,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2691 transitions. [2025-03-16 20:37:37,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 20:37:37,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:37,654 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] [2025-03-16 20:37:37,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:37:37,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:37,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:37,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1205179400, now seen corresponding path program 1 times [2025-03-16 20:37:37,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:37,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751029799] [2025-03-16 20:37:37,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:37,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:37,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 20:37:37,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 20:37:37,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:37,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:37,884 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:37:37,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:37,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751029799] [2025-03-16 20:37:37,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751029799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:37,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:37,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:37:37,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089796750] [2025-03-16 20:37:37,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:37,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:37:37,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:37,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:37:37,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:37:37,887 INFO L87 Difference]: Start difference. First operand 1631 states and 2691 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:37:37,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:37,948 INFO L93 Difference]: Finished difference Result 1695 states and 2793 transitions. [2025-03-16 20:37:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:37:37,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2025-03-16 20:37:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:37,955 INFO L225 Difference]: With dead ends: 1695 [2025-03-16 20:37:37,955 INFO L226 Difference]: Without dead ends: 1631 [2025-03-16 20:37:37,956 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:37:37,958 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 0 mSDsluCounter, 3261 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4924 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:37,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4924 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:37,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2025-03-16 20:37:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2025-03-16 20:37:37,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.614487415592388) internal successors, (2630), 1630 states have internal predecessors, (2630), 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:37:37,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2630 transitions. [2025-03-16 20:37:37,993 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2630 transitions. Word has length 27 [2025-03-16 20:37:37,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:37,993 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2630 transitions. [2025-03-16 20:37:37,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:37:37,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2630 transitions. [2025-03-16 20:37:37,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 20:37:37,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:37,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:37,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:37:37,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:37,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:38,001 INFO L85 PathProgramCache]: Analyzing trace with hash 113676108, now seen corresponding path program 1 times [2025-03-16 20:37:38,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:38,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510072493] [2025-03-16 20:37:38,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:38,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:38,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:37:38,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:37:38,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:38,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:38,337 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:37:38,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:38,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510072493] [2025-03-16 20:37:38,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510072493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:38,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:38,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:37:38,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040148928] [2025-03-16 20:37:38,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:38,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:37:38,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:38,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:37:38,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:37:38,340 INFO L87 Difference]: Start difference. First operand 1631 states and 2630 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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) [2025-03-16 20:37:38,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:38,791 INFO L93 Difference]: Finished difference Result 2607 states and 4214 transitions. [2025-03-16 20:37:38,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 20:37:38,791 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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) Word has length 87 [2025-03-16 20:37:38,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:38,800 INFO L225 Difference]: With dead ends: 2607 [2025-03-16 20:37:38,800 INFO L226 Difference]: Without dead ends: 2546 [2025-03-16 20:37:38,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-03-16 20:37:38,803 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 13460 mSDsluCounter, 4332 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13460 SdHoareTripleChecker+Valid, 5929 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:38,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13460 Valid, 5929 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:37:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2025-03-16 20:37:38,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 1690. [2025-03-16 20:37:38,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1688 states have (on average 1.6149289099526067) internal successors, (2726), 1689 states have internal predecessors, (2726), 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:37:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2726 transitions. [2025-03-16 20:37:38,836 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2726 transitions. Word has length 87 [2025-03-16 20:37:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:38,837 INFO L471 AbstractCegarLoop]: Abstraction has 1690 states and 2726 transitions. [2025-03-16 20:37:38,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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) [2025-03-16 20:37:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2726 transitions. [2025-03-16 20:37:38,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:37:38,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:38,840 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:38,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:37:38,840 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:38,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:38,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1905739598, now seen corresponding path program 1 times [2025-03-16 20:37:38,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:38,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256618412] [2025-03-16 20:37:38,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:38,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:38,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:37:38,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:37:38,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:38,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:39,300 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:37:39,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:39,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256618412] [2025-03-16 20:37:39,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256618412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:39,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:39,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:37:39,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039930769] [2025-03-16 20:37:39,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:39,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:37:39,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:39,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:37:39,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:37:39,302 INFO L87 Difference]: Start difference. First operand 1690 states and 2726 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 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:37:39,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:39,645 INFO L93 Difference]: Finished difference Result 1812 states and 2922 transitions. [2025-03-16 20:37:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:37:39,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 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 89 [2025-03-16 20:37:39,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:39,651 INFO L225 Difference]: With dead ends: 1812 [2025-03-16 20:37:39,652 INFO L226 Difference]: Without dead ends: 1692 [2025-03-16 20:37:39,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-16 20:37:39,653 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 7619 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7619 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:39,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7619 Valid, 2268 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:37:39,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2025-03-16 20:37:39,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1690. [2025-03-16 20:37:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1688 states have (on average 1.6143364928909953) internal successors, (2725), 1689 states have internal predecessors, (2725), 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:37:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2725 transitions. [2025-03-16 20:37:39,684 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2725 transitions. Word has length 89 [2025-03-16 20:37:39,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:39,686 INFO L471 AbstractCegarLoop]: Abstraction has 1690 states and 2725 transitions. [2025-03-16 20:37:39,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 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:37:39,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2725 transitions. [2025-03-16 20:37:39,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:37:39,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:39,687 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:39,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:37:39,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:39,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:39,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1904696913, now seen corresponding path program 1 times [2025-03-16 20:37:39,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:39,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484631187] [2025-03-16 20:37:39,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:39,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:39,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:37:39,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:37:39,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:39,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:39,792 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:37:39,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:39,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484631187] [2025-03-16 20:37:39,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484631187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:39,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:39,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:39,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690294276] [2025-03-16 20:37:39,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:39,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:39,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:39,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:39,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:39,794 INFO L87 Difference]: Start difference. First operand 1690 states and 2725 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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:37:39,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:39,830 INFO L93 Difference]: Finished difference Result 1919 states and 3094 transitions. [2025-03-16 20:37:39,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:39,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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 89 [2025-03-16 20:37:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:39,837 INFO L225 Difference]: With dead ends: 1919 [2025-03-16 20:37:39,837 INFO L226 Difference]: Without dead ends: 1799 [2025-03-16 20:37:39,838 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:37:39,839 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 1506 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:39,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1691 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:39,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2025-03-16 20:37:39,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1795. [2025-03-16 20:37:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1793 states have (on average 1.6129392080312326) internal successors, (2892), 1794 states have internal predecessors, (2892), 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:37:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2892 transitions. [2025-03-16 20:37:39,871 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2892 transitions. Word has length 89 [2025-03-16 20:37:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:39,871 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2892 transitions. [2025-03-16 20:37:39,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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:37:39,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2892 transitions. [2025-03-16 20:37:39,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 20:37:39,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:39,872 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:39,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:37:39,873 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:39,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:39,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1050629546, now seen corresponding path program 1 times [2025-03-16 20:37:39,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:39,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98278896] [2025-03-16 20:37:39,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:39,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:39,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 20:37:39,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 20:37:39,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:39,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:40,223 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:37:40,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:40,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98278896] [2025-03-16 20:37:40,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98278896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:40,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:40,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:37:40,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122671250] [2025-03-16 20:37:40,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:40,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:37:40,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:40,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:37:40,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:37:40,225 INFO L87 Difference]: Start difference. First operand 1795 states and 2892 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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:37:40,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:40,272 INFO L93 Difference]: Finished difference Result 1801 states and 2899 transitions. [2025-03-16 20:37:40,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:37:40,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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:37:40,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:40,278 INFO L225 Difference]: With dead ends: 1801 [2025-03-16 20:37:40,278 INFO L226 Difference]: Without dead ends: 1799 [2025-03-16 20:37:40,278 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:37:40,279 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 0 mSDsluCounter, 6385 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7984 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:37:40,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7984 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:40,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2025-03-16 20:37:40,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2025-03-16 20:37:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1797 states have (on average 1.6110183639398998) internal successors, (2895), 1798 states have internal predecessors, (2895), 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:37:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2895 transitions. [2025-03-16 20:37:40,315 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2895 transitions. Word has length 90 [2025-03-16 20:37:40,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:40,315 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2895 transitions. [2025-03-16 20:37:40,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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:37:40,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2895 transitions. [2025-03-16 20:37:40,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:40,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:40,316 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:40,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:37:40,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:40,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:40,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1274985008, now seen corresponding path program 1 times [2025-03-16 20:37:40,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:40,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497590966] [2025-03-16 20:37:40,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:40,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:40,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:40,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:40,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:40,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:40,391 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:37:40,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:40,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497590966] [2025-03-16 20:37:40,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497590966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:40,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:40,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:40,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014179921] [2025-03-16 20:37:40,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:40,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:40,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:40,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:40,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:40,392 INFO L87 Difference]: Start difference. First operand 1799 states and 2895 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:37:40,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:40,424 INFO L93 Difference]: Finished difference Result 2241 states and 3595 transitions. [2025-03-16 20:37:40,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:40,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:37:40,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:40,430 INFO L225 Difference]: With dead ends: 2241 [2025-03-16 20:37:40,430 INFO L226 Difference]: Without dead ends: 2012 [2025-03-16 20:37:40,432 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:37:40,432 INFO L435 NwaCegarLoop]: 1679 mSDtfsCounter, 1525 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1783 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:37:40,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1783 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2025-03-16 20:37:40,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 2010. [2025-03-16 20:37:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 2008 states have (on average 1.6065737051792828) internal successors, (3226), 2009 states have internal predecessors, (3226), 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:37:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 3226 transitions. [2025-03-16 20:37:40,467 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 3226 transitions. Word has length 91 [2025-03-16 20:37:40,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:40,468 INFO L471 AbstractCegarLoop]: Abstraction has 2010 states and 3226 transitions. [2025-03-16 20:37:40,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:37:40,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 3226 transitions. [2025-03-16 20:37:40,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:40,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:40,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:40,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:37:40,473 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:40,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:40,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1254499024, now seen corresponding path program 1 times [2025-03-16 20:37:40,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:40,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840473217] [2025-03-16 20:37:40,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:40,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:40,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:40,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:40,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:40,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:40,546 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:37:40,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:40,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840473217] [2025-03-16 20:37:40,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840473217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:40,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:40,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:40,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820806249] [2025-03-16 20:37:40,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:40,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:40,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:40,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:40,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:40,548 INFO L87 Difference]: Start difference. First operand 2010 states and 3226 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:37:40,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:40,580 INFO L93 Difference]: Finished difference Result 2858 states and 4560 transitions. [2025-03-16 20:37:40,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:40,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:37:40,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:40,587 INFO L225 Difference]: With dead ends: 2858 [2025-03-16 20:37:40,587 INFO L226 Difference]: Without dead ends: 2418 [2025-03-16 20:37:40,588 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:37:40,590 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 1523 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1785 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:37:40,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1785 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:40,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2025-03-16 20:37:40,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2416. [2025-03-16 20:37:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 2414 states have (on average 1.5973487986743993) internal successors, (3856), 2415 states have internal predecessors, (3856), 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:37:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3856 transitions. [2025-03-16 20:37:40,628 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3856 transitions. Word has length 91 [2025-03-16 20:37:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:40,628 INFO L471 AbstractCegarLoop]: Abstraction has 2416 states and 3856 transitions. [2025-03-16 20:37:40,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:37:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3856 transitions. [2025-03-16 20:37:40,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:40,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:40,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:40,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:37:40,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:40,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:40,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1759625264, now seen corresponding path program 1 times [2025-03-16 20:37:40,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:40,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820573304] [2025-03-16 20:37:40,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:40,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:40,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:40,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:40,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:40,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:40,695 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:37:40,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:40,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820573304] [2025-03-16 20:37:40,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820573304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:40,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:40,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:40,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975657142] [2025-03-16 20:37:40,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:40,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:40,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:40,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:40,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:40,697 INFO L87 Difference]: Start difference. First operand 2416 states and 3856 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:37:40,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:40,730 INFO L93 Difference]: Finished difference Result 4044 states and 6394 transitions. [2025-03-16 20:37:40,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:40,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:37:40,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:40,739 INFO L225 Difference]: With dead ends: 4044 [2025-03-16 20:37:40,739 INFO L226 Difference]: Without dead ends: 3198 [2025-03-16 20:37:40,741 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:37:40,741 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 1521 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1787 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:37:40,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1787 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:40,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3198 states. [2025-03-16 20:37:40,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3198 to 3196. [2025-03-16 20:37:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3196 states, 3194 states have (on average 1.5817157169693175) internal successors, (5052), 3195 states have internal predecessors, (5052), 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:37:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 5052 transitions. [2025-03-16 20:37:40,796 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 5052 transitions. Word has length 91 [2025-03-16 20:37:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:40,796 INFO L471 AbstractCegarLoop]: Abstraction has 3196 states and 5052 transitions. [2025-03-16 20:37:40,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:37:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 5052 transitions. [2025-03-16 20:37:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:40,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:40,798 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:40,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:37:40,798 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:40,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:40,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1691983056, now seen corresponding path program 1 times [2025-03-16 20:37:40,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:40,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006861986] [2025-03-16 20:37:40,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:40,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:40,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:40,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:40,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:40,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:40,860 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:37:40,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:40,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006861986] [2025-03-16 20:37:40,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006861986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:40,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:40,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:40,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706016438] [2025-03-16 20:37:40,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:40,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:40,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:40,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:40,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:40,862 INFO L87 Difference]: Start difference. First operand 3196 states and 5052 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:37:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:40,917 INFO L93 Difference]: Finished difference Result 6320 states and 9870 transitions. [2025-03-16 20:37:40,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:40,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:37:40,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:40,939 INFO L225 Difference]: With dead ends: 6320 [2025-03-16 20:37:40,942 INFO L226 Difference]: Without dead ends: 4694 [2025-03-16 20:37:40,946 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:37:40,946 INFO L435 NwaCegarLoop]: 1673 mSDtfsCounter, 1519 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1789 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:37:40,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:40,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4694 states. [2025-03-16 20:37:41,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4694 to 4692. [2025-03-16 20:37:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4692 states, 4690 states have (on average 1.5599147121535182) internal successors, (7316), 4691 states have internal predecessors, (7316), 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:37:41,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4692 states to 4692 states and 7316 transitions. [2025-03-16 20:37:41,088 INFO L78 Accepts]: Start accepts. Automaton has 4692 states and 7316 transitions. Word has length 91 [2025-03-16 20:37:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:41,088 INFO L471 AbstractCegarLoop]: Abstraction has 4692 states and 7316 transitions. [2025-03-16 20:37:41,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:37:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 4692 states and 7316 transitions. [2025-03-16 20:37:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:41,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:41,089 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:41,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:37:41,089 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:41,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:41,089 INFO L85 PathProgramCache]: Analyzing trace with hash -934942416, now seen corresponding path program 1 times [2025-03-16 20:37:41,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:41,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994195478] [2025-03-16 20:37:41,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:41,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:41,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:41,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:41,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:41,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:41,148 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:37:41,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:41,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994195478] [2025-03-16 20:37:41,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994195478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:41,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:41,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:41,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125298092] [2025-03-16 20:37:41,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:41,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:41,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:41,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:41,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:41,149 INFO L87 Difference]: Start difference. First operand 4692 states and 7316 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:37:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:41,233 INFO L93 Difference]: Finished difference Result 10680 states and 16438 transitions. [2025-03-16 20:37:41,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:41,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:37:41,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:41,247 INFO L225 Difference]: With dead ends: 10680 [2025-03-16 20:37:41,247 INFO L226 Difference]: Without dead ends: 7558 [2025-03-16 20:37:41,253 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:37:41,253 INFO L435 NwaCegarLoop]: 1661 mSDtfsCounter, 1515 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1785 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:37:41,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1785 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2025-03-16 20:37:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 7556. [2025-03-16 20:37:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7556 states, 7554 states have (on average 1.5340217103521314) internal successors, (11588), 7555 states have internal predecessors, (11588), 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:37:41,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7556 states to 7556 states and 11588 transitions. [2025-03-16 20:37:41,409 INFO L78 Accepts]: Start accepts. Automaton has 7556 states and 11588 transitions. Word has length 91 [2025-03-16 20:37:41,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:41,409 INFO L471 AbstractCegarLoop]: Abstraction has 7556 states and 11588 transitions. [2025-03-16 20:37:41,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:37:41,410 INFO L276 IsEmpty]: Start isEmpty. Operand 7556 states and 11588 transitions. [2025-03-16 20:37:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:41,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:41,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:41,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:37:41,411 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:41,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:41,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1484731344, now seen corresponding path program 1 times [2025-03-16 20:37:41,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:41,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001875058] [2025-03-16 20:37:41,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:41,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:41,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:41,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:41,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:41,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:41,470 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:37:41,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:41,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001875058] [2025-03-16 20:37:41,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001875058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:41,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:41,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:41,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756906791] [2025-03-16 20:37:41,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:41,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:41,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:41,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:41,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:41,472 INFO L87 Difference]: Start difference. First operand 7556 states and 11588 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:37:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:41,605 INFO L93 Difference]: Finished difference Result 19016 states and 28806 transitions. [2025-03-16 20:37:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:41,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:37:41,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:41,629 INFO L225 Difference]: With dead ends: 19016 [2025-03-16 20:37:41,630 INFO L226 Difference]: Without dead ends: 13030 [2025-03-16 20:37:41,639 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:37:41,640 INFO L435 NwaCegarLoop]: 1659 mSDtfsCounter, 1513 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1787 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:37:41,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1787 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:41,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13030 states. [2025-03-16 20:37:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13030 to 13028. [2025-03-16 20:37:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13028 states, 13026 states have (on average 1.506218332565638) internal successors, (19620), 13027 states have internal predecessors, (19620), 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:37:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13028 states to 13028 states and 19620 transitions. [2025-03-16 20:37:41,934 INFO L78 Accepts]: Start accepts. Automaton has 13028 states and 19620 transitions. Word has length 91 [2025-03-16 20:37:41,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:41,934 INFO L471 AbstractCegarLoop]: Abstraction has 13028 states and 19620 transitions. [2025-03-16 20:37:41,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:37:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand 13028 states and 19620 transitions. [2025-03-16 20:37:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:41,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:41,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:41,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:37:41,936 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:41,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:41,936 INFO L85 PathProgramCache]: Analyzing trace with hash -868760016, now seen corresponding path program 1 times [2025-03-16 20:37:41,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:41,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387346429] [2025-03-16 20:37:41,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:41,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:41,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:41,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:41,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:41,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:41,995 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:37:41,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:41,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387346429] [2025-03-16 20:37:41,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387346429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:41,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:41,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:41,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280453157] [2025-03-16 20:37:41,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:41,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:41,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:41,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:41,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:41,997 INFO L87 Difference]: Start difference. First operand 13028 states and 19620 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:37:42,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:42,260 INFO L93 Difference]: Finished difference Result 34920 states and 52006 transitions. [2025-03-16 20:37:42,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:42,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:37:42,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:42,301 INFO L225 Difference]: With dead ends: 34920 [2025-03-16 20:37:42,302 INFO L226 Difference]: Without dead ends: 23462 [2025-03-16 20:37:42,319 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:37:42,319 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 1517 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1791 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:37:42,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1791 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:42,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23462 states. [2025-03-16 20:37:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23462 to 23460. [2025-03-16 20:37:42,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23460 states, 23458 states have (on average 1.477534316651036) internal successors, (34660), 23459 states have internal predecessors, (34660), 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:37:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23460 states to 23460 states and 34660 transitions. [2025-03-16 20:37:42,856 INFO L78 Accepts]: Start accepts. Automaton has 23460 states and 34660 transitions. Word has length 91 [2025-03-16 20:37:42,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:42,856 INFO L471 AbstractCegarLoop]: Abstraction has 23460 states and 34660 transitions. [2025-03-16 20:37:42,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:37:42,856 INFO L276 IsEmpty]: Start isEmpty. Operand 23460 states and 34660 transitions. [2025-03-16 20:37:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 20:37:42,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:42,857 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:42,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:37:42,857 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:42,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:42,857 INFO L85 PathProgramCache]: Analyzing trace with hash -164853808, now seen corresponding path program 1 times [2025-03-16 20:37:42,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:42,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168492280] [2025-03-16 20:37:42,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:42,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:42,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 20:37:42,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 20:37:42,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:42,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:42,916 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:37:42,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:42,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168492280] [2025-03-16 20:37:42,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168492280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:42,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:42,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:42,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337875591] [2025-03-16 20:37:42,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:42,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:42,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:42,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:42,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:42,918 INFO L87 Difference]: Start difference. First operand 23460 states and 34660 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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:37:43,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:43,372 INFO L93 Difference]: Finished difference Result 45995 states and 68202 transitions. [2025-03-16 20:37:43,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:43,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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 93 [2025-03-16 20:37:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:43,436 INFO L225 Difference]: With dead ends: 45995 [2025-03-16 20:37:43,436 INFO L226 Difference]: Without dead ends: 33960 [2025-03-16 20:37:43,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:43,458 INFO L435 NwaCegarLoop]: 1684 mSDtfsCounter, 1524 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1784 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:37:43,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1784 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33960 states. [2025-03-16 20:37:44,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33960 to 33958. [2025-03-16 20:37:44,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33958 states, 33956 states have (on average 1.4693721286370598) internal successors, (49894), 33957 states have internal predecessors, (49894), 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:37:44,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33958 states to 33958 states and 49894 transitions. [2025-03-16 20:37:44,272 INFO L78 Accepts]: Start accepts. Automaton has 33958 states and 49894 transitions. Word has length 93 [2025-03-16 20:37:44,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:44,272 INFO L471 AbstractCegarLoop]: Abstraction has 33958 states and 49894 transitions. [2025-03-16 20:37:44,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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:37:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 33958 states and 49894 transitions. [2025-03-16 20:37:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 20:37:44,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:44,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-03-16 20:37:44,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:37:44,273 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:44,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:44,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1982644415, now seen corresponding path program 1 times [2025-03-16 20:37:44,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:44,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366169493] [2025-03-16 20:37:44,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:44,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:44,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 20:37:44,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 20:37:44,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:44,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:44,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:44,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366169493] [2025-03-16 20:37:44,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366169493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:37:44,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929176603] [2025-03-16 20:37:44,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:44,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:37:44,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:37:44,475 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:37:44,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 20:37:44,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 20:37:44,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 20:37:44,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:44,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:44,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:37:44,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:37:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:44,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:37:44,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929176603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:44,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:37:44,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 20:37:44,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759419727] [2025-03-16 20:37:44,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:44,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:44,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:44,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:44,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:37:44,617 INFO L87 Difference]: Start difference. First operand 33958 states and 49894 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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:37:47,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:47,119 INFO L93 Difference]: Finished difference Result 36964 states and 54821 transitions. [2025-03-16 20:37:47,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:47,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2025-03-16 20:37:47,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:47,168 INFO L225 Difference]: With dead ends: 36964 [2025-03-16 20:37:47,168 INFO L226 Difference]: Without dead ends: 35460 [2025-03-16 20:37:47,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:37:47,182 INFO L435 NwaCegarLoop]: 1313 mSDtfsCounter, 745 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:47,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1485 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 20:37:47,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35460 states. [2025-03-16 20:37:47,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35460 to 35460. [2025-03-16 20:37:47,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35460 states, 35458 states have (on average 1.4679338936206217) internal successors, (52050), 35459 states have internal predecessors, (52050), 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:37:47,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35460 states to 35460 states and 52050 transitions. [2025-03-16 20:37:47,797 INFO L78 Accepts]: Start accepts. Automaton has 35460 states and 52050 transitions. Word has length 94 [2025-03-16 20:37:47,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:47,797 INFO L471 AbstractCegarLoop]: Abstraction has 35460 states and 52050 transitions. [2025-03-16 20:37:47,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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:37:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand 35460 states and 52050 transitions. [2025-03-16 20:37:47,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 20:37:47,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:47,798 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-03-16 20:37:47,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 20:37:47,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 20:37:47,999 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:47,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:48,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1378564066, now seen corresponding path program 1 times [2025-03-16 20:37:48,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:48,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669321239] [2025-03-16 20:37:48,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:48,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:48,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 20:37:48,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 20:37:48,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:48,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:48,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:48,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669321239] [2025-03-16 20:37:48,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669321239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:48,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:48,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:37:48,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24662288] [2025-03-16 20:37:48,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:48,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:48,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:48,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:48,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:48,080 INFO L87 Difference]: Start difference. First operand 35460 states and 52050 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 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:37:50,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:50,466 INFO L93 Difference]: Finished difference Result 41470 states and 61289 transitions. [2025-03-16 20:37:50,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:50,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 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 97 [2025-03-16 20:37:50,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:50,520 INFO L225 Difference]: With dead ends: 41470 [2025-03-16 20:37:50,520 INFO L226 Difference]: Without dead ends: 38464 [2025-03-16 20:37:50,529 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:37:50,529 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 858 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2243 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 2243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:50,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 784 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 2243 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 20:37:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38464 states. [2025-03-16 20:37:51,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38464 to 38464. [2025-03-16 20:37:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38464 states, 38462 states have (on average 1.4416826998076022) internal successors, (55450), 38463 states have internal predecessors, (55450), 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:37:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38464 states to 38464 states and 55450 transitions. [2025-03-16 20:37:51,224 INFO L78 Accepts]: Start accepts. Automaton has 38464 states and 55450 transitions. Word has length 97 [2025-03-16 20:37:51,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:51,224 INFO L471 AbstractCegarLoop]: Abstraction has 38464 states and 55450 transitions. [2025-03-16 20:37:51,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 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:37:51,224 INFO L276 IsEmpty]: Start isEmpty. Operand 38464 states and 55450 transitions. [2025-03-16 20:37:51,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 20:37:51,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:51,226 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-03-16 20:37:51,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:37:51,226 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:51,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:51,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1876098824, now seen corresponding path program 1 times [2025-03-16 20:37:51,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:51,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781985028] [2025-03-16 20:37:51,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:51,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:51,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:37:51,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:37:51,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:51,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:51,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:51,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781985028] [2025-03-16 20:37:51,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781985028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:51,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:51,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:51,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602449253] [2025-03-16 20:37:51,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:51,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:37:51,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:51,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:37:51,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:37:51,421 INFO L87 Difference]: Start difference. First operand 38464 states and 55450 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 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:37:54,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:54,154 INFO L93 Difference]: Finished difference Result 45225 states and 64305 transitions. [2025-03-16 20:37:54,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:37:54,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 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 104 [2025-03-16 20:37:54,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:54,209 INFO L225 Difference]: With dead ends: 45225 [2025-03-16 20:37:54,209 INFO L226 Difference]: Without dead ends: 39215 [2025-03-16 20:37:54,228 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:37:54,229 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 1049 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 3152 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:54,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 1497 Invalid, 3229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3152 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 20:37:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39215 states. [2025-03-16 20:37:54,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39215 to 39215. [2025-03-16 20:37:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39215 states, 39213 states have (on average 1.4333766863030117) internal successors, (56207), 39214 states have internal predecessors, (56207), 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:37:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39215 states to 39215 states and 56207 transitions. [2025-03-16 20:37:55,001 INFO L78 Accepts]: Start accepts. Automaton has 39215 states and 56207 transitions. Word has length 104 [2025-03-16 20:37:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:55,001 INFO L471 AbstractCegarLoop]: Abstraction has 39215 states and 56207 transitions. [2025-03-16 20:37:55,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 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:37:55,001 INFO L276 IsEmpty]: Start isEmpty. Operand 39215 states and 56207 transitions. [2025-03-16 20:37:55,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:37:55,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:55,007 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:55,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:37:55,007 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:55,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:55,007 INFO L85 PathProgramCache]: Analyzing trace with hash -675466654, now seen corresponding path program 1 times [2025-03-16 20:37:55,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:55,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85745272] [2025-03-16 20:37:55,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:55,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:55,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:37:55,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:37:55,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:55,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:37:55,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:55,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85745272] [2025-03-16 20:37:55,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85745272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:55,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:55,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:37:55,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546950606] [2025-03-16 20:37:55,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:55,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:37:55,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:55,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:37:55,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:37:55,250 INFO L87 Difference]: Start difference. First operand 39215 states and 56207 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 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:37:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:58,586 INFO L93 Difference]: Finished difference Result 304705 states and 444184 transitions. [2025-03-16 20:37:58,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:37:58,587 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 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 115 [2025-03-16 20:37:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:59,007 INFO L225 Difference]: With dead ends: 304705 [2025-03-16 20:37:59,007 INFO L226 Difference]: Without dead ends: 272319 [2025-03-16 20:37:59,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 20:37:59,084 INFO L435 NwaCegarLoop]: 1705 mSDtfsCounter, 11727 mSDsluCounter, 3457 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11727 SdHoareTripleChecker+Valid, 5162 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:59,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11727 Valid, 5162 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:37:59,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272319 states. [2025-03-16 20:38:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272319 to 71599. [2025-03-16 20:38:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71599 states, 71597 states have (on average 1.4411637359107226) internal successors, (103183), 71598 states have internal predecessors, (103183), 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:38:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71599 states to 71599 states and 103183 transitions. [2025-03-16 20:38:01,868 INFO L78 Accepts]: Start accepts. Automaton has 71599 states and 103183 transitions. Word has length 115 [2025-03-16 20:38:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:38:01,868 INFO L471 AbstractCegarLoop]: Abstraction has 71599 states and 103183 transitions. [2025-03-16 20:38:01,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 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:38:01,869 INFO L276 IsEmpty]: Start isEmpty. Operand 71599 states and 103183 transitions. [2025-03-16 20:38:01,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:38:01,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:38:01,874 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:38:01,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:38:01,875 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:38:01,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:38:01,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1090016610, now seen corresponding path program 1 times [2025-03-16 20:38:01,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:38:01,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042566317] [2025-03-16 20:38:01,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:38:01,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:38:01,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:38:01,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:38:01,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:38:01,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:38:02,063 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:38:02,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:38:02,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042566317] [2025-03-16 20:38:02,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042566317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:38:02,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:38:02,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:38:02,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038585383] [2025-03-16 20:38:02,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:38:02,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:38:02,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:38:02,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:38:02,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:38:02,064 INFO L87 Difference]: Start difference. First operand 71599 states and 103183 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 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:38:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:38:07,477 INFO L93 Difference]: Finished difference Result 337089 states and 491160 transitions. [2025-03-16 20:38:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:38:07,481 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 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 115 [2025-03-16 20:38:07,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:38:08,004 INFO L225 Difference]: With dead ends: 337089 [2025-03-16 20:38:08,004 INFO L226 Difference]: Without dead ends: 304703 [2025-03-16 20:38:08,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 20:38:08,089 INFO L435 NwaCegarLoop]: 1702 mSDtfsCounter, 11747 mSDsluCounter, 3334 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11747 SdHoareTripleChecker+Valid, 5036 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:38:08,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11747 Valid, 5036 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:38:08,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304703 states. [2025-03-16 20:38:11,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304703 to 120239. [2025-03-16 20:38:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120239 states, 120237 states have (on average 1.441544616049968) internal successors, (173327), 120238 states have internal predecessors, (173327), 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:38:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120239 states to 120239 states and 173327 transitions. [2025-03-16 20:38:12,209 INFO L78 Accepts]: Start accepts. Automaton has 120239 states and 173327 transitions. Word has length 115 [2025-03-16 20:38:12,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:38:12,209 INFO L471 AbstractCegarLoop]: Abstraction has 120239 states and 173327 transitions. [2025-03-16 20:38:12,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 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:38:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 120239 states and 173327 transitions. [2025-03-16 20:38:12,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:38:12,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:38:12,217 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:38:12,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:38:12,217 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:38:12,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:38:12,217 INFO L85 PathProgramCache]: Analyzing trace with hash -190826398, now seen corresponding path program 1 times [2025-03-16 20:38:12,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:38:12,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861753347] [2025-03-16 20:38:12,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:38:12,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:38:12,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:38:12,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:38:12,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:38:12,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:38:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:38:12,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:38:12,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861753347] [2025-03-16 20:38:12,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861753347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:38:12,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:38:12,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:38:12,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071405397] [2025-03-16 20:38:12,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:38:12,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:38:12,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:38:12,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:38:12,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:38:12,451 INFO L87 Difference]: Start difference. First operand 120239 states and 173327 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 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)