./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.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 b52b7cb04206fcfe3f216083825f85a3c49ed6dc90ac2fa7b25183898e97828e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:34:54,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:34:54,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:34:54,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:34:54,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:34:54,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:34:54,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:34:54,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:34:54,521 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:34:54,521 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:34:54,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:34:54,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:34:54,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:34:54,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:34:54,523 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:34:54,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:34:54,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:34:54,524 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:34:54,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:34:54,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:34:54,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:34:54,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:34:54,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:34:54,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:34:54,524 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:34:54,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:34:54,524 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:34:54,524 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:34:54,524 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:34:54,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:34:54,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:34:54,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:34:54,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:34:54,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:34:54,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:34:54,525 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:34:54,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:34:54,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:34:54,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:34:54,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:34:54,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:34:54,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:34:54,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:34:54,525 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 -> b52b7cb04206fcfe3f216083825f85a3c49ed6dc90ac2fa7b25183898e97828e [2025-03-16 20:34:54,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:34:54,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:34:54,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:34:54,759 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:34:54,760 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:34:54,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:34:55,911 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e458e76/19720c2d63a14e7bb7c9eb500898f0c4/FLAGd96420f57 [2025-03-16 20:34:56,315 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:34:56,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:34:56,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e458e76/19720c2d63a14e7bb7c9eb500898f0c4/FLAGd96420f57 [2025-03-16 20:34:56,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e458e76/19720c2d63a14e7bb7c9eb500898f0c4 [2025-03-16 20:34:56,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:34:56,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:34:56,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:34:56,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:34:56,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:34:56,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:34:56" (1/1) ... [2025-03-16 20:34:56,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373f1443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:56, skipping insertion in model container [2025-03-16 20:34:56,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:34:56" (1/1) ... [2025-03-16 20:34:56,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:34:56,835 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c[20454,20467] [2025-03-16 20:34:56,879 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c[26009,26022] [2025-03-16 20:34:57,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:34:57,324 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:34:57,367 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c[20454,20467] [2025-03-16 20:34:57,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c[26009,26022] [2025-03-16 20:34:57,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:34:57,631 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:34:57,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:57 WrapperNode [2025-03-16 20:34:57,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:34:57,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:34:57,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:34:57,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:34:57,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:57" (1/1) ... [2025-03-16 20:34:57,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:57" (1/1) ... [2025-03-16 20:34:57,914 INFO L138 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5213 [2025-03-16 20:34:57,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:34:57,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:34:57,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:34:57,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:34:57,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:57" (1/1) ... [2025-03-16 20:34:57,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:57" (1/1) ... [2025-03-16 20:34:58,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:57" (1/1) ... [2025-03-16 20:34:58,114 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:34:58,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:57" (1/1) ... [2025-03-16 20:34:58,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:57" (1/1) ... [2025-03-16 20:34:58,259 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:57" (1/1) ... [2025-03-16 20:34:58,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:57" (1/1) ... [2025-03-16 20:34:58,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:57" (1/1) ... [2025-03-16 20:34:58,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:57" (1/1) ... [2025-03-16 20:34:58,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:34:58,342 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:34:58,343 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:34:58,343 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:34:58,343 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:57" (1/1) ... [2025-03-16 20:34:58,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:34:58,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:34:58,368 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:34:58,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:34:58,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:34:58,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:34:58,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:34:58,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:34:58,474 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:34:58,476 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:35:01,695 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5256: havoc calculate_output3_#t~ret47#1; [2025-03-16 20:35:01,695 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2287: havoc calculate_output_#t~ret45#1; [2025-03-16 20:35:01,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3766: havoc calculate_output2_#t~ret46#1; [2025-03-16 20:35:01,853 INFO L? ?]: Removed 750 outVars from TransFormulas that were not future-live. [2025-03-16 20:35:01,854 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:35:01,874 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:35:01,874 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:35:01,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:35:01 BoogieIcfgContainer [2025-03-16 20:35:01,875 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:35:01,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:35:01,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:35:01,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:35:01,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:34:56" (1/3) ... [2025-03-16 20:35:01,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416ff157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:35:01, skipping insertion in model container [2025-03-16 20:35:01,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:57" (2/3) ... [2025-03-16 20:35:01,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416ff157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:35:01, skipping insertion in model container [2025-03-16 20:35:01,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:35:01" (3/3) ... [2025-03-16 20:35:01,885 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:35:01,896 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:35:01,898 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c that has 1 procedures, 867 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:35:01,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:35:01,976 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;@148ebe21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:35:01,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:35:01,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 867 states, 864 states have (on average 1.96875) internal successors, (1701), 866 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:01,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 20:35:01,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:01,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:35:01,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:01,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash 123168304, now seen corresponding path program 1 times [2025-03-16 20:35:01,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:01,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747814426] [2025-03-16 20:35:01,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:01,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:02,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 20:35:02,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 20:35:02,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:02,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:02,233 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:35:02,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:02,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747814426] [2025-03-16 20:35:02,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747814426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:02,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:02,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:35:02,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265214427] [2025-03-16 20:35:02,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:02,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:35:02,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:02,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:35:02,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:35:02,263 INFO L87 Difference]: Start difference. First operand has 867 states, 864 states have (on average 1.96875) internal successors, (1701), 866 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:02,348 INFO L93 Difference]: Finished difference Result 1680 states and 3296 transitions. [2025-03-16 20:35:02,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:35:02,350 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-16 20:35:02,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:02,365 INFO L225 Difference]: With dead ends: 1680 [2025-03-16 20:35:02,366 INFO L226 Difference]: Without dead ends: 863 [2025-03-16 20:35:02,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:35:02,376 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:02,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:35:02,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-03-16 20:35:02,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2025-03-16 20:35:02,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 861 states have (on average 1.8954703832752613) internal successors, (1632), 862 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:02,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1632 transitions. [2025-03-16 20:35:02,453 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1632 transitions. Word has length 25 [2025-03-16 20:35:02,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:02,453 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1632 transitions. [2025-03-16 20:35:02,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:02,453 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1632 transitions. [2025-03-16 20:35:02,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 20:35:02,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:02,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:35:02,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:35:02,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:02,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:02,455 INFO L85 PathProgramCache]: Analyzing trace with hash 334519217, now seen corresponding path program 1 times [2025-03-16 20:35:02,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:02,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977045703] [2025-03-16 20:35:02,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:02,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:02,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 20:35:02,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 20:35:02,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:02,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:02,693 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:35:02,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:02,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977045703] [2025-03-16 20:35:02,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977045703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:02,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:02,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:35:02,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963023513] [2025-03-16 20:35:02,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:02,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:35:02,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:02,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:35:02,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:35:02,696 INFO L87 Difference]: Start difference. First operand 863 states and 1632 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:02,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:02,806 INFO L93 Difference]: Finished difference Result 921 states and 1724 transitions. [2025-03-16 20:35:02,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:35:02,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-16 20:35:02,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:02,813 INFO L225 Difference]: With dead ends: 921 [2025-03-16 20:35:02,814 INFO L226 Difference]: Without dead ends: 863 [2025-03-16 20:35:02,814 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:35:02,815 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 0 mSDsluCounter, 3208 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:02,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4839 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:35:02,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-03-16 20:35:02,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2025-03-16 20:35:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 861 states have (on average 1.8373983739837398) internal successors, (1582), 862 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:02,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1582 transitions. [2025-03-16 20:35:02,834 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1582 transitions. Word has length 25 [2025-03-16 20:35:02,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:02,835 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1582 transitions. [2025-03-16 20:35:02,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:02,835 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1582 transitions. [2025-03-16 20:35:02,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 20:35:02,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:02,836 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] [2025-03-16 20:35:02,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:35:02,836 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:02,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:02,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1944640753, now seen corresponding path program 1 times [2025-03-16 20:35:02,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:02,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817697722] [2025-03-16 20:35:02,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:02,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:02,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 20:35:02,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 20:35:02,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:02,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:03,041 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:35:03,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:03,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817697722] [2025-03-16 20:35:03,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817697722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:03,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:03,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:35:03,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763080309] [2025-03-16 20:35:03,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:03,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:35:03,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:03,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:35:03,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:35:03,045 INFO L87 Difference]: Start difference. First operand 863 states and 1582 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:07,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:07,999 INFO L93 Difference]: Finished difference Result 3118 states and 5891 transitions. [2025-03-16 20:35:08,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:35:08,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2025-03-16 20:35:08,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:08,009 INFO L225 Difference]: With dead ends: 3118 [2025-03-16 20:35:08,010 INFO L226 Difference]: Without dead ends: 2365 [2025-03-16 20:35:08,011 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:35:08,012 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 2504 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2504 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:08,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2504 Valid, 836 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-16 20:35:08,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2025-03-16 20:35:08,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2365. [2025-03-16 20:35:08,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2365 states, 2363 states have (on average 1.5641134151502327) internal successors, (3696), 2364 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 3696 transitions. [2025-03-16 20:35:08,058 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 3696 transitions. Word has length 47 [2025-03-16 20:35:08,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:08,058 INFO L471 AbstractCegarLoop]: Abstraction has 2365 states and 3696 transitions. [2025-03-16 20:35:08,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 3696 transitions. [2025-03-16 20:35:08,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 20:35:08,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:08,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:35:08,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:35:08,060 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:08,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:08,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1938958589, now seen corresponding path program 1 times [2025-03-16 20:35:08,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:08,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147614895] [2025-03-16 20:35:08,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:08,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:08,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 20:35:08,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 20:35:08,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:08,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:08,302 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:35:08,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:08,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147614895] [2025-03-16 20:35:08,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147614895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:08,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:08,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:35:08,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351081609] [2025-03-16 20:35:08,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:08,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:35:08,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:08,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:35:08,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:35:08,331 INFO L87 Difference]: Start difference. First operand 2365 states and 3696 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:08,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:08,642 INFO L93 Difference]: Finished difference Result 3135 states and 4942 transitions. [2025-03-16 20:35:08,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 20:35:08,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 20:35:08,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:08,653 INFO L225 Difference]: With dead ends: 3135 [2025-03-16 20:35:08,653 INFO L226 Difference]: Without dead ends: 3080 [2025-03-16 20:35:08,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-03-16 20:35:08,655 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 11584 mSDsluCounter, 2857 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11584 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:08,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11584 Valid, 4433 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:35:08,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3080 states. [2025-03-16 20:35:08,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3080 to 2418. [2025-03-16 20:35:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2416 states have (on average 1.5653973509933774) internal successors, (3782), 2417 states have internal predecessors, (3782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3782 transitions. [2025-03-16 20:35:08,701 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3782 transitions. Word has length 74 [2025-03-16 20:35:08,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:08,702 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3782 transitions. [2025-03-16 20:35:08,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:08,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3782 transitions. [2025-03-16 20:35:08,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 20:35:08,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:08,703 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:35:08,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:35:08,703 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:08,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:08,704 INFO L85 PathProgramCache]: Analyzing trace with hash 713784645, now seen corresponding path program 1 times [2025-03-16 20:35:08,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:08,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51161648] [2025-03-16 20:35:08,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:08,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:08,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 20:35:08,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 20:35:08,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:08,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:09,092 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:35:09,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:09,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51161648] [2025-03-16 20:35:09,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51161648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:09,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:09,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:35:09,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647334018] [2025-03-16 20:35:09,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:09,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:35:09,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:09,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:35:09,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:35:09,093 INFO L87 Difference]: Start difference. First operand 2418 states and 3782 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:09,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:09,353 INFO L93 Difference]: Finished difference Result 2528 states and 3958 transitions. [2025-03-16 20:35:09,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:35:09,354 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 20:35:09,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:09,362 INFO L225 Difference]: With dead ends: 2528 [2025-03-16 20:35:09,362 INFO L226 Difference]: Without dead ends: 2420 [2025-03-16 20:35:09,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-16 20:35:09,364 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 6060 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6060 SdHoareTripleChecker+Valid, 2089 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:09,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6060 Valid, 2089 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:35:09,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2025-03-16 20:35:09,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 2418. [2025-03-16 20:35:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2416 states have (on average 1.5649834437086092) internal successors, (3781), 2417 states have internal predecessors, (3781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:09,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3781 transitions. [2025-03-16 20:35:09,405 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3781 transitions. Word has length 76 [2025-03-16 20:35:09,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:09,405 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3781 transitions. [2025-03-16 20:35:09,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:09,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3781 transitions. [2025-03-16 20:35:09,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 20:35:09,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:09,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:35:09,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:35:09,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:09,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:09,407 INFO L85 PathProgramCache]: Analyzing trace with hash 712741960, now seen corresponding path program 1 times [2025-03-16 20:35:09,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:09,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034423040] [2025-03-16 20:35:09,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:09,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:09,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 20:35:09,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 20:35:09,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:09,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:09,487 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:35:09,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:09,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034423040] [2025-03-16 20:35:09,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034423040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:09,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:09,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:35:09,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929619700] [2025-03-16 20:35:09,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:09,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:35:09,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:09,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:35:09,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:35:09,491 INFO L87 Difference]: Start difference. First operand 2418 states and 3781 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:09,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:09,523 INFO L93 Difference]: Finished difference Result 2623 states and 4110 transitions. [2025-03-16 20:35:09,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:35:09,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 20:35:09,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:09,533 INFO L225 Difference]: With dead ends: 2623 [2025-03-16 20:35:09,533 INFO L226 Difference]: Without dead ends: 2515 [2025-03-16 20:35:09,535 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:35:09,535 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 1498 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:09,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1660 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:35:09,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2025-03-16 20:35:09,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2511. [2025-03-16 20:35:09,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2509 states have (on average 1.5655639697090473) internal successors, (3928), 2510 states have internal predecessors, (3928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3928 transitions. [2025-03-16 20:35:09,590 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 3928 transitions. Word has length 76 [2025-03-16 20:35:09,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:09,591 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 3928 transitions. [2025-03-16 20:35:09,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3928 transitions. [2025-03-16 20:35:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 20:35:09,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:09,592 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:35:09,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:35:09,593 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:09,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:09,593 INFO L85 PathProgramCache]: Analyzing trace with hash 653472575, now seen corresponding path program 1 times [2025-03-16 20:35:09,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:09,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884076653] [2025-03-16 20:35:09,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:09,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:09,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 20:35:09,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 20:35:09,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:09,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:09,844 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:35:09,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:09,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884076653] [2025-03-16 20:35:09,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884076653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:09,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:09,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:35:09,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986524339] [2025-03-16 20:35:09,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:09,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:35:09,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:09,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:35:09,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:35:09,847 INFO L87 Difference]: Start difference. First operand 2511 states and 3928 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:09,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:09,889 INFO L93 Difference]: Finished difference Result 2517 states and 3935 transitions. [2025-03-16 20:35:09,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:35:09,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 20:35:09,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:09,897 INFO L225 Difference]: With dead ends: 2517 [2025-03-16 20:35:09,897 INFO L226 Difference]: Without dead ends: 2515 [2025-03-16 20:35:09,898 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:35:09,898 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 0 mSDsluCounter, 6301 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7879 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:35:09,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7879 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:35:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2025-03-16 20:35:09,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2515. [2025-03-16 20:35:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2515 states, 2513 states have (on average 1.564265817747712) internal successors, (3931), 2514 states have internal predecessors, (3931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 3931 transitions. [2025-03-16 20:35:09,940 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 3931 transitions. Word has length 77 [2025-03-16 20:35:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:09,940 INFO L471 AbstractCegarLoop]: Abstraction has 2515 states and 3931 transitions. [2025-03-16 20:35:09,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 3931 transitions. [2025-03-16 20:35:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:35:09,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:09,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:35:09,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:35:09,942 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:09,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:09,943 INFO L85 PathProgramCache]: Analyzing trace with hash 33059175, now seen corresponding path program 1 times [2025-03-16 20:35:09,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:09,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586222699] [2025-03-16 20:35:09,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:09,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:09,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:35:09,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:35:09,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:09,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:35:10,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:10,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586222699] [2025-03-16 20:35:10,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586222699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:10,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:10,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:35:10,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198541397] [2025-03-16 20:35:10,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:10,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:35:10,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:10,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:35:10,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:35:10,033 INFO L87 Difference]: Start difference. First operand 2515 states and 3931 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:10,080 INFO L93 Difference]: Finished difference Result 2909 states and 4551 transitions. [2025-03-16 20:35:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:35:10,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:35:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:10,088 INFO L225 Difference]: With dead ends: 2909 [2025-03-16 20:35:10,088 INFO L226 Difference]: Without dead ends: 2704 [2025-03-16 20:35:10,091 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:35:10,092 INFO L435 NwaCegarLoop]: 1648 mSDtfsCounter, 1515 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1742 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:35:10,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1742 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:35:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-03-16 20:35:10,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2702. [2025-03-16 20:35:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2702 states, 2700 states have (on average 1.5637037037037036) internal successors, (4222), 2701 states have internal predecessors, (4222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 4222 transitions. [2025-03-16 20:35:10,133 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 4222 transitions. Word has length 78 [2025-03-16 20:35:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:10,134 INFO L471 AbstractCegarLoop]: Abstraction has 2702 states and 4222 transitions. [2025-03-16 20:35:10,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:10,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 4222 transitions. [2025-03-16 20:35:10,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:35:10,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:10,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:35:10,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:35:10,137 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:10,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:10,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1247783833, now seen corresponding path program 1 times [2025-03-16 20:35:10,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:10,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751234079] [2025-03-16 20:35:10,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:10,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:10,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:35:10,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:35:10,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:10,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:10,183 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:35:10,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:10,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751234079] [2025-03-16 20:35:10,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751234079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:10,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:10,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:35:10,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135763297] [2025-03-16 20:35:10,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:10,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:35:10,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:10,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:35:10,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:35:10,184 INFO L87 Difference]: Start difference. First operand 2702 states and 4222 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:10,214 INFO L93 Difference]: Finished difference Result 3454 states and 5396 transitions. [2025-03-16 20:35:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:35:10,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:35:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:10,224 INFO L225 Difference]: With dead ends: 3454 [2025-03-16 20:35:10,224 INFO L226 Difference]: Without dead ends: 3062 [2025-03-16 20:35:10,225 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:35:10,226 INFO L435 NwaCegarLoop]: 1646 mSDtfsCounter, 1513 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1744 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:35:10,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1744 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:35:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2025-03-16 20:35:10,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3060. [2025-03-16 20:35:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 3058 states have (on average 1.5604970568999346) internal successors, (4772), 3059 states have internal predecessors, (4772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 4772 transitions. [2025-03-16 20:35:10,274 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 4772 transitions. Word has length 78 [2025-03-16 20:35:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:10,274 INFO L471 AbstractCegarLoop]: Abstraction has 3060 states and 4772 transitions. [2025-03-16 20:35:10,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:10,274 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 4772 transitions. [2025-03-16 20:35:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:35:10,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:10,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:35:10,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:35:10,275 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:10,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:10,276 INFO L85 PathProgramCache]: Analyzing trace with hash -404424857, now seen corresponding path program 1 times [2025-03-16 20:35:10,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:10,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134241822] [2025-03-16 20:35:10,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:10,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:10,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:35:10,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:35:10,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:10,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:10,318 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:35:10,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:10,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134241822] [2025-03-16 20:35:10,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134241822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:10,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:10,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:35:10,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767172287] [2025-03-16 20:35:10,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:10,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:35:10,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:10,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:35:10,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:35:10,320 INFO L87 Difference]: Start difference. First operand 3060 states and 4772 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:10,351 INFO L93 Difference]: Finished difference Result 4496 states and 6990 transitions. [2025-03-16 20:35:10,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:35:10,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:35:10,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:10,362 INFO L225 Difference]: With dead ends: 4496 [2025-03-16 20:35:10,362 INFO L226 Difference]: Without dead ends: 3746 [2025-03-16 20:35:10,364 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:35:10,364 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 1511 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1746 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:35:10,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1511 Valid, 1746 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:35:10,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2025-03-16 20:35:10,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 3744. [2025-03-16 20:35:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3744 states, 3742 states have (on average 1.5521111704970605) internal successors, (5808), 3743 states have internal predecessors, (5808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 5808 transitions. [2025-03-16 20:35:10,437 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 5808 transitions. Word has length 78 [2025-03-16 20:35:10,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:10,437 INFO L471 AbstractCegarLoop]: Abstraction has 3744 states and 5808 transitions. [2025-03-16 20:35:10,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:10,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 5808 transitions. [2025-03-16 20:35:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:35:10,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:10,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:35:10,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:35:10,439 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:10,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:10,439 INFO L85 PathProgramCache]: Analyzing trace with hash 352615783, now seen corresponding path program 1 times [2025-03-16 20:35:10,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:10,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260332353] [2025-03-16 20:35:10,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:10,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:10,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:35:10,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:35:10,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:10,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:10,489 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:35:10,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:10,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260332353] [2025-03-16 20:35:10,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260332353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:10,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:10,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:35:10,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791614419] [2025-03-16 20:35:10,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:10,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:35:10,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:10,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:35:10,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:35:10,491 INFO L87 Difference]: Start difference. First operand 3744 states and 5808 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:10,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:10,540 INFO L93 Difference]: Finished difference Result 6484 states and 9986 transitions. [2025-03-16 20:35:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:35:10,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:35:10,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:10,554 INFO L225 Difference]: With dead ends: 6484 [2025-03-16 20:35:10,554 INFO L226 Difference]: Without dead ends: 5050 [2025-03-16 20:35:10,557 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:35:10,557 INFO L435 NwaCegarLoop]: 1632 mSDtfsCounter, 1507 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1742 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:35:10,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1742 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:35:10,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5050 states. [2025-03-16 20:35:10,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5050 to 5048. [2025-03-16 20:35:10,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5048 states, 5046 states have (on average 1.5362663495838287) internal successors, (7752), 5047 states have internal predecessors, (7752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5048 states to 5048 states and 7752 transitions. [2025-03-16 20:35:10,649 INFO L78 Accepts]: Start accepts. Automaton has 5048 states and 7752 transitions. Word has length 78 [2025-03-16 20:35:10,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:10,649 INFO L471 AbstractCegarLoop]: Abstraction has 5048 states and 7752 transitions. [2025-03-16 20:35:10,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5048 states and 7752 transitions. [2025-03-16 20:35:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:35:10,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:10,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:35:10,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:35:10,650 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:10,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:10,652 INFO L85 PathProgramCache]: Analyzing trace with hash -197173145, now seen corresponding path program 1 times [2025-03-16 20:35:10,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:10,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262736691] [2025-03-16 20:35:10,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:10,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:10,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:35:10,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:35:10,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:10,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:10,702 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:35:10,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:10,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262736691] [2025-03-16 20:35:10,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262736691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:10,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:10,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:35:10,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199256215] [2025-03-16 20:35:10,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:10,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:35:10,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:10,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:35:10,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:35:10,705 INFO L87 Difference]: Start difference. First operand 5048 states and 7752 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:10,788 INFO L93 Difference]: Finished difference Result 10268 states and 15594 transitions. [2025-03-16 20:35:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:35:10,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:35:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:10,807 INFO L225 Difference]: With dead ends: 10268 [2025-03-16 20:35:10,807 INFO L226 Difference]: Without dead ends: 7530 [2025-03-16 20:35:10,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:35:10,814 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 1505 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1744 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:35:10,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1744 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:35:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7530 states. [2025-03-16 20:35:10,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7530 to 7528. [2025-03-16 20:35:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7528 states, 7526 states have (on average 1.5126229072548498) internal successors, (11384), 7527 states have internal predecessors, (11384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7528 states to 7528 states and 11384 transitions. [2025-03-16 20:35:11,014 INFO L78 Accepts]: Start accepts. Automaton has 7528 states and 11384 transitions. Word has length 78 [2025-03-16 20:35:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:11,015 INFO L471 AbstractCegarLoop]: Abstraction has 7528 states and 11384 transitions. [2025-03-16 20:35:11,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 7528 states and 11384 transitions. [2025-03-16 20:35:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:35:11,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:11,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:35:11,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:35:11,016 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:11,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:11,016 INFO L85 PathProgramCache]: Analyzing trace with hash 418798183, now seen corresponding path program 1 times [2025-03-16 20:35:11,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:11,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816931278] [2025-03-16 20:35:11,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:11,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:11,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:35:11,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:35:11,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:11,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:11,069 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:35:11,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:11,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816931278] [2025-03-16 20:35:11,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816931278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:11,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:11,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:35:11,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737595667] [2025-03-16 20:35:11,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:11,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:35:11,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:11,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:35:11,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:35:11,071 INFO L87 Difference]: Start difference. First operand 7528 states and 11384 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:11,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:11,198 INFO L93 Difference]: Finished difference Result 17452 states and 26042 transitions. [2025-03-16 20:35:11,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:35:11,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:35:11,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:11,222 INFO L225 Difference]: With dead ends: 17452 [2025-03-16 20:35:11,223 INFO L226 Difference]: Without dead ends: 12234 [2025-03-16 20:35:11,231 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:35:11,232 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 1509 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 1748 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:35:11,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 1748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:35:11,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12234 states. [2025-03-16 20:35:11,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12234 to 12232. [2025-03-16 20:35:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12232 states, 12230 states have (on average 1.4829108748977924) internal successors, (18136), 12231 states have internal predecessors, (18136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:11,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12232 states to 12232 states and 18136 transitions. [2025-03-16 20:35:11,457 INFO L78 Accepts]: Start accepts. Automaton has 12232 states and 18136 transitions. Word has length 78 [2025-03-16 20:35:11,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:11,457 INFO L471 AbstractCegarLoop]: Abstraction has 12232 states and 18136 transitions. [2025-03-16 20:35:11,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 12232 states and 18136 transitions. [2025-03-16 20:35:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 20:35:11,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:11,458 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] [2025-03-16 20:35:11,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:35:11,458 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:11,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:11,458 INFO L85 PathProgramCache]: Analyzing trace with hash 214626887, now seen corresponding path program 1 times [2025-03-16 20:35:11,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:11,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542437894] [2025-03-16 20:35:11,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:11,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:11,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 20:35:11,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 20:35:11,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:11,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:11,515 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:35:11,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:11,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542437894] [2025-03-16 20:35:11,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542437894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:11,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:11,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:35:11,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092793920] [2025-03-16 20:35:11,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:11,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:35:11,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:11,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:35:11,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:35:11,517 INFO L87 Difference]: Start difference. First operand 12232 states and 18136 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:11,775 INFO L93 Difference]: Finished difference Result 22479 states and 33374 transitions. [2025-03-16 20:35:11,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:35:11,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2025-03-16 20:35:11,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:11,806 INFO L225 Difference]: With dead ends: 22479 [2025-03-16 20:35:11,806 INFO L226 Difference]: Without dead ends: 16972 [2025-03-16 20:35:11,818 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:35:11,819 INFO L435 NwaCegarLoop]: 1653 mSDtfsCounter, 1514 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:11,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1743 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:35:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16972 states. [2025-03-16 20:35:12,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16972 to 16970. [2025-03-16 20:35:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16970 states, 16968 states have (on average 1.4725365393682226) internal successors, (24986), 16969 states have internal predecessors, (24986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16970 states to 16970 states and 24986 transitions. [2025-03-16 20:35:12,174 INFO L78 Accepts]: Start accepts. Automaton has 16970 states and 24986 transitions. Word has length 80 [2025-03-16 20:35:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:12,175 INFO L471 AbstractCegarLoop]: Abstraction has 16970 states and 24986 transitions. [2025-03-16 20:35:12,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand 16970 states and 24986 transitions. [2025-03-16 20:35:12,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:35:12,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:12,179 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:35:12,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:35:12,179 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:12,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:12,180 INFO L85 PathProgramCache]: Analyzing trace with hash -134352616, now seen corresponding path program 1 times [2025-03-16 20:35:12,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:12,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679446242] [2025-03-16 20:35:12,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:12,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:12,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:35:12,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:35:12,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:12,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:35:12,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:12,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679446242] [2025-03-16 20:35:12,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679446242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:12,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:12,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:35:12,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920236044] [2025-03-16 20:35:12,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:12,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:35:12,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:12,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:35:12,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:35:12,371 INFO L87 Difference]: Start difference. First operand 16970 states and 24986 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:13,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:13,803 INFO L93 Difference]: Finished difference Result 122522 states and 178786 transitions. [2025-03-16 20:35:13,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:35:13,804 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 20:35:13,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:14,051 INFO L225 Difference]: With dead ends: 122522 [2025-03-16 20:35:14,051 INFO L226 Difference]: Without dead ends: 107864 [2025-03-16 20:35:14,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:35:14,079 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 9879 mSDsluCounter, 2815 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9879 SdHoareTripleChecker+Valid, 4486 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:14,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9879 Valid, 4486 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:35:14,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107864 states. [2025-03-16 20:35:15,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107864 to 31626. [2025-03-16 20:35:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31626 states, 31624 states have (on average 1.4599671135846193) internal successors, (46170), 31625 states have internal predecessors, (46170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31626 states to 31626 states and 46170 transitions. [2025-03-16 20:35:15,424 INFO L78 Accepts]: Start accepts. Automaton has 31626 states and 46170 transitions. Word has length 100 [2025-03-16 20:35:15,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:15,424 INFO L471 AbstractCegarLoop]: Abstraction has 31626 states and 46170 transitions. [2025-03-16 20:35:15,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 31626 states and 46170 transitions. [2025-03-16 20:35:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:35:15,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:15,429 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:35:15,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:35:15,429 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:15,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:15,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1415195624, now seen corresponding path program 1 times [2025-03-16 20:35:15,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:15,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998851150] [2025-03-16 20:35:15,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:15,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:15,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:35:15,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:35:15,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:15,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:35:15,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:15,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998851150] [2025-03-16 20:35:15,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998851150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:15,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:15,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:35:15,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889334905] [2025-03-16 20:35:15,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:15,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:35:15,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:15,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:35:15,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:35:15,631 INFO L87 Difference]: Start difference. First operand 31626 states and 46170 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:17,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:17,851 INFO L93 Difference]: Finished difference Result 137178 states and 199970 transitions. [2025-03-16 20:35:17,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:35:17,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 20:35:17,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:18,070 INFO L225 Difference]: With dead ends: 137178 [2025-03-16 20:35:18,071 INFO L226 Difference]: Without dead ends: 122520 [2025-03-16 20:35:18,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:35:18,101 INFO L435 NwaCegarLoop]: 1668 mSDtfsCounter, 9903 mSDsluCounter, 2682 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9903 SdHoareTripleChecker+Valid, 4350 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:18,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9903 Valid, 4350 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:35:18,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122520 states. [2025-03-16 20:35:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122520 to 53642. [2025-03-16 20:35:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53642 states, 53640 states have (on average 1.4501491424310216) internal successors, (77786), 53641 states have internal predecessors, (77786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:19,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53642 states to 53642 states and 77786 transitions. [2025-03-16 20:35:19,693 INFO L78 Accepts]: Start accepts. Automaton has 53642 states and 77786 transitions. Word has length 100 [2025-03-16 20:35:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:19,695 INFO L471 AbstractCegarLoop]: Abstraction has 53642 states and 77786 transitions. [2025-03-16 20:35:19,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 53642 states and 77786 transitions. [2025-03-16 20:35:19,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:35:19,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:19,699 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:35:19,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:35:19,700 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:19,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:19,701 INFO L85 PathProgramCache]: Analyzing trace with hash -571836648, now seen corresponding path program 1 times [2025-03-16 20:35:19,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:19,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183575992] [2025-03-16 20:35:19,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:19,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:19,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:35:19,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:35:19,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:19,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:35:19,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:19,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183575992] [2025-03-16 20:35:19,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183575992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:19,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:19,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:35:19,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758026804] [2025-03-16 20:35:19,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:19,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:35:19,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:19,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:35:19,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:35:19,868 INFO L87 Difference]: Start difference. First operand 53642 states and 77786 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:22,883 INFO L93 Difference]: Finished difference Result 151834 states and 221154 transitions. [2025-03-16 20:35:22,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:35:22,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 20:35:22,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:23,095 INFO L225 Difference]: With dead ends: 151834 [2025-03-16 20:35:23,095 INFO L226 Difference]: Without dead ends: 137176 [2025-03-16 20:35:23,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:35:23,133 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 10003 mSDsluCounter, 2583 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10003 SdHoareTripleChecker+Valid, 4248 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:23,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10003 Valid, 4248 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:35:23,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137176 states. [2025-03-16 20:35:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137176 to 68298. [2025-03-16 20:35:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68298 states, 68296 states have (on average 1.4491331849595877) internal successors, (98970), 68297 states have internal predecessors, (98970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:25,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68298 states to 68298 states and 98970 transitions. [2025-03-16 20:35:25,267 INFO L78 Accepts]: Start accepts. Automaton has 68298 states and 98970 transitions. Word has length 100 [2025-03-16 20:35:25,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:25,268 INFO L471 AbstractCegarLoop]: Abstraction has 68298 states and 98970 transitions. [2025-03-16 20:35:25,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:25,269 INFO L276 IsEmpty]: Start isEmpty. Operand 68298 states and 98970 transitions. [2025-03-16 20:35:25,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:35:25,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:25,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:35:25,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:35:25,274 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:25,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:25,274 INFO L85 PathProgramCache]: Analyzing trace with hash 185203992, now seen corresponding path program 1 times [2025-03-16 20:35:25,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:25,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668950401] [2025-03-16 20:35:25,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:25,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:25,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:35:25,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:35:25,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:25,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:25,421 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 20:35:25,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:25,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668950401] [2025-03-16 20:35:25,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668950401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:25,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:25,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:35:25,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911522996] [2025-03-16 20:35:25,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:25,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:35:25,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:25,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:35:25,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:35:25,423 INFO L87 Difference]: Start difference. First operand 68298 states and 98970 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:29,132 INFO L93 Difference]: Finished difference Result 166490 states and 242338 transitions. [2025-03-16 20:35:29,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:35:29,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 20:35:29,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:29,329 INFO L225 Difference]: With dead ends: 166490 [2025-03-16 20:35:29,329 INFO L226 Difference]: Without dead ends: 151832 [2025-03-16 20:35:29,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:35:29,369 INFO L435 NwaCegarLoop]: 1662 mSDtfsCounter, 10088 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10088 SdHoareTripleChecker+Valid, 4305 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:29,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10088 Valid, 4305 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:35:29,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151832 states. [2025-03-16 20:35:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151832 to 82954. [2025-03-16 20:35:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82954 states, 82952 states have (on average 1.4484762272157392) internal successors, (120154), 82953 states have internal predecessors, (120154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82954 states to 82954 states and 120154 transitions. [2025-03-16 20:35:31,955 INFO L78 Accepts]: Start accepts. Automaton has 82954 states and 120154 transitions. Word has length 100 [2025-03-16 20:35:31,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:31,955 INFO L471 AbstractCegarLoop]: Abstraction has 82954 states and 120154 transitions. [2025-03-16 20:35:31,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:31,955 INFO L276 IsEmpty]: Start isEmpty. Operand 82954 states and 120154 transitions. [2025-03-16 20:35:31,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:35:31,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:31,960 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:35:31,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:35:31,960 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:31,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:31,961 INFO L85 PathProgramCache]: Analyzing trace with hash -364584936, now seen corresponding path program 1 times [2025-03-16 20:35:31,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:31,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654869546] [2025-03-16 20:35:31,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:31,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:31,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:35:31,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:35:31,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:31,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:32,110 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:35:32,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:32,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654869546] [2025-03-16 20:35:32,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654869546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:32,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:32,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:35:32,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176880276] [2025-03-16 20:35:32,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:32,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:35:32,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:32,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:35:32,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:35:32,113 INFO L87 Difference]: Start difference. First operand 82954 states and 120154 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:36,277 INFO L93 Difference]: Finished difference Result 181146 states and 263522 transitions. [2025-03-16 20:35:36,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:35:36,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 20:35:36,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:36,545 INFO L225 Difference]: With dead ends: 181146 [2025-03-16 20:35:36,545 INFO L226 Difference]: Without dead ends: 166488 [2025-03-16 20:35:36,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:35:36,599 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 9954 mSDsluCounter, 2654 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9954 SdHoareTripleChecker+Valid, 4317 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:36,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9954 Valid, 4317 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:35:36,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166488 states. [2025-03-16 20:35:39,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166488 to 97610. [2025-03-16 20:35:39,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97610 states, 97608 states have (on average 1.4480165560199985) internal successors, (141338), 97609 states have internal predecessors, (141338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:39,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97610 states to 97610 states and 141338 transitions. [2025-03-16 20:35:39,573 INFO L78 Accepts]: Start accepts. Automaton has 97610 states and 141338 transitions. Word has length 100 [2025-03-16 20:35:39,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:39,573 INFO L471 AbstractCegarLoop]: Abstraction has 97610 states and 141338 transitions. [2025-03-16 20:35:39,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 97610 states and 141338 transitions. [2025-03-16 20:35:39,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:35:39,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:39,581 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:35:39,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:35:39,581 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:39,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:39,582 INFO L85 PathProgramCache]: Analyzing trace with hash 251386392, now seen corresponding path program 1 times [2025-03-16 20:35:39,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:39,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799489655] [2025-03-16 20:35:39,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:39,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:39,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:35:39,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:35:39,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:39,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:39,710 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 20:35:39,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:39,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799489655] [2025-03-16 20:35:39,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799489655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:39,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:39,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:35:39,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321579935] [2025-03-16 20:35:39,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:39,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:35:39,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:39,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:35:39,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:35:39,711 INFO L87 Difference]: Start difference. First operand 97610 states and 141338 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 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:35:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:42,959 INFO L93 Difference]: Finished difference Result 195802 states and 284706 transitions. [2025-03-16 20:35:42,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:35:42,960 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 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 100 [2025-03-16 20:35:42,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:43,292 INFO L225 Difference]: With dead ends: 195802 [2025-03-16 20:35:43,292 INFO L226 Difference]: Without dead ends: 181144 [2025-03-16 20:35:43,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:35:43,363 INFO L435 NwaCegarLoop]: 1670 mSDtfsCounter, 9817 mSDsluCounter, 2873 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9817 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:43,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9817 Valid, 4543 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:35:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181144 states. [2025-03-16 20:35:46,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181144 to 112266. [2025-03-16 20:35:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112266 states, 112264 states have (on average 1.4476769044395355) internal successors, (162522), 112265 states have internal predecessors, (162522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112266 states to 112266 states and 162522 transitions. [2025-03-16 20:35:46,831 INFO L78 Accepts]: Start accepts. Automaton has 112266 states and 162522 transitions. Word has length 100 [2025-03-16 20:35:46,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:46,832 INFO L471 AbstractCegarLoop]: Abstraction has 112266 states and 162522 transitions. [2025-03-16 20:35:46,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 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:35:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand 112266 states and 162522 transitions. [2025-03-16 20:35:46,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 20:35:46,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:46,838 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] [2025-03-16 20:35:46,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:35:46,838 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:46,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:46,839 INFO L85 PathProgramCache]: Analyzing trace with hash -226662886, now seen corresponding path program 1 times [2025-03-16 20:35:46,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:46,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636124498] [2025-03-16 20:35:46,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:46,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:46,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 20:35:46,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 20:35:46,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:46,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:35:46,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:46,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636124498] [2025-03-16 20:35:46,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636124498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:46,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:46,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:35:46,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261621003] [2025-03-16 20:35:46,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:46,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:35:46,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:46,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:35:46,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:35:46,950 INFO L87 Difference]: Start difference. First operand 112266 states and 162522 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:35:49,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:49,081 INFO L93 Difference]: Finished difference Result 189093 states and 274868 transitions. [2025-03-16 20:35:49,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:35:49,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 102 [2025-03-16 20:35:49,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:49,186 INFO L225 Difference]: With dead ends: 189093 [2025-03-16 20:35:49,186 INFO L226 Difference]: Without dead ends: 79139 [2025-03-16 20:35:49,243 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:35:49,244 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 66 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 3205 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:49,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 3205 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:35:49,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79139 states.