./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label07.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.BOUNDED-16.pals+Problem12_label07.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 0275b6de2ba0a66ec9aee8de32ff466d54e24272e5f9096b55f3975f63dd9962 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:36:42,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:36:42,707 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:36:42,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:36:42,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:36:42,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:36:42,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:36:42,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:36:42,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:36:42,738 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:36:42,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:36:42,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:36:42,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:36:42,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:36:42,738 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:36:42,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:36:42,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:36:42,738 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:36:42,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:36:42,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:36:42,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:36:42,740 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:36:42,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:36:42,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:36:42,740 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:36:42,740 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:36:42,740 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:36:42,740 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:36:42,740 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:36:42,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:36:42,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:36:42,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:36:42,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:36:42,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:36:42,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:36:42,741 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:36:42,741 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:36:42,741 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:36:42,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:36:42,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:36:42,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:36:42,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:36:42,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:36:42,741 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 -> 0275b6de2ba0a66ec9aee8de32ff466d54e24272e5f9096b55f3975f63dd9962 [2025-03-16 20:36:42,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:36:42,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:36:42,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:36:42,993 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:36:42,993 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:36:42,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label07.c [2025-03-16 20:36:44,147 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a13dc6cc/699eb35101e74cd0be8130f209d8d9d8/FLAG910f665fe [2025-03-16 20:36:44,604 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:36:44,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label07.c [2025-03-16 20:36:44,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a13dc6cc/699eb35101e74cd0be8130f209d8d9d8/FLAG910f665fe [2025-03-16 20:36:44,703 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a13dc6cc/699eb35101e74cd0be8130f209d8d9d8 [2025-03-16 20:36:44,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:36:44,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:36:44,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:36:44,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:36:44,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:36:44,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:36:44" (1/1) ... [2025-03-16 20:36:44,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2646df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:44, skipping insertion in model container [2025-03-16 20:36:44,711 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:36:44" (1/1) ... [2025-03-16 20:36:44,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:36:45,152 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.BOUNDED-16.pals+Problem12_label07.c[26860,26873] [2025-03-16 20:36:45,172 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.BOUNDED-16.pals+Problem12_label07.c[27702,27715] [2025-03-16 20:36:45,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:36:45,592 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:36:45,635 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.BOUNDED-16.pals+Problem12_label07.c[26860,26873] [2025-03-16 20:36:45,637 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.BOUNDED-16.pals+Problem12_label07.c[27702,27715] [2025-03-16 20:36:45,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:36:45,906 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:36:45,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:45 WrapperNode [2025-03-16 20:36:45,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:36:45,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:36:45,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:36:45,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:36:45,914 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:36:45" (1/1) ... [2025-03-16 20:36:45,955 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:36:45" (1/1) ... [2025-03-16 20:36:46,226 INFO L138 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5287 [2025-03-16 20:36:46,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:36:46,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:36:46,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:36:46,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:36:46,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:45" (1/1) ... [2025-03-16 20:36:46,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:45" (1/1) ... [2025-03-16 20:36:46,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:45" (1/1) ... [2025-03-16 20:36:46,392 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:36:46,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:45" (1/1) ... [2025-03-16 20:36:46,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:45" (1/1) ... [2025-03-16 20:36:46,521 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:45" (1/1) ... [2025-03-16 20:36:46,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:45" (1/1) ... [2025-03-16 20:36:46,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:45" (1/1) ... [2025-03-16 20:36:46,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:45" (1/1) ... [2025-03-16 20:36:46,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:36:46,611 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:36:46,612 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:36:46,612 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:36:46,613 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:45" (1/1) ... [2025-03-16 20:36:46,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:36:46,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:36:46,640 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:36:46,642 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:36:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:36:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:36:46,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:36:46,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:36:46,779 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:36:46,781 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:36:50,187 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2373: havoc calculate_output_#t~ret50#1; [2025-03-16 20:36:50,187 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3852: havoc calculate_output2_#t~ret51#1; [2025-03-16 20:36:50,188 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5342: havoc calculate_output3_#t~ret52#1; [2025-03-16 20:36:50,321 INFO L? ?]: Removed 756 outVars from TransFormulas that were not future-live. [2025-03-16 20:36:50,321 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:36:50,342 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:36:50,343 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:36:50,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:36:50 BoogieIcfgContainer [2025-03-16 20:36:50,343 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:36:50,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:36:50,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:36:50,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:36:50,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:36:44" (1/3) ... [2025-03-16 20:36:50,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b94bbd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:36:50, skipping insertion in model container [2025-03-16 20:36:50,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:45" (2/3) ... [2025-03-16 20:36:50,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b94bbd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:36:50, skipping insertion in model container [2025-03-16 20:36:50,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:36:50" (3/3) ... [2025-03-16 20:36:50,350 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label07.c [2025-03-16 20:36:50,361 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:36:50,363 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label07.c that has 1 procedures, 882 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:36:50,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:36:50,437 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;@28866ffa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:36:50,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:36:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 882 states, 879 states have (on average 1.9681456200227532) internal successors, (1730), 881 states have internal predecessors, (1730), 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:36:50,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-16 20:36:50,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:50,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-16 20:36:50,449 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:50,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:50,454 INFO L85 PathProgramCache]: Analyzing trace with hash -210575874, now seen corresponding path program 1 times [2025-03-16 20:36:50,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:50,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060694258] [2025-03-16 20:36:50,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:50,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:50,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 20:36:50,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 20:36:50,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:50,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:50,709 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:36:50,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:50,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060694258] [2025-03-16 20:36:50,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060694258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:50,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:50,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:36:50,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318362771] [2025-03-16 20:36:50,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:50,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:36:50,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:50,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:36:50,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:36:50,734 INFO L87 Difference]: Start difference. First operand has 882 states, 879 states have (on average 1.9681456200227532) internal successors, (1730), 881 states have internal predecessors, (1730), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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:36:53,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:53,419 INFO L93 Difference]: Finished difference Result 2454 states and 4833 transitions. [2025-03-16 20:36:53,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:36:53,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-03-16 20:36:53,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:53,438 INFO L225 Difference]: With dead ends: 2454 [2025-03-16 20:36:53,438 INFO L226 Difference]: Without dead ends: 1629 [2025-03-16 20:36:53,446 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:36:53,450 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 1036 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:36:53,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 308 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 20:36:53,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2025-03-16 20:36:53,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2025-03-16 20:36:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1627 states have (on average 1.8660110633066995) internal successors, (3036), 1628 states have internal predecessors, (3036), 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:36:53,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 3036 transitions. [2025-03-16 20:36:53,554 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 3036 transitions. Word has length 6 [2025-03-16 20:36:53,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:53,554 INFO L471 AbstractCegarLoop]: Abstraction has 1629 states and 3036 transitions. [2025-03-16 20:36:53,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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:36:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 3036 transitions. [2025-03-16 20:36:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 20:36:53,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:53,555 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:36:53,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:36:53,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:53,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:53,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1366537241, now seen corresponding path program 1 times [2025-03-16 20:36:53,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:53,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24842332] [2025-03-16 20:36:53,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:53,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:53,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 20:36:53,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 20:36:53,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:53,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:53,840 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:36:53,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:53,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24842332] [2025-03-16 20:36:53,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24842332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:53,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:53,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:36:53,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687787763] [2025-03-16 20:36:53,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:53,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:36:53,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:53,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:36:53,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:36:53,842 INFO L87 Difference]: Start difference. First operand 1629 states and 3036 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:36:53,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:53,914 INFO L93 Difference]: Finished difference Result 1691 states and 3135 transitions. [2025-03-16 20:36:53,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:36:53,915 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:36:53,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:53,920 INFO L225 Difference]: With dead ends: 1691 [2025-03-16 20:36:53,920 INFO L226 Difference]: Without dead ends: 1629 [2025-03-16 20:36:53,921 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:36:53,922 INFO L435 NwaCegarLoop]: 1660 mSDtfsCounter, 0 mSDsluCounter, 3255 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4915 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:36:53,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4915 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:36:53,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2025-03-16 20:36:53,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2025-03-16 20:36:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1627 states have (on average 1.8285187461585741) internal successors, (2975), 1628 states have internal predecessors, (2975), 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:36:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2975 transitions. [2025-03-16 20:36:53,960 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2975 transitions. Word has length 27 [2025-03-16 20:36:53,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:53,960 INFO L471 AbstractCegarLoop]: Abstraction has 1629 states and 2975 transitions. [2025-03-16 20:36:53,960 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:36:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2975 transitions. [2025-03-16 20:36:53,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 20:36:53,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:53,963 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:36:53,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:36:53,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:53,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:53,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1163033186, now seen corresponding path program 1 times [2025-03-16 20:36:53,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:53,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053143908] [2025-03-16 20:36:53,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:53,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:53,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 20:36:54,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 20:36:54,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:54,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:36:54,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:54,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053143908] [2025-03-16 20:36:54,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053143908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:54,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:54,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:36:54,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219219945] [2025-03-16 20:36:54,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:54,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:36:54,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:54,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:36:54,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:36:54,239 INFO L87 Difference]: Start difference. First operand 1629 states and 2975 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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:36:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:58,153 INFO L93 Difference]: Finished difference Result 5394 states and 9981 transitions. [2025-03-16 20:36:58,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:36:58,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2025-03-16 20:36:58,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:58,169 INFO L225 Difference]: With dead ends: 5394 [2025-03-16 20:36:58,169 INFO L226 Difference]: Without dead ends: 3890 [2025-03-16 20:36:58,172 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:36:58,174 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 2618 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3612 mSolverCounterSat, 1535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2618 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 5147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1535 IncrementalHoareTripleChecker+Valid, 3612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:36:58,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2618 Valid, 360 Invalid, 5147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1535 Valid, 3612 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-16 20:36:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2025-03-16 20:36:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3882. [2025-03-16 20:36:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3882 states, 3880 states have (on average 1.6028350515463918) internal successors, (6219), 3881 states have internal predecessors, (6219), 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:36:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3882 states to 3882 states and 6219 transitions. [2025-03-16 20:36:58,253 INFO L78 Accepts]: Start accepts. Automaton has 3882 states and 6219 transitions. Word has length 79 [2025-03-16 20:36:58,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:58,254 INFO L471 AbstractCegarLoop]: Abstraction has 3882 states and 6219 transitions. [2025-03-16 20:36:58,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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:36:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 3882 states and 6219 transitions. [2025-03-16 20:36:58,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 20:36:58,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:58,257 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:36:58,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:36:58,257 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:58,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:58,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1216942699, now seen corresponding path program 1 times [2025-03-16 20:36:58,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:58,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94611781] [2025-03-16 20:36:58,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:58,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:58,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:36:58,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:36:58,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:58,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:58,558 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:36:58,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:58,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94611781] [2025-03-16 20:36:58,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94611781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:58,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:58,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:36:58,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594682069] [2025-03-16 20:36:58,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:58,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:36:58,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:58,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:36:58,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:36:58,560 INFO L87 Difference]: Start difference. First operand 3882 states and 6219 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:36:58,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:58,990 INFO L93 Difference]: Finished difference Result 4826 states and 7755 transitions. [2025-03-16 20:36:58,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 20:36:58,991 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:36:58,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:59,005 INFO L225 Difference]: With dead ends: 4826 [2025-03-16 20:36:59,005 INFO L226 Difference]: Without dead ends: 4767 [2025-03-16 20:36:59,008 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:36:59,008 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 13338 mSDsluCounter, 5205 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13338 SdHoareTripleChecker+Valid, 6801 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:36:59,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13338 Valid, 6801 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:36:59,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4767 states. [2025-03-16 20:36:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4767 to 3939. [2025-03-16 20:36:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3939 states, 3937 states have (on average 1.603251206502413) internal successors, (6312), 3938 states have internal predecessors, (6312), 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:36:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3939 states to 3939 states and 6312 transitions. [2025-03-16 20:36:59,077 INFO L78 Accepts]: Start accepts. Automaton has 3939 states and 6312 transitions. Word has length 87 [2025-03-16 20:36:59,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:59,077 INFO L471 AbstractCegarLoop]: Abstraction has 3939 states and 6312 transitions. [2025-03-16 20:36:59,077 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:36:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3939 states and 6312 transitions. [2025-03-16 20:36:59,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:36:59,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:59,079 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:36:59,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:36:59,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:59,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:59,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1288011437, now seen corresponding path program 1 times [2025-03-16 20:36:59,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:59,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237286277] [2025-03-16 20:36:59,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:59,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:59,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:36:59,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:36:59,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:59,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:59,508 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:36:59,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:59,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237286277] [2025-03-16 20:36:59,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237286277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:59,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:59,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:36:59,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993982292] [2025-03-16 20:36:59,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:59,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:36:59,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:59,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:36:59,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:36:59,510 INFO L87 Difference]: Start difference. First operand 3939 states and 6312 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:36:59,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:59,853 INFO L93 Difference]: Finished difference Result 4057 states and 6502 transitions. [2025-03-16 20:36:59,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:36:59,854 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:36:59,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:59,867 INFO L225 Difference]: With dead ends: 4057 [2025-03-16 20:36:59,867 INFO L226 Difference]: Without dead ends: 3941 [2025-03-16 20:36:59,870 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:36:59,871 INFO L435 NwaCegarLoop]: 1590 mSDtfsCounter, 10612 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10612 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:36:59,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10612 Valid, 2244 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:36:59,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2025-03-16 20:36:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3939. [2025-03-16 20:36:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3939 states, 3937 states have (on average 1.602997205994412) internal successors, (6311), 3938 states have internal predecessors, (6311), 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:36:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3939 states to 3939 states and 6311 transitions. [2025-03-16 20:36:59,934 INFO L78 Accepts]: Start accepts. Automaton has 3939 states and 6311 transitions. Word has length 89 [2025-03-16 20:36:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:59,934 INFO L471 AbstractCegarLoop]: Abstraction has 3939 states and 6311 transitions. [2025-03-16 20:36:59,934 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:36:59,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3939 states and 6311 transitions. [2025-03-16 20:36:59,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:36:59,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:59,936 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:36:59,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:36:59,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:59,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:59,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1286968752, now seen corresponding path program 1 times [2025-03-16 20:36:59,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:59,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660260585] [2025-03-16 20:36:59,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:59,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:59,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:36:59,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:36:59,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:59,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:00,058 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:00,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:00,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660260585] [2025-03-16 20:37:00,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660260585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:00,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:00,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:00,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841794104] [2025-03-16 20:37:00,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:00,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:00,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:00,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:00,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:00,059 INFO L87 Difference]: Start difference. First operand 3939 states and 6311 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:00,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:00,085 INFO L93 Difference]: Finished difference Result 4160 states and 6668 transitions. [2025-03-16 20:37:00,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:00,086 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:00,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:00,097 INFO L225 Difference]: With dead ends: 4160 [2025-03-16 20:37:00,097 INFO L226 Difference]: Without dead ends: 4044 [2025-03-16 20:37:00,098 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:00,099 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 1504 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:00,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1690 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:00,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4044 states. [2025-03-16 20:37:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4044 to 4042. [2025-03-16 20:37:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4042 states, 4040 states have (on average 1.602970297029703) internal successors, (6476), 4041 states have internal predecessors, (6476), 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:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4042 states to 4042 states and 6476 transitions. [2025-03-16 20:37:00,164 INFO L78 Accepts]: Start accepts. Automaton has 4042 states and 6476 transitions. Word has length 89 [2025-03-16 20:37:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:00,165 INFO L471 AbstractCegarLoop]: Abstraction has 4042 states and 6476 transitions. [2025-03-16 20:37:00,165 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:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 4042 states and 6476 transitions. [2025-03-16 20:37:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 20:37:00,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:00,166 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:00,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:37:00,167 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:00,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:00,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1274633943, now seen corresponding path program 1 times [2025-03-16 20:37:00,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:00,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646702223] [2025-03-16 20:37:00,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:00,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:00,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 20:37:00,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 20:37:00,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:00,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:00,407 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:00,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:00,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646702223] [2025-03-16 20:37:00,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646702223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:00,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:00,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:37:00,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834293988] [2025-03-16 20:37:00,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:00,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:37:00,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:00,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:37:00,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:37:00,408 INFO L87 Difference]: Start difference. First operand 4042 states and 6476 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:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:00,446 INFO L93 Difference]: Finished difference Result 4048 states and 6483 transitions. [2025-03-16 20:37:00,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:37:00,447 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:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:00,458 INFO L225 Difference]: With dead ends: 4048 [2025-03-16 20:37:00,458 INFO L226 Difference]: Without dead ends: 4046 [2025-03-16 20:37:00,460 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:00,461 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 0 mSDsluCounter, 6373 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7969 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:00,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7969 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:00,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4046 states. [2025-03-16 20:37:00,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4046 to 4046. [2025-03-16 20:37:00,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4046 states, 4044 states have (on average 1.6021266073194858) internal successors, (6479), 4045 states have internal predecessors, (6479), 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:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4046 states to 4046 states and 6479 transitions. [2025-03-16 20:37:00,523 INFO L78 Accepts]: Start accepts. Automaton has 4046 states and 6479 transitions. Word has length 90 [2025-03-16 20:37:00,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:00,523 INFO L471 AbstractCegarLoop]: Abstraction has 4046 states and 6479 transitions. [2025-03-16 20:37:00,523 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:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 4046 states and 6479 transitions. [2025-03-16 20:37:00,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:00,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:37:00,524 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:00,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:00,525 INFO L85 PathProgramCache]: Analyzing trace with hash 226374351, now seen corresponding path program 1 times [2025-03-16 20:37:00,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:00,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716780290] [2025-03-16 20:37:00,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:00,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:00,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:00,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:00,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:00,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:00,588 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:00,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:00,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716780290] [2025-03-16 20:37:00,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716780290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:00,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:00,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:00,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718365639] [2025-03-16 20:37:00,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:00,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:00,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:00,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:00,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:00,590 INFO L87 Difference]: Start difference. First operand 4046 states and 6479 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:00,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:00,620 INFO L93 Difference]: Finished difference Result 4280 states and 6852 transitions. [2025-03-16 20:37:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:00,620 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:00,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:00,633 INFO L225 Difference]: With dead ends: 4280 [2025-03-16 20:37:00,633 INFO L226 Difference]: Without dead ends: 4160 [2025-03-16 20:37:00,635 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:00,637 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 1524 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1778 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:00,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1778 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:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4160 states. [2025-03-16 20:37:00,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4160 to 4158. [2025-03-16 20:37:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4158 states, 4156 states have (on average 1.6015399422521654) internal successors, (6656), 4157 states have internal predecessors, (6656), 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:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4158 states to 4158 states and 6656 transitions. [2025-03-16 20:37:00,700 INFO L78 Accepts]: Start accepts. Automaton has 4158 states and 6656 transitions. Word has length 91 [2025-03-16 20:37:00,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:00,700 INFO L471 AbstractCegarLoop]: Abstraction has 4158 states and 6656 transitions. [2025-03-16 20:37:00,700 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:00,700 INFO L276 IsEmpty]: Start isEmpty. Operand 4158 states and 6656 transitions. [2025-03-16 20:37:00,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:00,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:00,701 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:00,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:37:00,701 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:00,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:00,702 INFO L85 PathProgramCache]: Analyzing trace with hash 343709135, now seen corresponding path program 1 times [2025-03-16 20:37:00,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:00,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137973467] [2025-03-16 20:37:00,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:00,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:00,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:00,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:00,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:00,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:00,773 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:00,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:00,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137973467] [2025-03-16 20:37:00,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137973467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:00,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:00,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:00,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123821133] [2025-03-16 20:37:00,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:00,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:00,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:00,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:00,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:00,776 INFO L87 Difference]: Start difference. First operand 4158 states and 6656 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:00,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:00,814 INFO L93 Difference]: Finished difference Result 4800 states and 7676 transitions. [2025-03-16 20:37:00,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:00,815 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:00,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:00,822 INFO L225 Difference]: With dead ends: 4800 [2025-03-16 20:37:00,822 INFO L226 Difference]: Without dead ends: 4467 [2025-03-16 20:37:00,824 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:00,824 INFO L435 NwaCegarLoop]: 1683 mSDtfsCounter, 1522 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 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:00,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1522 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:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4467 states. [2025-03-16 20:37:00,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4467 to 4465. [2025-03-16 20:37:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4465 states, 4463 states have (on average 1.5993726193143625) internal successors, (7138), 4464 states have internal predecessors, (7138), 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:00,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4465 states to 4465 states and 7138 transitions. [2025-03-16 20:37:00,944 INFO L78 Accepts]: Start accepts. Automaton has 4465 states and 7138 transitions. Word has length 91 [2025-03-16 20:37:00,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:00,945 INFO L471 AbstractCegarLoop]: Abstraction has 4465 states and 7138 transitions. [2025-03-16 20:37:00,945 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:00,945 INFO L276 IsEmpty]: Start isEmpty. Operand 4465 states and 7138 transitions. [2025-03-16 20:37:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:00,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:00,948 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:00,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:37:00,948 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:00,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:00,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2109192399, now seen corresponding path program 1 times [2025-03-16 20:37:00,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:00,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830985949] [2025-03-16 20:37:00,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:00,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:00,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:00,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:00,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:00,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:01,027 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:01,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:01,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830985949] [2025-03-16 20:37:01,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830985949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:01,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:01,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:01,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555849008] [2025-03-16 20:37:01,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:01,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:01,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:01,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:01,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:01,029 INFO L87 Difference]: Start difference. First operand 4465 states and 7138 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:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:01,082 INFO L93 Difference]: Finished difference Result 5697 states and 9080 transitions. [2025-03-16 20:37:01,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:01,082 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:01,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:01,091 INFO L225 Difference]: With dead ends: 5697 [2025-03-16 20:37:01,091 INFO L226 Difference]: Without dead ends: 5057 [2025-03-16 20:37:01,094 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:01,094 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 1520 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1786 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:01,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1786 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:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5057 states. [2025-03-16 20:37:01,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5057 to 5055. [2025-03-16 20:37:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5055 states, 5053 states have (on average 1.5939046111221056) internal successors, (8054), 5054 states have internal predecessors, (8054), 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:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5055 states to 5055 states and 8054 transitions. [2025-03-16 20:37:01,195 INFO L78 Accepts]: Start accepts. Automaton has 5055 states and 8054 transitions. Word has length 91 [2025-03-16 20:37:01,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:01,195 INFO L471 AbstractCegarLoop]: Abstraction has 5055 states and 8054 transitions. [2025-03-16 20:37:01,195 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:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand 5055 states and 8054 transitions. [2025-03-16 20:37:01,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:01,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:01,198 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:01,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:37:01,198 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:01,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:01,199 INFO L85 PathProgramCache]: Analyzing trace with hash 828349391, now seen corresponding path program 1 times [2025-03-16 20:37:01,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:01,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59179688] [2025-03-16 20:37:01,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:01,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:01,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:01,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:01,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:01,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:01,280 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:01,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:01,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59179688] [2025-03-16 20:37:01,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59179688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:01,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:01,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:01,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112813817] [2025-03-16 20:37:01,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:01,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:01,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:01,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:01,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:01,281 INFO L87 Difference]: Start difference. First operand 5055 states and 8054 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:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:01,325 INFO L93 Difference]: Finished difference Result 7419 states and 11744 transitions. [2025-03-16 20:37:01,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:01,325 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:01,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:01,335 INFO L225 Difference]: With dead ends: 7419 [2025-03-16 20:37:01,335 INFO L226 Difference]: Without dead ends: 6189 [2025-03-16 20:37:01,339 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:01,340 INFO L435 NwaCegarLoop]: 1679 mSDtfsCounter, 1518 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1788 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:01,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1788 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:01,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6189 states. [2025-03-16 20:37:01,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6189 to 6187. [2025-03-16 20:37:01,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6187 states, 6185 states have (on average 1.5828617623282135) internal successors, (9790), 6186 states have internal predecessors, (9790), 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:01,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6187 states to 6187 states and 9790 transitions. [2025-03-16 20:37:01,435 INFO L78 Accepts]: Start accepts. Automaton has 6187 states and 9790 transitions. Word has length 91 [2025-03-16 20:37:01,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:01,435 INFO L471 AbstractCegarLoop]: Abstraction has 6187 states and 9790 transitions. [2025-03-16 20:37:01,435 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:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6187 states and 9790 transitions. [2025-03-16 20:37:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:01,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:01,437 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:01,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:37:01,437 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:01,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:01,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1671708367, now seen corresponding path program 1 times [2025-03-16 20:37:01,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:01,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317039045] [2025-03-16 20:37:01,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:01,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:01,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:01,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:01,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:01,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:01,504 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:01,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:01,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317039045] [2025-03-16 20:37:01,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317039045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:01,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:01,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:01,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551872538] [2025-03-16 20:37:01,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:01,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:01,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:01,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:01,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:01,505 INFO L87 Difference]: Start difference. First operand 6187 states and 9790 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:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:01,575 INFO L93 Difference]: Finished difference Result 10719 states and 16784 transitions. [2025-03-16 20:37:01,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:01,576 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:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:01,590 INFO L225 Difference]: With dead ends: 10719 [2025-03-16 20:37:01,590 INFO L226 Difference]: Without dead ends: 8357 [2025-03-16 20:37:01,596 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:01,597 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 1516 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1790 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:01,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1790 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:01,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8357 states. [2025-03-16 20:37:01,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8357 to 8355. [2025-03-16 20:37:01,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8355 states, 8353 states have (on average 1.5647072907937267) internal successors, (13070), 8354 states have internal predecessors, (13070), 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:01,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8355 states to 8355 states and 13070 transitions. [2025-03-16 20:37:01,743 INFO L78 Accepts]: Start accepts. Automaton has 8355 states and 13070 transitions. Word has length 91 [2025-03-16 20:37:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:01,743 INFO L471 AbstractCegarLoop]: Abstraction has 8355 states and 13070 transitions. [2025-03-16 20:37:01,743 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:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 8355 states and 13070 transitions. [2025-03-16 20:37:01,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:01,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:01,744 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:01,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:37:01,744 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:01,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:01,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1866218289, now seen corresponding path program 1 times [2025-03-16 20:37:01,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:01,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867134273] [2025-03-16 20:37:01,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:01,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:01,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:01,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:01,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:01,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:01,885 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:01,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:01,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867134273] [2025-03-16 20:37:01,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867134273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:01,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:01,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:01,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624270479] [2025-03-16 20:37:01,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:01,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:01,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:01,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:01,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:01,887 INFO L87 Difference]: Start difference. First operand 8355 states and 13070 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:01,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:01,998 INFO L93 Difference]: Finished difference Result 17031 states and 26288 transitions. [2025-03-16 20:37:01,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:01,998 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:01,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:02,020 INFO L225 Difference]: With dead ends: 17031 [2025-03-16 20:37:02,021 INFO L226 Difference]: Without dead ends: 12501 [2025-03-16 20:37:02,029 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:02,030 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 1512 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1786 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:02,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1786 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:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12501 states. [2025-03-16 20:37:02,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12501 to 12499. [2025-03-16 20:37:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12499 states, 12497 states have (on average 1.5400496119068576) internal successors, (19246), 12498 states have internal predecessors, (19246), 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:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12499 states to 12499 states and 19246 transitions. [2025-03-16 20:37:02,250 INFO L78 Accepts]: Start accepts. Automaton has 12499 states and 19246 transitions. Word has length 91 [2025-03-16 20:37:02,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:02,250 INFO L471 AbstractCegarLoop]: Abstraction has 12499 states and 19246 transitions. [2025-03-16 20:37:02,250 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:02,251 INFO L276 IsEmpty]: Start isEmpty. Operand 12499 states and 19246 transitions. [2025-03-16 20:37:02,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:02,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:02,251 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:02,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:37:02,252 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:02,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:02,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1878960079, now seen corresponding path program 1 times [2025-03-16 20:37:02,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:02,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90768101] [2025-03-16 20:37:02,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:02,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:02,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:02,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:02,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:02,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:02,310 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:02,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:02,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90768101] [2025-03-16 20:37:02,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90768101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:02,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:02,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:02,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141823607] [2025-03-16 20:37:02,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:02,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:02,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:02,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:02,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:02,311 INFO L87 Difference]: Start difference. First operand 12499 states and 19246 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:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:02,558 INFO L93 Difference]: Finished difference Result 29079 states and 44144 transitions. [2025-03-16 20:37:02,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:02,558 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:02,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:02,590 INFO L225 Difference]: With dead ends: 29079 [2025-03-16 20:37:02,591 INFO L226 Difference]: Without dead ends: 20405 [2025-03-16 20:37:02,598 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:02,599 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 1510 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1788 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:02,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1788 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:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20405 states. [2025-03-16 20:37:02,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20405 to 20403. [2025-03-16 20:37:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20403 states, 20401 states have (on average 1.5112004313514042) internal successors, (30830), 20402 states have internal predecessors, (30830), 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:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20403 states to 20403 states and 30830 transitions. [2025-03-16 20:37:02,949 INFO L78 Accepts]: Start accepts. Automaton has 20403 states and 30830 transitions. Word has length 91 [2025-03-16 20:37:02,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:02,949 INFO L471 AbstractCegarLoop]: Abstraction has 20403 states and 30830 transitions. [2025-03-16 20:37:02,949 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:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 20403 states and 30830 transitions. [2025-03-16 20:37:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:02,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:02,950 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:02,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:37:02,950 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:02,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:02,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1800035889, now seen corresponding path program 1 times [2025-03-16 20:37:02,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:02,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570957511] [2025-03-16 20:37:02,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:02,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:02,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:02,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:02,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:02,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:03,009 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:03,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:03,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570957511] [2025-03-16 20:37:03,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570957511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:03,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:03,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732521515] [2025-03-16 20:37:03,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:03,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:03,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:03,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:03,010 INFO L87 Difference]: Start difference. First operand 20403 states and 30830 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:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:03,409 INFO L93 Difference]: Finished difference Result 52023 states and 77552 transitions. [2025-03-16 20:37:03,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:03,409 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:03,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:03,471 INFO L225 Difference]: With dead ends: 52023 [2025-03-16 20:37:03,472 INFO L226 Difference]: Without dead ends: 35445 [2025-03-16 20:37:03,495 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:03,496 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 1514 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1792 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:03,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1792 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:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35445 states. [2025-03-16 20:37:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35445 to 35443. [2025-03-16 20:37:04,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35443 states, 35441 states have (on average 1.4802629722637624) internal successors, (52462), 35442 states have internal predecessors, (52462), 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:04,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35443 states to 35443 states and 52462 transitions. [2025-03-16 20:37:04,448 INFO L78 Accepts]: Start accepts. Automaton has 35443 states and 52462 transitions. Word has length 91 [2025-03-16 20:37:04,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:04,448 INFO L471 AbstractCegarLoop]: Abstraction has 35443 states and 52462 transitions. [2025-03-16 20:37:04,448 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:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 35443 states and 52462 transitions. [2025-03-16 20:37:04,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:37:04,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:04,456 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:04,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:37:04,456 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:04,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:04,457 INFO L85 PathProgramCache]: Analyzing trace with hash 428308800, now seen corresponding path program 1 times [2025-03-16 20:37:04,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:04,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805333440] [2025-03-16 20:37:04,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:04,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:04,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:37:04,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:37:04,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:04,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:37:04,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:04,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805333440] [2025-03-16 20:37:04,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805333440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:04,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:04,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:37:04,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71422341] [2025-03-16 20:37:04,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:04,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:37:04,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:04,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:37:04,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:37:04,731 INFO L87 Difference]: Start difference. First operand 35443 states and 52462 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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:08,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:08,001 INFO L93 Difference]: Finished difference Result 285061 states and 418167 transitions. [2025-03-16 20:37:08,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:37:08,001 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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:08,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:08,566 INFO L225 Difference]: With dead ends: 285061 [2025-03-16 20:37:08,566 INFO L226 Difference]: Without dead ends: 263043 [2025-03-16 20:37:08,654 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:08,654 INFO L435 NwaCegarLoop]: 1697 mSDtfsCounter, 11684 mSDsluCounter, 3722 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11684 SdHoareTripleChecker+Valid, 5419 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:08,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11684 Valid, 5419 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:37:08,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263043 states. [2025-03-16 20:37:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263043 to 62323. [2025-03-16 20:37:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62323 states, 62321 states have (on average 1.4682370308563726) internal successors, (91502), 62322 states have internal predecessors, (91502), 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:11,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62323 states to 62323 states and 91502 transitions. [2025-03-16 20:37:11,693 INFO L78 Accepts]: Start accepts. Automaton has 62323 states and 91502 transitions. Word has length 115 [2025-03-16 20:37:11,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:11,693 INFO L471 AbstractCegarLoop]: Abstraction has 62323 states and 91502 transitions. [2025-03-16 20:37:11,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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:11,694 INFO L276 IsEmpty]: Start isEmpty. Operand 62323 states and 91502 transitions. [2025-03-16 20:37:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:37:11,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:11,702 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:11,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:37:11,702 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:11,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:11,703 INFO L85 PathProgramCache]: Analyzing trace with hash 545643584, now seen corresponding path program 1 times [2025-03-16 20:37:11,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:11,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339071540] [2025-03-16 20:37:11,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:11,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:11,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:37:11,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:37:11,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:11,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:12,098 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:12,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:12,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339071540] [2025-03-16 20:37:12,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339071540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:12,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:12,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:37:12,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244273629] [2025-03-16 20:37:12,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:12,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:37:12,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:12,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:37:12,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:37:12,101 INFO L87 Difference]: Start difference. First operand 62323 states and 91502 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:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:16,897 INFO L93 Difference]: Finished difference Result 316677 states and 464247 transitions. [2025-03-16 20:37:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:37:16,898 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:16,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:17,541 INFO L225 Difference]: With dead ends: 316677 [2025-03-16 20:37:17,541 INFO L226 Difference]: Without dead ends: 285059 [2025-03-16 20:37:17,593 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:17,594 INFO L435 NwaCegarLoop]: 1696 mSDtfsCounter, 11686 mSDsluCounter, 3676 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11686 SdHoareTripleChecker+Valid, 5372 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:17,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11686 Valid, 5372 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:37:17,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285059 states. [2025-03-16 20:37:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285059 to 104947. [2025-03-16 20:37:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104947 states, 104945 states have (on average 1.4610129115250845) internal successors, (153326), 104946 states have internal predecessors, (153326), 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:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104947 states to 104947 states and 153326 transitions. [2025-03-16 20:37:21,499 INFO L78 Accepts]: Start accepts. Automaton has 104947 states and 153326 transitions. Word has length 115 [2025-03-16 20:37:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:21,500 INFO L471 AbstractCegarLoop]: Abstraction has 104947 states and 153326 transitions. [2025-03-16 20:37:21,500 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:37:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 104947 states and 153326 transitions. [2025-03-16 20:37:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:37:21,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:21,509 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:21,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:37:21,509 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:21,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:21,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1983840448, now seen corresponding path program 1 times [2025-03-16 20:37:21,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:21,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96419141] [2025-03-16 20:37:21,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:21,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:21,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:37:21,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:37:21,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:21,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:21,749 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:37:21,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:21,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96419141] [2025-03-16 20:37:21,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96419141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:21,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:21,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:37:21,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009757054] [2025-03-16 20:37:21,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:21,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:37:21,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:21,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:37:21,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:37:21,751 INFO L87 Difference]: Start difference. First operand 104947 states and 153326 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:37:27,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:27,844 INFO L93 Difference]: Finished difference Result 348293 states and 510199 transitions. [2025-03-16 20:37:27,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:37:27,844 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:37:27,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:28,295 INFO L225 Difference]: With dead ends: 348293 [2025-03-16 20:37:28,295 INFO L226 Difference]: Without dead ends: 316675 [2025-03-16 20:37:28,355 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:28,355 INFO L435 NwaCegarLoop]: 1694 mSDtfsCounter, 11705 mSDsluCounter, 3630 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11705 SdHoareTripleChecker+Valid, 5324 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:28,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11705 Valid, 5324 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:37:28,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316675 states.