./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.03.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/systemc/transmitter.03.cil.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 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:55:09,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:55:09,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:55:09,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:55:09,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:55:09,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:55:09,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:55:09,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:55:09,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:55:09,926 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:55:09,926 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:55:09,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:55:09,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:55:09,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:55:09,927 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:55:09,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:55:09,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:55:09,927 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:55:09,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:55:09,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:55:09,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:55:09,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:55:09,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:55:09,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:55:09,928 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:55:09,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:55:09,928 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:55:09,928 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:55:09,928 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:55:09,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:55:09,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:55:09,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:55:09,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:55:09,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:55:09,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:55:09,928 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:55:09,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:55:09,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:55:09,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:55:09,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:55:09,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:55:09,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:55:09,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:55:09,929 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 -> 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 [2025-03-08 05:55:10,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:55:10,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:55:10,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:55:10,204 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:55:10,204 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:55:10,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.03.cil.c [2025-03-08 05:55:11,369 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46bb0f74c/21df4c6ac3274d79b1cd7b8559493ef7/FLAG2541ab0b5 [2025-03-08 05:55:11,629 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:55:11,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.03.cil.c [2025-03-08 05:55:11,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46bb0f74c/21df4c6ac3274d79b1cd7b8559493ef7/FLAG2541ab0b5 [2025-03-08 05:55:11,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46bb0f74c/21df4c6ac3274d79b1cd7b8559493ef7 [2025-03-08 05:55:11,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:55:11,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:55:11,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:55:11,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:55:11,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:55:11,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:55:11" (1/1) ... [2025-03-08 05:55:11,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2d9ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:11, skipping insertion in model container [2025-03-08 05:55:11,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:55:11" (1/1) ... [2025-03-08 05:55:11,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:55:11,814 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/systemc/transmitter.03.cil.c[706,719] [2025-03-08 05:55:11,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:55:11,872 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:55:11,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/systemc/transmitter.03.cil.c[706,719] [2025-03-08 05:55:11,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:55:11,917 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:55:11,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:11 WrapperNode [2025-03-08 05:55:11,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:55:11,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:55:11,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:55:11,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:55:11,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:11" (1/1) ... [2025-03-08 05:55:11,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:11" (1/1) ... [2025-03-08 05:55:11,956 INFO L138 Inliner]: procedures = 34, calls = 39, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 307 [2025-03-08 05:55:11,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:55:11,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:55:11,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:55:11,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:55:11,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:11" (1/1) ... [2025-03-08 05:55:11,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:11" (1/1) ... [2025-03-08 05:55:11,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:11" (1/1) ... [2025-03-08 05:55:11,981 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-08 05:55:11,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:11" (1/1) ... [2025-03-08 05:55:11,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:11" (1/1) ... [2025-03-08 05:55:11,989 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:11" (1/1) ... [2025-03-08 05:55:11,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:11" (1/1) ... [2025-03-08 05:55:11,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:11" (1/1) ... [2025-03-08 05:55:11,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:11" (1/1) ... [2025-03-08 05:55:11,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:55:12,000 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:55:12,000 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:55:12,000 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:55:12,001 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:11" (1/1) ... [2025-03-08 05:55:12,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:55:12,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:55:12,036 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-08 05:55:12,039 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-08 05:55:12,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:55:12,059 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 05:55:12,059 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 05:55:12,059 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 05:55:12,060 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 05:55:12,060 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 05:55:12,060 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 05:55:12,060 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 05:55:12,060 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 05:55:12,060 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 05:55:12,060 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 05:55:12,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:55:12,061 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 05:55:12,061 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 05:55:12,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:55:12,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:55:12,128 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:55:12,130 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:55:12,509 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-08 05:55:12,511 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:55:12,520 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:55:12,520 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:55:12,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:55:12 BoogieIcfgContainer [2025-03-08 05:55:12,521 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:55:12,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:55:12,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:55:12,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:55:12,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:55:11" (1/3) ... [2025-03-08 05:55:12,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f79f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:55:12, skipping insertion in model container [2025-03-08 05:55:12,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:11" (2/3) ... [2025-03-08 05:55:12,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f79f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:55:12, skipping insertion in model container [2025-03-08 05:55:12,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:55:12" (3/3) ... [2025-03-08 05:55:12,532 INFO L128 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2025-03-08 05:55:12,541 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:55:12,543 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG transmitter.03.cil.c that has 7 procedures, 150 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-08 05:55:12,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:55:12,602 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;@48de70e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:55:12,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:55:12,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 127 states have (on average 1.5354330708661417) internal successors, (195), 128 states have internal predecessors, (195), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 05:55:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:55:12,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:12,616 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-08 05:55:12,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:12,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:12,621 INFO L85 PathProgramCache]: Analyzing trace with hash -138759804, now seen corresponding path program 1 times [2025-03-08 05:55:12,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:12,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902751329] [2025-03-08 05:55:12,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:12,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:12,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:55:12,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:55:12,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:12,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:12,990 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-08 05:55:12,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:12,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902751329] [2025-03-08 05:55:12,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902751329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:12,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:12,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:12,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49177206] [2025-03-08 05:55:12,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:12,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:12,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:13,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:13,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:13,012 INFO L87 Difference]: Start difference. First operand has 150 states, 127 states have (on average 1.5354330708661417) internal successors, (195), 128 states have internal predecessors, (195), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:13,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:13,331 INFO L93 Difference]: Finished difference Result 436 states and 673 transitions. [2025-03-08 05:55:13,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:55:13,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 05:55:13,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:13,345 INFO L225 Difference]: With dead ends: 436 [2025-03-08 05:55:13,345 INFO L226 Difference]: Without dead ends: 289 [2025-03-08 05:55:13,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:13,354 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 367 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:13,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 580 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:55:13,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-08 05:55:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 278. [2025-03-08 05:55:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 237 states have (on average 1.4978902953586497) internal successors, (355), 239 states have internal predecessors, (355), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2025-03-08 05:55:13,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 410 transitions. [2025-03-08 05:55:13,407 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 410 transitions. Word has length 77 [2025-03-08 05:55:13,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:13,407 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 410 transitions. [2025-03-08 05:55:13,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:13,408 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 410 transitions. [2025-03-08 05:55:13,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:55:13,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:13,411 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-08 05:55:13,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:55:13,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:13,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:13,412 INFO L85 PathProgramCache]: Analyzing trace with hash -520731929, now seen corresponding path program 1 times [2025-03-08 05:55:13,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:13,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060022557] [2025-03-08 05:55:13,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:13,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:13,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:55:13,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:55:13,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:13,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:13,544 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-08 05:55:13,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:13,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060022557] [2025-03-08 05:55:13,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060022557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:13,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:13,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:13,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73121945] [2025-03-08 05:55:13,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:13,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:13,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:13,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:13,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:13,546 INFO L87 Difference]: Start difference. First operand 278 states and 410 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:13,756 INFO L93 Difference]: Finished difference Result 566 states and 843 transitions. [2025-03-08 05:55:13,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:55:13,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 05:55:13,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:13,758 INFO L225 Difference]: With dead ends: 566 [2025-03-08 05:55:13,758 INFO L226 Difference]: Without dead ends: 299 [2025-03-08 05:55:13,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:13,760 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 268 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:13,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 391 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:55:13,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-08 05:55:13,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 278. [2025-03-08 05:55:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 237 states have (on average 1.489451476793249) internal successors, (353), 239 states have internal predecessors, (353), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2025-03-08 05:55:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 408 transitions. [2025-03-08 05:55:13,784 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 408 transitions. Word has length 77 [2025-03-08 05:55:13,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:13,785 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 408 transitions. [2025-03-08 05:55:13,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:13,785 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 408 transitions. [2025-03-08 05:55:13,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:55:13,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:13,786 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-08 05:55:13,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:55:13,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:13,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:13,787 INFO L85 PathProgramCache]: Analyzing trace with hash -729430232, now seen corresponding path program 1 times [2025-03-08 05:55:13,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:13,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789008750] [2025-03-08 05:55:13,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:13,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:13,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:55:13,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:55:13,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:13,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:13,923 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-08 05:55:13,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:13,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789008750] [2025-03-08 05:55:13,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789008750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:13,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:13,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:13,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102549574] [2025-03-08 05:55:13,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:13,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:13,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:13,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:13,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:13,925 INFO L87 Difference]: Start difference. First operand 278 states and 408 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:14,366 INFO L93 Difference]: Finished difference Result 732 states and 1078 transitions. [2025-03-08 05:55:14,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:55:14,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 05:55:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:14,370 INFO L225 Difference]: With dead ends: 732 [2025-03-08 05:55:14,371 INFO L226 Difference]: Without dead ends: 465 [2025-03-08 05:55:14,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:55:14,373 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 381 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:14,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1006 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:55:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-08 05:55:14,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 402. [2025-03-08 05:55:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 343 states have (on average 1.478134110787172) internal successors, (507), 346 states have internal predecessors, (507), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (42), 39 states have call predecessors, (42), 38 states have call successors, (42) [2025-03-08 05:55:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 587 transitions. [2025-03-08 05:55:14,414 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 587 transitions. Word has length 77 [2025-03-08 05:55:14,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:14,415 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 587 transitions. [2025-03-08 05:55:14,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 587 transitions. [2025-03-08 05:55:14,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:55:14,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:14,418 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-08 05:55:14,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:55:14,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:14,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:14,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1757689543, now seen corresponding path program 1 times [2025-03-08 05:55:14,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:14,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793246810] [2025-03-08 05:55:14,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:14,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:14,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:55:14,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:55:14,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:14,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:14,520 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-08 05:55:14,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:14,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793246810] [2025-03-08 05:55:14,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793246810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:14,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:14,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:14,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810633389] [2025-03-08 05:55:14,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:14,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:14,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:14,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:14,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:14,524 INFO L87 Difference]: Start difference. First operand 402 states and 587 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:14,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:14,946 INFO L93 Difference]: Finished difference Result 1114 states and 1634 transitions. [2025-03-08 05:55:14,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:55:14,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 05:55:14,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:14,950 INFO L225 Difference]: With dead ends: 1114 [2025-03-08 05:55:14,950 INFO L226 Difference]: Without dead ends: 723 [2025-03-08 05:55:14,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:55:14,951 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 376 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:14,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 990 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:55:14,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-03-08 05:55:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 659. [2025-03-08 05:55:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 562 states have (on average 1.4697508896797153) internal successors, (826), 569 states have internal predecessors, (826), 60 states have call successors, (60), 30 states have call predecessors, (60), 36 states have return successors, (76), 63 states have call predecessors, (76), 60 states have call successors, (76) [2025-03-08 05:55:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 962 transitions. [2025-03-08 05:55:14,990 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 962 transitions. Word has length 77 [2025-03-08 05:55:14,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:14,990 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 962 transitions. [2025-03-08 05:55:14,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:14,991 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 962 transitions. [2025-03-08 05:55:14,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:55:14,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:14,992 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-08 05:55:14,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:55:14,993 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:14,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:14,993 INFO L85 PathProgramCache]: Analyzing trace with hash 590993224, now seen corresponding path program 1 times [2025-03-08 05:55:14,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:14,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504010961] [2025-03-08 05:55:14,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:14,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:15,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:55:15,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:55:15,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:15,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:15,089 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-08 05:55:15,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:15,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504010961] [2025-03-08 05:55:15,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504010961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:15,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:15,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:15,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744584053] [2025-03-08 05:55:15,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:15,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:15,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:15,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:15,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:15,091 INFO L87 Difference]: Start difference. First operand 659 states and 962 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:15,277 INFO L93 Difference]: Finished difference Result 1351 states and 1990 transitions. [2025-03-08 05:55:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:55:15,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 05:55:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:15,281 INFO L225 Difference]: With dead ends: 1351 [2025-03-08 05:55:15,281 INFO L226 Difference]: Without dead ends: 703 [2025-03-08 05:55:15,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:15,283 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 261 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:15,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 369 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:55:15,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2025-03-08 05:55:15,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 659. [2025-03-08 05:55:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 562 states have (on average 1.4608540925266904) internal successors, (821), 569 states have internal predecessors, (821), 60 states have call successors, (60), 30 states have call predecessors, (60), 36 states have return successors, (76), 63 states have call predecessors, (76), 60 states have call successors, (76) [2025-03-08 05:55:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 957 transitions. [2025-03-08 05:55:15,330 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 957 transitions. Word has length 77 [2025-03-08 05:55:15,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:15,330 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 957 transitions. [2025-03-08 05:55:15,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:15,330 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 957 transitions. [2025-03-08 05:55:15,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:55:15,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:15,331 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-08 05:55:15,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:55:15,332 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:15,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:15,332 INFO L85 PathProgramCache]: Analyzing trace with hash 691905191, now seen corresponding path program 1 times [2025-03-08 05:55:15,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:15,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287316667] [2025-03-08 05:55:15,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:15,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:15,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:55:15,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:55:15,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:15,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:15,419 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-08 05:55:15,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:15,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287316667] [2025-03-08 05:55:15,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287316667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:15,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:15,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:15,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491782645] [2025-03-08 05:55:15,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:15,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:15,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:15,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:15,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:15,420 INFO L87 Difference]: Start difference. First operand 659 states and 957 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:15,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:15,896 INFO L93 Difference]: Finished difference Result 1941 states and 2833 transitions. [2025-03-08 05:55:15,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:55:15,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 05:55:15,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:15,904 INFO L225 Difference]: With dead ends: 1941 [2025-03-08 05:55:15,904 INFO L226 Difference]: Without dead ends: 1293 [2025-03-08 05:55:15,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:55:15,908 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 407 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:15,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 943 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:55:15,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2025-03-08 05:55:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1173. [2025-03-08 05:55:15,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 998 states have (on average 1.4539078156312626) internal successors, (1451), 1019 states have internal predecessors, (1451), 100 states have call successors, (100), 54 states have call predecessors, (100), 74 states have return successors, (164), 107 states have call predecessors, (164), 100 states have call successors, (164) [2025-03-08 05:55:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1715 transitions. [2025-03-08 05:55:16,004 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1715 transitions. Word has length 77 [2025-03-08 05:55:16,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:16,004 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1715 transitions. [2025-03-08 05:55:16,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:16,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1715 transitions. [2025-03-08 05:55:16,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:55:16,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:16,033 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-08 05:55:16,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:55:16,033 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:16,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:16,033 INFO L85 PathProgramCache]: Analyzing trace with hash 972255080, now seen corresponding path program 1 times [2025-03-08 05:55:16,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:16,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822081728] [2025-03-08 05:55:16,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:16,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:16,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:55:16,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:55:16,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:16,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:16,080 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-08 05:55:16,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:16,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822081728] [2025-03-08 05:55:16,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822081728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:16,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:16,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:16,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61788647] [2025-03-08 05:55:16,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:16,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:16,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:16,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:16,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:16,082 INFO L87 Difference]: Start difference. First operand 1173 states and 1715 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:16,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:16,273 INFO L93 Difference]: Finished difference Result 2393 states and 3526 transitions. [2025-03-08 05:55:16,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:55:16,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 05:55:16,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:16,279 INFO L225 Difference]: With dead ends: 2393 [2025-03-08 05:55:16,280 INFO L226 Difference]: Without dead ends: 1231 [2025-03-08 05:55:16,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:16,282 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 257 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:16,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 355 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:55:16,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2025-03-08 05:55:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1173. [2025-03-08 05:55:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 998 states have (on average 1.4448897795591182) internal successors, (1442), 1019 states have internal predecessors, (1442), 100 states have call successors, (100), 54 states have call predecessors, (100), 74 states have return successors, (164), 107 states have call predecessors, (164), 100 states have call successors, (164) [2025-03-08 05:55:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1706 transitions. [2025-03-08 05:55:16,354 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1706 transitions. Word has length 77 [2025-03-08 05:55:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:16,355 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1706 transitions. [2025-03-08 05:55:16,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:16,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1706 transitions. [2025-03-08 05:55:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:55:16,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:16,357 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-08 05:55:16,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:55:16,358 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:16,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:16,358 INFO L85 PathProgramCache]: Analyzing trace with hash -958364025, now seen corresponding path program 1 times [2025-03-08 05:55:16,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:16,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43292701] [2025-03-08 05:55:16,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:16,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:16,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:55:16,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:55:16,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:16,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:16,403 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-08 05:55:16,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:16,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43292701] [2025-03-08 05:55:16,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43292701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:16,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:16,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:16,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853740968] [2025-03-08 05:55:16,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:16,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:16,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:16,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:16,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:16,405 INFO L87 Difference]: Start difference. First operand 1173 states and 1706 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:16,483 INFO L93 Difference]: Finished difference Result 2337 states and 3440 transitions. [2025-03-08 05:55:16,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:55:16,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 05:55:16,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:16,490 INFO L225 Difference]: With dead ends: 2337 [2025-03-08 05:55:16,490 INFO L226 Difference]: Without dead ends: 1176 [2025-03-08 05:55:16,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:16,494 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:16,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 826 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:55:16,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2025-03-08 05:55:16,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1176. [2025-03-08 05:55:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 1001 states have (on average 1.4355644355644355) internal successors, (1437), 1022 states have internal predecessors, (1437), 100 states have call successors, (100), 54 states have call predecessors, (100), 74 states have return successors, (164), 107 states have call predecessors, (164), 100 states have call successors, (164) [2025-03-08 05:55:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1701 transitions. [2025-03-08 05:55:16,561 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1701 transitions. Word has length 77 [2025-03-08 05:55:16,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:16,561 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1701 transitions. [2025-03-08 05:55:16,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1701 transitions. [2025-03-08 05:55:16,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:55:16,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:16,565 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-08 05:55:16,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:55:16,566 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:16,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:16,566 INFO L85 PathProgramCache]: Analyzing trace with hash -966123384, now seen corresponding path program 1 times [2025-03-08 05:55:16,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:16,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961472174] [2025-03-08 05:55:16,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:16,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:16,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:55:16,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:55:16,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:16,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:16,613 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-08 05:55:16,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:16,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961472174] [2025-03-08 05:55:16,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961472174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:16,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:16,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:55:16,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505355966] [2025-03-08 05:55:16,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:16,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:55:16,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:16,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:55:16,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:55:16,616 INFO L87 Difference]: Start difference. First operand 1176 states and 1701 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:16,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:16,805 INFO L93 Difference]: Finished difference Result 3470 states and 5047 transitions. [2025-03-08 05:55:16,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:55:16,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 05:55:16,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:16,819 INFO L225 Difference]: With dead ends: 3470 [2025-03-08 05:55:16,819 INFO L226 Difference]: Without dead ends: 2306 [2025-03-08 05:55:16,822 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-08 05:55:16,824 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 360 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:16,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 707 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:55:16,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2025-03-08 05:55:16,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2294. [2025-03-08 05:55:16,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 1954 states have (on average 1.4257932446264074) internal successors, (2786), 1995 states have internal predecessors, (2786), 191 states have call successors, (191), 108 states have call predecessors, (191), 148 states have return successors, (312), 198 states have call predecessors, (312), 191 states have call successors, (312) [2025-03-08 05:55:16,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 3289 transitions. [2025-03-08 05:55:16,928 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 3289 transitions. Word has length 77 [2025-03-08 05:55:16,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:16,928 INFO L471 AbstractCegarLoop]: Abstraction has 2294 states and 3289 transitions. [2025-03-08 05:55:16,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:16,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 3289 transitions. [2025-03-08 05:55:16,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:55:16,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:16,931 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-08 05:55:16,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:55:16,931 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:16,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:16,931 INFO L85 PathProgramCache]: Analyzing trace with hash -923456629, now seen corresponding path program 1 times [2025-03-08 05:55:16,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:16,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851700840] [2025-03-08 05:55:16,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:16,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:16,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:55:16,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:55:16,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:16,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:16,977 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-08 05:55:16,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:16,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851700840] [2025-03-08 05:55:16,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851700840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:16,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:16,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:16,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747323412] [2025-03-08 05:55:16,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:16,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:16,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:16,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:16,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:16,979 INFO L87 Difference]: Start difference. First operand 2294 states and 3289 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:17,114 INFO L93 Difference]: Finished difference Result 4603 states and 6675 transitions. [2025-03-08 05:55:17,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:55:17,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 05:55:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:17,126 INFO L225 Difference]: With dead ends: 4603 [2025-03-08 05:55:17,126 INFO L226 Difference]: Without dead ends: 2321 [2025-03-08 05:55:17,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:17,133 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:17,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 826 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:55:17,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2025-03-08 05:55:17,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2025-03-08 05:55:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 1981 states have (on average 1.4154467440686522) internal successors, (2804), 2022 states have internal predecessors, (2804), 191 states have call successors, (191), 108 states have call predecessors, (191), 148 states have return successors, (312), 198 states have call predecessors, (312), 191 states have call successors, (312) [2025-03-08 05:55:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 3307 transitions. [2025-03-08 05:55:17,249 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 3307 transitions. Word has length 77 [2025-03-08 05:55:17,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:17,249 INFO L471 AbstractCegarLoop]: Abstraction has 2321 states and 3307 transitions. [2025-03-08 05:55:17,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:17,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 3307 transitions. [2025-03-08 05:55:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:55:17,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:17,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:17,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:55:17,251 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:17,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:17,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1372153268, now seen corresponding path program 1 times [2025-03-08 05:55:17,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:17,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444926731] [2025-03-08 05:55:17,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:17,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:17,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:55:17,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:55:17,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:17,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:17,292 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-08 05:55:17,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:17,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444926731] [2025-03-08 05:55:17,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444926731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:17,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:17,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:17,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901235869] [2025-03-08 05:55:17,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:17,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:17,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:17,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:17,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:17,294 INFO L87 Difference]: Start difference. First operand 2321 states and 3307 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:17,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:17,905 INFO L93 Difference]: Finished difference Result 13337 states and 19445 transitions. [2025-03-08 05:55:17,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:55:17,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 05:55:17,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:17,950 INFO L225 Difference]: With dead ends: 13337 [2025-03-08 05:55:17,950 INFO L226 Difference]: Without dead ends: 11028 [2025-03-08 05:55:17,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:55:17,960 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 907 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:17,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 894 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:55:17,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11028 states. [2025-03-08 05:55:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11028 to 10836. [2025-03-08 05:55:18,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10836 states, 9272 states have (on average 1.4155522001725624) internal successors, (13125), 9491 states have internal predecessors, (13125), 836 states have call successors, (836), 527 states have call predecessors, (836), 727 states have return successors, (1626), 825 states have call predecessors, (1626), 836 states have call successors, (1626) [2025-03-08 05:55:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10836 states to 10836 states and 15587 transitions. [2025-03-08 05:55:18,647 INFO L78 Accepts]: Start accepts. Automaton has 10836 states and 15587 transitions. Word has length 77 [2025-03-08 05:55:18,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:18,647 INFO L471 AbstractCegarLoop]: Abstraction has 10836 states and 15587 transitions. [2025-03-08 05:55:18,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 10836 states and 15587 transitions. [2025-03-08 05:55:18,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:55:18,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:18,649 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-08 05:55:18,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:55:18,649 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:18,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:18,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1936006257, now seen corresponding path program 1 times [2025-03-08 05:55:18,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:18,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838815012] [2025-03-08 05:55:18,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:18,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:18,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:55:18,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:55:18,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:18,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:18,691 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-08 05:55:18,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:18,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838815012] [2025-03-08 05:55:18,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838815012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:18,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:18,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:18,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913981278] [2025-03-08 05:55:18,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:18,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:18,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:18,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:18,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:18,692 INFO L87 Difference]: Start difference. First operand 10836 states and 15587 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:19,118 INFO L93 Difference]: Finished difference Result 21768 states and 31805 transitions. [2025-03-08 05:55:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:55:19,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 05:55:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:19,178 INFO L225 Difference]: With dead ends: 21768 [2025-03-08 05:55:19,178 INFO L226 Difference]: Without dead ends: 10944 [2025-03-08 05:55:19,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:19,204 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:19,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 826 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:55:19,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10944 states. [2025-03-08 05:55:19,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10944 to 10944. [2025-03-08 05:55:19,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10944 states, 9380 states have (on average 1.4050106609808102) internal successors, (13179), 9599 states have internal predecessors, (13179), 836 states have call successors, (836), 527 states have call predecessors, (836), 727 states have return successors, (1626), 825 states have call predecessors, (1626), 836 states have call successors, (1626) [2025-03-08 05:55:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10944 states to 10944 states and 15641 transitions. [2025-03-08 05:55:19,713 INFO L78 Accepts]: Start accepts. Automaton has 10944 states and 15641 transitions. Word has length 77 [2025-03-08 05:55:19,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:19,713 INFO L471 AbstractCegarLoop]: Abstraction has 10944 states and 15641 transitions. [2025-03-08 05:55:19,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:19,714 INFO L276 IsEmpty]: Start isEmpty. Operand 10944 states and 15641 transitions. [2025-03-08 05:55:19,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:55:19,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:19,715 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-08 05:55:19,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:55:19,716 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:19,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:19,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1606240496, now seen corresponding path program 1 times [2025-03-08 05:55:19,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:19,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751141543] [2025-03-08 05:55:19,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:19,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:19,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:55:19,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:55:19,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:19,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:19,745 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-08 05:55:19,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:19,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751141543] [2025-03-08 05:55:19,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751141543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:19,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:19,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:55:19,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111009474] [2025-03-08 05:55:19,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:19,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:55:19,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:19,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:55:19,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:55:19,747 INFO L87 Difference]: Start difference. First operand 10944 states and 15641 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:20,981 INFO L93 Difference]: Finished difference Result 32624 states and 47110 transitions. [2025-03-08 05:55:20,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:55:20,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 05:55:20,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:21,055 INFO L225 Difference]: With dead ends: 32624 [2025-03-08 05:55:21,055 INFO L226 Difference]: Without dead ends: 21692 [2025-03-08 05:55:21,081 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-08 05:55:21,082 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 374 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:21,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 709 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:55:21,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21692 states. [2025-03-08 05:55:21,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21692 to 21602. [2025-03-08 05:55:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21602 states, 18479 states have (on average 1.3914713999675308) internal successors, (25713), 18916 states have internal predecessors, (25713), 1668 states have call successors, (1668), 1054 states have call predecessors, (1668), 1454 states have return successors, (3241), 1639 states have call predecessors, (3241), 1668 states have call successors, (3241) [2025-03-08 05:55:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21602 states to 21602 states and 30622 transitions. [2025-03-08 05:55:22,004 INFO L78 Accepts]: Start accepts. Automaton has 21602 states and 30622 transitions. Word has length 77 [2025-03-08 05:55:22,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:22,005 INFO L471 AbstractCegarLoop]: Abstraction has 21602 states and 30622 transitions. [2025-03-08 05:55:22,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:22,006 INFO L276 IsEmpty]: Start isEmpty. Operand 21602 states and 30622 transitions. [2025-03-08 05:55:22,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:55:22,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:22,013 INFO L218 NwaCegarLoop]: trace histogram [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-08 05:55:22,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:55:22,013 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:22,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:22,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1827456578, now seen corresponding path program 1 times [2025-03-08 05:55:22,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:22,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486523031] [2025-03-08 05:55:22,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:22,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:22,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:55:22,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:55:22,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:22,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:55:22,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:22,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486523031] [2025-03-08 05:55:22,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486523031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:22,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:22,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:22,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643546956] [2025-03-08 05:55:22,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:22,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:22,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:22,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:22,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:22,065 INFO L87 Difference]: Start difference. First operand 21602 states and 30622 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:22,740 INFO L93 Difference]: Finished difference Result 43462 states and 62596 transitions. [2025-03-08 05:55:22,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:55:22,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 94 [2025-03-08 05:55:22,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:22,828 INFO L225 Difference]: With dead ends: 43462 [2025-03-08 05:55:22,829 INFO L226 Difference]: Without dead ends: 21872 [2025-03-08 05:55:22,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:22,874 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:22,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 826 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:55:22,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21872 states. [2025-03-08 05:55:24,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21872 to 21872. [2025-03-08 05:55:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21872 states, 18749 states have (on average 1.3810336551282736) internal successors, (25893), 19186 states have internal predecessors, (25893), 1668 states have call successors, (1668), 1054 states have call predecessors, (1668), 1454 states have return successors, (3241), 1639 states have call predecessors, (3241), 1668 states have call successors, (3241) [2025-03-08 05:55:24,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21872 states to 21872 states and 30802 transitions. [2025-03-08 05:55:24,432 INFO L78 Accepts]: Start accepts. Automaton has 21872 states and 30802 transitions. Word has length 94 [2025-03-08 05:55:24,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:24,433 INFO L471 AbstractCegarLoop]: Abstraction has 21872 states and 30802 transitions. [2025-03-08 05:55:24,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:24,433 INFO L276 IsEmpty]: Start isEmpty. Operand 21872 states and 30802 transitions. [2025-03-08 05:55:24,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:55:24,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:24,440 INFO L218 NwaCegarLoop]: trace histogram [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-08 05:55:24,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:55:24,440 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:24,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:24,441 INFO L85 PathProgramCache]: Analyzing trace with hash -857875555, now seen corresponding path program 1 times [2025-03-08 05:55:24,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:24,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171962466] [2025-03-08 05:55:24,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:24,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:24,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:55:24,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:55:24,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:24,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:55:24,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:24,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171962466] [2025-03-08 05:55:24,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171962466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:24,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:24,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:24,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630218009] [2025-03-08 05:55:24,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:24,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:24,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:24,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:24,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:24,526 INFO L87 Difference]: Start difference. First operand 21872 states and 30802 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:25,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:25,533 INFO L93 Difference]: Finished difference Result 43731 states and 62904 transitions. [2025-03-08 05:55:25,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:55:25,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 94 [2025-03-08 05:55:25,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:25,626 INFO L225 Difference]: With dead ends: 43731 [2025-03-08 05:55:25,626 INFO L226 Difference]: Without dead ends: 21872 [2025-03-08 05:55:25,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:25,678 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 254 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:25,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 350 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:55:25,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21872 states. [2025-03-08 05:55:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21872 to 21872. [2025-03-08 05:55:26,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21872 states, 18749 states have (on average 1.368232972425196) internal successors, (25653), 19186 states have internal predecessors, (25653), 1668 states have call successors, (1668), 1054 states have call predecessors, (1668), 1454 states have return successors, (3241), 1639 states have call predecessors, (3241), 1668 states have call successors, (3241) [2025-03-08 05:55:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21872 states to 21872 states and 30562 transitions. [2025-03-08 05:55:26,661 INFO L78 Accepts]: Start accepts. Automaton has 21872 states and 30562 transitions. Word has length 94 [2025-03-08 05:55:26,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:26,662 INFO L471 AbstractCegarLoop]: Abstraction has 21872 states and 30562 transitions. [2025-03-08 05:55:26,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:26,662 INFO L276 IsEmpty]: Start isEmpty. Operand 21872 states and 30562 transitions. [2025-03-08 05:55:26,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:55:26,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:26,668 INFO L218 NwaCegarLoop]: trace histogram [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-08 05:55:26,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:55:26,669 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:26,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:26,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1306572194, now seen corresponding path program 1 times [2025-03-08 05:55:26,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:26,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753416744] [2025-03-08 05:55:26,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:26,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:26,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:55:26,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:55:26,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:26,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:55:26,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:26,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753416744] [2025-03-08 05:55:26,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753416744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:26,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:26,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:26,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113608705] [2025-03-08 05:55:26,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:26,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:26,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:26,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:26,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:26,780 INFO L87 Difference]: Start difference. First operand 21872 states and 30562 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:27,604 INFO L93 Difference]: Finished difference Result 28578 states and 39882 transitions. [2025-03-08 05:55:27,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:55:27,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 94 [2025-03-08 05:55:27,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:27,671 INFO L225 Difference]: With dead ends: 28578 [2025-03-08 05:55:27,671 INFO L226 Difference]: Without dead ends: 15843 [2025-03-08 05:55:27,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:55:27,705 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 399 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:27,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 666 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:55:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15843 states. [2025-03-08 05:55:28,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15843 to 14580. [2025-03-08 05:55:28,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14580 states, 12595 states have (on average 1.3453751488685985) internal successors, (16945), 12764 states have internal predecessors, (16945), 1128 states have call successors, (1128), 704 states have call predecessors, (1128), 856 states have return successors, (1731), 1115 states have call predecessors, (1731), 1128 states have call successors, (1731) [2025-03-08 05:55:28,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14580 states to 14580 states and 19804 transitions. [2025-03-08 05:55:28,356 INFO L78 Accepts]: Start accepts. Automaton has 14580 states and 19804 transitions. Word has length 94 [2025-03-08 05:55:28,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:28,356 INFO L471 AbstractCegarLoop]: Abstraction has 14580 states and 19804 transitions. [2025-03-08 05:55:28,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:28,356 INFO L276 IsEmpty]: Start isEmpty. Operand 14580 states and 19804 transitions. [2025-03-08 05:55:28,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:55:28,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:28,359 INFO L218 NwaCegarLoop]: trace histogram [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-08 05:55:28,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:55:28,359 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:28,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:28,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1182498947, now seen corresponding path program 1 times [2025-03-08 05:55:28,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:28,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371270920] [2025-03-08 05:55:28,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:28,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:28,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:55:28,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:55:28,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:28,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:55:28,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:28,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371270920] [2025-03-08 05:55:28,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371270920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:28,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:28,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:28,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215308415] [2025-03-08 05:55:28,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:28,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:28,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:28,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:28,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:28,439 INFO L87 Difference]: Start difference. First operand 14580 states and 19804 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:29,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:29,091 INFO L93 Difference]: Finished difference Result 20470 states and 27968 transitions. [2025-03-08 05:55:29,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:55:29,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 94 [2025-03-08 05:55:29,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:29,135 INFO L225 Difference]: With dead ends: 20470 [2025-03-08 05:55:29,135 INFO L226 Difference]: Without dead ends: 10483 [2025-03-08 05:55:29,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:55:29,156 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 391 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:29,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 658 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:55:29,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10483 states. [2025-03-08 05:55:29,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10483 to 9740. [2025-03-08 05:55:29,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9740 states, 8443 states have (on average 1.3446642188795452) internal successors, (11353), 8516 states have internal predecessors, (11353), 764 states have call successors, (764), 470 states have call predecessors, (764), 532 states have return successors, (1063), 755 states have call predecessors, (1063), 764 states have call successors, (1063) [2025-03-08 05:55:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9740 states to 9740 states and 13180 transitions. [2025-03-08 05:55:29,512 INFO L78 Accepts]: Start accepts. Automaton has 9740 states and 13180 transitions. Word has length 94 [2025-03-08 05:55:29,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:29,512 INFO L471 AbstractCegarLoop]: Abstraction has 9740 states and 13180 transitions. [2025-03-08 05:55:29,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:29,513 INFO L276 IsEmpty]: Start isEmpty. Operand 9740 states and 13180 transitions. [2025-03-08 05:55:29,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:55:29,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:29,514 INFO L218 NwaCegarLoop]: trace histogram [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-08 05:55:29,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:55:29,515 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:29,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:29,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1176808062, now seen corresponding path program 1 times [2025-03-08 05:55:29,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:29,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605267710] [2025-03-08 05:55:29,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:29,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:29,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:55:29,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:55:29,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:29,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:29,576 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:55:29,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:29,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605267710] [2025-03-08 05:55:29,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605267710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:29,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:29,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:29,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637332134] [2025-03-08 05:55:29,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:29,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:29,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:29,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:29,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:29,578 INFO L87 Difference]: Start difference. First operand 9740 states and 13180 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:30,445 INFO L93 Difference]: Finished difference Result 21433 states and 28966 transitions. [2025-03-08 05:55:30,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:55:30,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 94 [2025-03-08 05:55:30,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:30,505 INFO L225 Difference]: With dead ends: 21433 [2025-03-08 05:55:30,505 INFO L226 Difference]: Without dead ends: 11706 [2025-03-08 05:55:30,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:55:30,533 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 294 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:30,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 349 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:55:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11706 states. [2025-03-08 05:55:31,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11706 to 10926. [2025-03-08 05:55:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10926 states, 9547 states have (on average 1.2985230962606054) internal successors, (12397), 9612 states have internal predecessors, (12397), 776 states have call successors, (776), 530 states have call predecessors, (776), 602 states have return successors, (1127), 785 states have call predecessors, (1127), 776 states have call successors, (1127) [2025-03-08 05:55:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10926 states to 10926 states and 14300 transitions. [2025-03-08 05:55:31,252 INFO L78 Accepts]: Start accepts. Automaton has 10926 states and 14300 transitions. Word has length 94 [2025-03-08 05:55:31,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:31,253 INFO L471 AbstractCegarLoop]: Abstraction has 10926 states and 14300 transitions. [2025-03-08 05:55:31,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:31,253 INFO L276 IsEmpty]: Start isEmpty. Operand 10926 states and 14300 transitions. [2025-03-08 05:55:31,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:55:31,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:31,255 INFO L218 NwaCegarLoop]: trace histogram [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-08 05:55:31,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:55:31,255 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:31,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1656579235, now seen corresponding path program 1 times [2025-03-08 05:55:31,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:31,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498235550] [2025-03-08 05:55:31,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:31,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:31,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:55:31,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:55:31,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:31,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:55:31,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:31,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498235550] [2025-03-08 05:55:31,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498235550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:31,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:31,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:31,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047679075] [2025-03-08 05:55:31,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:31,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:31,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:31,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:31,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:31,363 INFO L87 Difference]: Start difference. First operand 10926 states and 14300 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:32,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:32,340 INFO L93 Difference]: Finished difference Result 20600 states and 27026 transitions. [2025-03-08 05:55:32,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:55:32,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 94 [2025-03-08 05:55:32,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:32,385 INFO L225 Difference]: With dead ends: 20600 [2025-03-08 05:55:32,385 INFO L226 Difference]: Without dead ends: 10647 [2025-03-08 05:55:32,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:55:32,407 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 379 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:32,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 632 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:55:32,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10647 states. [2025-03-08 05:55:32,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10647 to 9640. [2025-03-08 05:55:32,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9640 states, 8433 states have (on average 1.2985888770307126) internal successors, (10951), 8476 states have internal predecessors, (10951), 690 states have call successors, (690), 468 states have call predecessors, (690), 516 states have return successors, (982), 696 states have call predecessors, (982), 690 states have call successors, (982) [2025-03-08 05:55:33,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9640 states to 9640 states and 12623 transitions. [2025-03-08 05:55:33,035 INFO L78 Accepts]: Start accepts. Automaton has 9640 states and 12623 transitions. Word has length 94 [2025-03-08 05:55:33,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:33,036 INFO L471 AbstractCegarLoop]: Abstraction has 9640 states and 12623 transitions. [2025-03-08 05:55:33,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 9640 states and 12623 transitions. [2025-03-08 05:55:33,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:55:33,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:33,037 INFO L218 NwaCegarLoop]: trace histogram [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-08 05:55:33,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:55:33,037 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:33,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:33,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1715704478, now seen corresponding path program 1 times [2025-03-08 05:55:33,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:33,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918255302] [2025-03-08 05:55:33,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:33,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:33,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:55:33,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:55:33,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:33,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:33,105 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:55:33,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:33,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918255302] [2025-03-08 05:55:33,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918255302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:33,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:33,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:33,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822846700] [2025-03-08 05:55:33,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:33,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:33,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:33,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:33,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:33,106 INFO L87 Difference]: Start difference. First operand 9640 states and 12623 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:33,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:33,652 INFO L93 Difference]: Finished difference Result 20559 states and 26992 transitions. [2025-03-08 05:55:33,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:55:33,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 94 [2025-03-08 05:55:33,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:33,695 INFO L225 Difference]: With dead ends: 20559 [2025-03-08 05:55:33,695 INFO L226 Difference]: Without dead ends: 10932 [2025-03-08 05:55:33,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:55:33,717 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 283 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:33,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 344 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:55:33,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10932 states. [2025-03-08 05:55:34,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10932 to 10810. [2025-03-08 05:55:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10810 states, 9529 states have (on average 1.2588939028229615) internal successors, (11996), 9586 states have internal predecessors, (11996), 702 states have call successors, (702), 508 states have call predecessors, (702), 578 states have return successors, (1046), 716 states have call predecessors, (1046), 702 states have call successors, (1046) [2025-03-08 05:55:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10810 states to 10810 states and 13744 transitions. [2025-03-08 05:55:34,207 INFO L78 Accepts]: Start accepts. Automaton has 10810 states and 13744 transitions. Word has length 94 [2025-03-08 05:55:34,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:34,207 INFO L471 AbstractCegarLoop]: Abstraction has 10810 states and 13744 transitions. [2025-03-08 05:55:34,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:34,208 INFO L276 IsEmpty]: Start isEmpty. Operand 10810 states and 13744 transitions. [2025-03-08 05:55:34,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:55:34,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:34,209 INFO L218 NwaCegarLoop]: trace histogram [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-08 05:55:34,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:55:34,209 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:34,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:34,210 INFO L85 PathProgramCache]: Analyzing trace with hash -946458819, now seen corresponding path program 1 times [2025-03-08 05:55:34,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:34,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297331775] [2025-03-08 05:55:34,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:34,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:34,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:55:34,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:55:34,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:34,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:55:34,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:34,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297331775] [2025-03-08 05:55:34,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297331775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:34,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:34,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:55:34,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472910322] [2025-03-08 05:55:34,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:34,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:55:34,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:34,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:55:34,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:55:34,253 INFO L87 Difference]: Start difference. First operand 10810 states and 13744 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:55:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:34,963 INFO L93 Difference]: Finished difference Result 30979 states and 39691 transitions. [2025-03-08 05:55:34,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:55:34,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 94 [2025-03-08 05:55:34,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:35,034 INFO L225 Difference]: With dead ends: 30979 [2025-03-08 05:55:35,034 INFO L226 Difference]: Without dead ends: 20182 [2025-03-08 05:55:35,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 05:55:35,060 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 274 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:35,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 511 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:55:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20182 states. [2025-03-08 05:55:35,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20182 to 20175. [2025-03-08 05:55:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20175 states, 17735 states have (on average 1.2451085424302226) internal successors, (22082), 17857 states have internal predecessors, (22082), 1331 states have call successors, (1331), 944 states have call predecessors, (1331), 1108 states have return successors, (2198), 1375 states have call predecessors, (2198), 1331 states have call successors, (2198) [2025-03-08 05:55:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20175 states to 20175 states and 25611 transitions. [2025-03-08 05:55:35,808 INFO L78 Accepts]: Start accepts. Automaton has 20175 states and 25611 transitions. Word has length 94 [2025-03-08 05:55:35,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:35,809 INFO L471 AbstractCegarLoop]: Abstraction has 20175 states and 25611 transitions. [2025-03-08 05:55:35,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:55:35,809 INFO L276 IsEmpty]: Start isEmpty. Operand 20175 states and 25611 transitions. [2025-03-08 05:55:35,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 05:55:35,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:35,814 INFO L218 NwaCegarLoop]: trace histogram [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-08 05:55:35,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:55:35,814 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:35,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:35,815 INFO L85 PathProgramCache]: Analyzing trace with hash -320652884, now seen corresponding path program 1 times [2025-03-08 05:55:35,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:35,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136269507] [2025-03-08 05:55:35,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:35,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:35,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 05:55:35,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 05:55:35,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:35,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:35,836 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:55:35,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:35,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136269507] [2025-03-08 05:55:35,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136269507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:35,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:35,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:55:35,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856189508] [2025-03-08 05:55:35,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:35,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:55:35,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:35,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:55:35,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:55:35,838 INFO L87 Difference]: Start difference. First operand 20175 states and 25611 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:36,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:36,449 INFO L93 Difference]: Finished difference Result 39045 states and 49460 transitions. [2025-03-08 05:55:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:55:36,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 96 [2025-03-08 05:55:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:36,506 INFO L225 Difference]: With dead ends: 39045 [2025-03-08 05:55:36,507 INFO L226 Difference]: Without dead ends: 18883 [2025-03-08 05:55:36,537 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-08 05:55:36,538 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 199 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:36,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 203 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:55:36,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18883 states. [2025-03-08 05:55:37,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18883 to 18723. [2025-03-08 05:55:37,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18723 states, 16480 states have (on average 1.2421116504854368) internal successors, (20470), 16597 states have internal predecessors, (20470), 1214 states have call successors, (1214), 868 states have call predecessors, (1214), 1028 states have return successors, (2021), 1258 states have call predecessors, (2021), 1214 states have call successors, (2021) [2025-03-08 05:55:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18723 states to 18723 states and 23705 transitions. [2025-03-08 05:55:37,239 INFO L78 Accepts]: Start accepts. Automaton has 18723 states and 23705 transitions. Word has length 96 [2025-03-08 05:55:37,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:37,239 INFO L471 AbstractCegarLoop]: Abstraction has 18723 states and 23705 transitions. [2025-03-08 05:55:37,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:37,239 INFO L276 IsEmpty]: Start isEmpty. Operand 18723 states and 23705 transitions. [2025-03-08 05:55:37,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 05:55:37,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:37,240 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] [2025-03-08 05:55:37,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:55:37,241 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:37,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:37,241 INFO L85 PathProgramCache]: Analyzing trace with hash 189488701, now seen corresponding path program 1 times [2025-03-08 05:55:37,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:37,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368786912] [2025-03-08 05:55:37,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:37,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:37,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 05:55:37,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 05:55:37,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:37,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:55:37,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:37,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368786912] [2025-03-08 05:55:37,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368786912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:37,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:37,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:55:37,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155232319] [2025-03-08 05:55:37,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:37,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:55:37,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:37,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:55:37,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:55:37,279 INFO L87 Difference]: Start difference. First operand 18723 states and 23705 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:55:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:38,689 INFO L93 Difference]: Finished difference Result 55579 states and 70355 transitions. [2025-03-08 05:55:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:55:38,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 98 [2025-03-08 05:55:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:38,791 INFO L225 Difference]: With dead ends: 55579 [2025-03-08 05:55:38,792 INFO L226 Difference]: Without dead ends: 36869 [2025-03-08 05:55:38,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 05:55:38,825 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 255 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:38,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 531 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:55:38,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36869 states. [2025-03-08 05:55:40,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36869 to 36828. [2025-03-08 05:55:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36828 states, 32470 states have (on average 1.230274099168463) internal successors, (39947), 32728 states have internal predecessors, (39947), 2319 states have call successors, (2319), 1682 states have call predecessors, (2319), 2038 states have return successors, (4008), 2419 states have call predecessors, (4008), 2319 states have call successors, (4008) [2025-03-08 05:55:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36828 states to 36828 states and 46274 transitions. [2025-03-08 05:55:40,219 INFO L78 Accepts]: Start accepts. Automaton has 36828 states and 46274 transitions. Word has length 98 [2025-03-08 05:55:40,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:40,220 INFO L471 AbstractCegarLoop]: Abstraction has 36828 states and 46274 transitions. [2025-03-08 05:55:40,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:55:40,220 INFO L276 IsEmpty]: Start isEmpty. Operand 36828 states and 46274 transitions. [2025-03-08 05:55:40,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 05:55:40,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:40,221 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] [2025-03-08 05:55:40,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 05:55:40,221 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:40,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:40,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1128020316, now seen corresponding path program 1 times [2025-03-08 05:55:40,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:40,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167437098] [2025-03-08 05:55:40,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:40,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:40,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 05:55:40,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 05:55:40,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:40,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:55:40,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:40,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167437098] [2025-03-08 05:55:40,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167437098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:40,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:40,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:55:40,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741572639] [2025-03-08 05:55:40,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:40,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:55:40,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:40,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:55:40,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:55:40,240 INFO L87 Difference]: Start difference. First operand 36828 states and 46274 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:41,386 INFO L93 Difference]: Finished difference Result 66175 states and 83113 transitions. [2025-03-08 05:55:41,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:55:41,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 98 [2025-03-08 05:55:41,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:41,496 INFO L225 Difference]: With dead ends: 66175 [2025-03-08 05:55:41,496 INFO L226 Difference]: Without dead ends: 29360 [2025-03-08 05:55:41,562 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-08 05:55:41,562 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 197 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:41,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 202 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:55:41,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29360 states. [2025-03-08 05:55:42,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29360 to 29360. [2025-03-08 05:55:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29360 states, 25879 states have (on average 1.2289501139920398) internal successors, (31804), 26086 states have internal predecessors, (31804), 1848 states have call successors, (1848), 1340 states have call predecessors, (1848), 1632 states have return successors, (3206), 1934 states have call predecessors, (3206), 1848 states have call successors, (3206) [2025-03-08 05:55:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29360 states to 29360 states and 36858 transitions. [2025-03-08 05:55:42,872 INFO L78 Accepts]: Start accepts. Automaton has 29360 states and 36858 transitions. Word has length 98 [2025-03-08 05:55:42,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:42,872 INFO L471 AbstractCegarLoop]: Abstraction has 29360 states and 36858 transitions. [2025-03-08 05:55:42,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:42,873 INFO L276 IsEmpty]: Start isEmpty. Operand 29360 states and 36858 transitions. [2025-03-08 05:55:42,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 05:55:42,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:42,874 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:42,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 05:55:42,874 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:42,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:42,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2000124957, now seen corresponding path program 1 times [2025-03-08 05:55:42,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:42,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824952726] [2025-03-08 05:55:42,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:42,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:42,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:55:42,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:55:42,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:42,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:42,913 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-08 05:55:42,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:42,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824952726] [2025-03-08 05:55:42,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824952726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:42,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:42,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:55:42,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61790147] [2025-03-08 05:55:42,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:42,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:55:42,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:42,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:55:42,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:55:42,915 INFO L87 Difference]: Start difference. First operand 29360 states and 36858 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:55:44,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:44,980 INFO L93 Difference]: Finished difference Result 84908 states and 106977 transitions. [2025-03-08 05:55:44,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:55:44,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 102 [2025-03-08 05:55:44,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:45,163 INFO L225 Difference]: With dead ends: 84908 [2025-03-08 05:55:45,163 INFO L226 Difference]: Without dead ends: 55561 [2025-03-08 05:55:45,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 05:55:45,229 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 253 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:45,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 467 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:55:45,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55561 states. [2025-03-08 05:55:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55561 to 54525. [2025-03-08 05:55:48,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54525 states, 47802 states have (on average 1.2213924103593992) internal successors, (58385), 48316 states have internal predecessors, (58385), 3519 states have call successors, (3519), 2504 states have call predecessors, (3519), 3203 states have return successors, (6739), 3706 states have call predecessors, (6739), 3519 states have call successors, (6739) [2025-03-08 05:55:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54525 states to 54525 states and 68643 transitions. [2025-03-08 05:55:48,365 INFO L78 Accepts]: Start accepts. Automaton has 54525 states and 68643 transitions. Word has length 102 [2025-03-08 05:55:48,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:48,365 INFO L471 AbstractCegarLoop]: Abstraction has 54525 states and 68643 transitions. [2025-03-08 05:55:48,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:55:48,365 INFO L276 IsEmpty]: Start isEmpty. Operand 54525 states and 68643 transitions. [2025-03-08 05:55:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 05:55:48,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:48,367 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-08 05:55:48,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 05:55:48,367 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:48,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:48,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1558370462, now seen corresponding path program 1 times [2025-03-08 05:55:48,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:48,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32990400] [2025-03-08 05:55:48,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:48,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:48,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:55:48,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:55:48,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:48,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:48,389 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:55:48,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:48,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32990400] [2025-03-08 05:55:48,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32990400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:48,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:48,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:55:48,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655497373] [2025-03-08 05:55:48,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:48,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:55:48,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:48,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:55:48,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:55:48,392 INFO L87 Difference]: Start difference. First operand 54525 states and 68643 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:50,611 INFO L93 Difference]: Finished difference Result 100193 states and 126304 transitions. [2025-03-08 05:55:50,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:55:50,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-08 05:55:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:50,794 INFO L225 Difference]: With dead ends: 100193 [2025-03-08 05:55:50,794 INFO L226 Difference]: Without dead ends: 45681 [2025-03-08 05:55:50,885 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-08 05:55:50,885 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 195 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:50,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 201 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:55:50,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45681 states. [2025-03-08 05:55:53,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45681 to 45681. [2025-03-08 05:55:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45681 states, 40071 states have (on average 1.2241022185620523) internal successors, (49051), 40464 states have internal predecessors, (49051), 2956 states have call successors, (2956), 2112 states have call predecessors, (2956), 2653 states have return successors, (5672), 3105 states have call predecessors, (5672), 2956 states have call successors, (5672) [2025-03-08 05:55:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45681 states to 45681 states and 57679 transitions. [2025-03-08 05:55:53,267 INFO L78 Accepts]: Start accepts. Automaton has 45681 states and 57679 transitions. Word has length 102 [2025-03-08 05:55:53,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:53,267 INFO L471 AbstractCegarLoop]: Abstraction has 45681 states and 57679 transitions. [2025-03-08 05:55:53,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 45681 states and 57679 transitions. [2025-03-08 05:55:53,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 05:55:53,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:53,269 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:53,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 05:55:53,270 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:53,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:53,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1942054723, now seen corresponding path program 1 times [2025-03-08 05:55:53,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:53,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085841142] [2025-03-08 05:55:53,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:53,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:53,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 05:55:53,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 05:55:53,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:53,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:55:53,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:53,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085841142] [2025-03-08 05:55:53,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085841142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:53,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:53,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:53,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010590797] [2025-03-08 05:55:53,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:53,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:53,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:53,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:53,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:53,313 INFO L87 Difference]: Start difference. First operand 45681 states and 57679 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:55:57,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:57,160 INFO L93 Difference]: Finished difference Result 135251 states and 170948 transitions. [2025-03-08 05:55:57,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 05:55:57,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 106 [2025-03-08 05:55:57,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:57,419 INFO L225 Difference]: With dead ends: 135251 [2025-03-08 05:55:57,419 INFO L226 Difference]: Without dead ends: 66896 [2025-03-08 05:55:57,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:55:57,548 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 976 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:57,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 711 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:55:57,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66896 states. [2025-03-08 05:56:00,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66896 to 63749. [2025-03-08 05:56:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63749 states, 55858 states have (on average 1.218321457982742) internal successors, (68053), 56406 states have internal predecessors, (68053), 4152 states have call successors, (4152), 2972 states have call predecessors, (4152), 3738 states have return successors, (8410), 4371 states have call predecessors, (8410), 4152 states have call successors, (8410) [2025-03-08 05:56:00,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63749 states to 63749 states and 80615 transitions. [2025-03-08 05:56:00,728 INFO L78 Accepts]: Start accepts. Automaton has 63749 states and 80615 transitions. Word has length 106 [2025-03-08 05:56:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:00,729 INFO L471 AbstractCegarLoop]: Abstraction has 63749 states and 80615 transitions. [2025-03-08 05:56:00,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:56:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 63749 states and 80615 transitions. [2025-03-08 05:56:00,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 05:56:00,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:00,738 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:00,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 05:56:00,738 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:00,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:00,738 INFO L85 PathProgramCache]: Analyzing trace with hash -594532670, now seen corresponding path program 1 times [2025-03-08 05:56:00,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:00,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476551180] [2025-03-08 05:56:00,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:00,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:00,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 05:56:00,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 05:56:00,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:00,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 05:56:00,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:00,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476551180] [2025-03-08 05:56:00,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476551180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:00,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:00,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:56:00,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998653532] [2025-03-08 05:56:00,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:00,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:56:00,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:00,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:56:00,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:00,804 INFO L87 Difference]: Start difference. First operand 63749 states and 80615 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8)