./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-8fc3dc6-m [2025-03-16 19:03:46,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:03:46,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:03:46,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:03:46,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:03:46,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:03:46,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:03:46,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:03:46,462 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:03:46,462 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:03:46,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:03:46,463 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:03:46,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:03:46,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:03:46,463 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:03:46,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:03:46,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:03:46,463 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:03:46,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:03:46,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:03:46,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:03:46,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:03:46,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:03:46,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:03:46,463 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:03:46,463 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:03:46,464 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:03:46,464 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:03:46,464 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:03:46,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:03:46,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:03:46,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:03:46,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:03:46,464 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:03:46,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:03:46,464 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:03:46,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:03:46,464 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:03:46,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:03:46,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:03:46,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:03:46,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:03:46,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:03:46,464 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-16 19:03:46,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:03:46,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:03:46,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:03:46,734 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:03:46,734 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:03:46,735 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-16 19:03:47,899 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60a181c64/06e109dc34bd46efa9be35f216246542/FLAG655e633bb [2025-03-16 19:03:48,130 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:03:48,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.03.cil.c [2025-03-16 19:03:48,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60a181c64/06e109dc34bd46efa9be35f216246542/FLAG655e633bb [2025-03-16 19:03:48,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60a181c64/06e109dc34bd46efa9be35f216246542 [2025-03-16 19:03:48,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:03:48,469 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:03:48,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:03:48,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:03:48,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:03:48,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:03:48" (1/1) ... [2025-03-16 19:03:48,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29eb79d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:48, skipping insertion in model container [2025-03-16 19:03:48,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:03:48" (1/1) ... [2025-03-16 19:03:48,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:03:48,603 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-16 19:03:48,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:03:48,663 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:03:48,670 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-16 19:03:48,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:03:48,712 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:03:48,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:48 WrapperNode [2025-03-16 19:03:48,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:03:48,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:03:48,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:03:48,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:03:48,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:48" (1/1) ... [2025-03-16 19:03:48,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:48" (1/1) ... [2025-03-16 19:03:48,740 INFO L138 Inliner]: procedures = 34, calls = 39, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 307 [2025-03-16 19:03:48,740 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:03:48,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:03:48,741 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:03:48,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:03:48,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:48" (1/1) ... [2025-03-16 19:03:48,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:48" (1/1) ... [2025-03-16 19:03:48,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:48" (1/1) ... [2025-03-16 19:03:48,762 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:03:48,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:48" (1/1) ... [2025-03-16 19:03:48,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:48" (1/1) ... [2025-03-16 19:03:48,766 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:48" (1/1) ... [2025-03-16 19:03:48,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:48" (1/1) ... [2025-03-16 19:03:48,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:48" (1/1) ... [2025-03-16 19:03:48,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:48" (1/1) ... [2025-03-16 19:03:48,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:03:48,770 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:03:48,770 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:03:48,770 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:03:48,771 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:48" (1/1) ... [2025-03-16 19:03:48,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:03:48,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:03:48,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:03:48,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:03:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:03:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 19:03:48,823 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 19:03:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 19:03:48,824 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 19:03:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 19:03:48,824 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 19:03:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 19:03:48,824 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 19:03:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 19:03:48,824 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 19:03:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:03:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 19:03:48,824 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 19:03:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:03:48,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:03:48,889 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:03:48,891 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:03:49,251 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-16 19:03:49,252 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:03:49,268 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:03:49,268 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:03:49,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:03:49 BoogieIcfgContainer [2025-03-16 19:03:49,269 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:03:49,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:03:49,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:03:49,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:03:49,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:03:48" (1/3) ... [2025-03-16 19:03:49,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2437cbcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:03:49, skipping insertion in model container [2025-03-16 19:03:49,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:03:48" (2/3) ... [2025-03-16 19:03:49,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2437cbcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:03:49, skipping insertion in model container [2025-03-16 19:03:49,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:03:49" (3/3) ... [2025-03-16 19:03:49,280 INFO L128 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2025-03-16 19:03:49,292 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:03:49,293 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG transmitter.03.cil.c that has 7 procedures, 140 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-16 19:03:49,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:03:49,358 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;@402266bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:03:49,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:03:49,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 117 states have (on average 1.5811965811965811) internal successors, (185), 118 states have internal predecessors, (185), 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-16 19:03:49,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:03:49,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:49,372 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] [2025-03-16 19:03:49,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:49,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:49,377 INFO L85 PathProgramCache]: Analyzing trace with hash -651238477, now seen corresponding path program 1 times [2025-03-16 19:03:49,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:49,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168715053] [2025-03-16 19:03:49,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:49,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:49,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:03:49,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:03:49,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:49,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:49,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:49,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168715053] [2025-03-16 19:03:49,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168715053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:49,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:49,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:03:49,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169983149] [2025-03-16 19:03:49,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:49,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:03:49,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:49,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:03:49,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:03:49,783 INFO L87 Difference]: Start difference. First operand has 140 states, 117 states have (on average 1.5811965811965811) internal successors, (185), 118 states have internal predecessors, (185), 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 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-16 19:03:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:50,128 INFO L93 Difference]: Finished difference Result 413 states and 650 transitions. [2025-03-16 19:03:50,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:03:50,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2025-03-16 19:03:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:50,143 INFO L225 Difference]: With dead ends: 413 [2025-03-16 19:03:50,143 INFO L226 Difference]: Without dead ends: 276 [2025-03-16 19:03:50,147 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-16 19:03:50,149 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 353 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:50,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 556 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:03:50,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-16 19:03:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 265. [2025-03-16 19:03:50,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 224 states have (on average 1.5267857142857142) internal successors, (342), 226 states have internal predecessors, (342), 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-16 19:03:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 397 transitions. [2025-03-16 19:03:50,199 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 397 transitions. Word has length 71 [2025-03-16 19:03:50,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:50,200 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 397 transitions. [2025-03-16 19:03:50,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-16 19:03:50,201 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 397 transitions. [2025-03-16 19:03:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:03:50,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:50,206 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] [2025-03-16 19:03:50,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:03:50,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:50,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:50,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1535633898, now seen corresponding path program 1 times [2025-03-16 19:03:50,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:50,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520830732] [2025-03-16 19:03:50,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:50,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:50,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:03:50,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:03:50,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:50,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:50,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:50,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520830732] [2025-03-16 19:03:50,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520830732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:50,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:50,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:03:50,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553255748] [2025-03-16 19:03:50,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:50,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:03:50,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:50,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:03:50,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:03:50,352 INFO L87 Difference]: Start difference. First operand 265 states and 397 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 19:03:50,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:50,548 INFO L93 Difference]: Finished difference Result 542 states and 819 transitions. [2025-03-16 19:03:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:03:50,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2025-03-16 19:03:50,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:50,553 INFO L225 Difference]: With dead ends: 542 [2025-03-16 19:03:50,553 INFO L226 Difference]: Without dead ends: 286 [2025-03-16 19:03:50,554 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-16 19:03:50,555 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 258 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:50,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 379 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:03:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-16 19:03:50,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 265. [2025-03-16 19:03:50,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 224 states have (on average 1.5178571428571428) internal successors, (340), 226 states have internal predecessors, (340), 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-16 19:03:50,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 395 transitions. [2025-03-16 19:03:50,586 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 395 transitions. Word has length 71 [2025-03-16 19:03:50,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:50,586 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 395 transitions. [2025-03-16 19:03:50,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 19:03:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 395 transitions. [2025-03-16 19:03:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:03:50,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:50,588 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] [2025-03-16 19:03:50,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:03:50,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:50,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:50,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1255284009, now seen corresponding path program 1 times [2025-03-16 19:03:50,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:50,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686752832] [2025-03-16 19:03:50,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:50,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:50,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:03:50,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:03:50,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:50,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:50,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:50,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686752832] [2025-03-16 19:03:50,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686752832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:50,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:50,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:03:50,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233827440] [2025-03-16 19:03:50,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:50,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:03:50,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:50,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:03:50,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:03:50,742 INFO L87 Difference]: Start difference. First operand 265 states and 395 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-16 19:03:51,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:51,182 INFO L93 Difference]: Finished difference Result 699 states and 1045 transitions. [2025-03-16 19:03:51,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:03:51,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2025-03-16 19:03:51,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:51,185 INFO L225 Difference]: With dead ends: 699 [2025-03-16 19:03:51,185 INFO L226 Difference]: Without dead ends: 443 [2025-03-16 19:03:51,186 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-16 19:03:51,186 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 364 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:51,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 984 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:03:51,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-16 19:03:51,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 384. [2025-03-16 19:03:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 325 states have (on average 1.5046153846153847) internal successors, (489), 328 states have internal predecessors, (489), 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-16 19:03:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 569 transitions. [2025-03-16 19:03:51,223 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 569 transitions. Word has length 71 [2025-03-16 19:03:51,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:51,223 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 569 transitions. [2025-03-16 19:03:51,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-16 19:03:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 569 transitions. [2025-03-16 19:03:51,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:03:51,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:51,225 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] [2025-03-16 19:03:51,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:03:51,225 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:51,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:51,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1109064182, now seen corresponding path program 1 times [2025-03-16 19:03:51,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:51,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001726638] [2025-03-16 19:03:51,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:51,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:51,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:03:51,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:03:51,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:51,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:51,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:51,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001726638] [2025-03-16 19:03:51,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001726638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:51,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:51,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:03:51,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021154857] [2025-03-16 19:03:51,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:51,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:03:51,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:51,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:03:51,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:03:51,322 INFO L87 Difference]: Start difference. First operand 384 states and 569 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-16 19:03:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:51,723 INFO L93 Difference]: Finished difference Result 1066 states and 1586 transitions. [2025-03-16 19:03:51,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:03:51,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2025-03-16 19:03:51,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:51,727 INFO L225 Difference]: With dead ends: 1066 [2025-03-16 19:03:51,727 INFO L226 Difference]: Without dead ends: 691 [2025-03-16 19:03:51,728 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-16 19:03:51,729 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 359 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:51,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 968 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:03:51,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-03-16 19:03:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 631. [2025-03-16 19:03:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 534 states have (on average 1.4943820224719102) internal successors, (798), 541 states have internal predecessors, (798), 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-16 19:03:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 934 transitions. [2025-03-16 19:03:51,774 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 934 transitions. Word has length 71 [2025-03-16 19:03:51,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:51,774 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 934 transitions. [2025-03-16 19:03:51,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-16 19:03:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 934 transitions. [2025-03-16 19:03:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:03:51,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:51,776 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] [2025-03-16 19:03:51,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:03:51,776 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:51,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:51,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1739522807, now seen corresponding path program 1 times [2025-03-16 19:03:51,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:51,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917136166] [2025-03-16 19:03:51,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:51,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:51,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:03:51,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:03:51,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:51,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:51,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:51,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:51,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917136166] [2025-03-16 19:03:51,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917136166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:51,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:51,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:03:51,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214390572] [2025-03-16 19:03:51,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:51,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:03:51,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:51,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:03:51,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:03:51,845 INFO L87 Difference]: Start difference. First operand 631 states and 934 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 19:03:52,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:52,033 INFO L93 Difference]: Finished difference Result 1297 states and 1936 transitions. [2025-03-16 19:03:52,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:03:52,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2025-03-16 19:03:52,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:52,040 INFO L225 Difference]: With dead ends: 1297 [2025-03-16 19:03:52,040 INFO L226 Difference]: Without dead ends: 675 [2025-03-16 19:03:52,041 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-16 19:03:52,042 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 251 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:52,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 357 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:03:52,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-03-16 19:03:52,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 631. [2025-03-16 19:03:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 534 states have (on average 1.4850187265917603) internal successors, (793), 541 states have internal predecessors, (793), 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-16 19:03:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 929 transitions. [2025-03-16 19:03:52,090 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 929 transitions. Word has length 71 [2025-03-16 19:03:52,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:52,090 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 929 transitions. [2025-03-16 19:03:52,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 19:03:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 929 transitions. [2025-03-16 19:03:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:03:52,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:52,093 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] [2025-03-16 19:03:52,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:03:52,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:52,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:52,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1759860182, now seen corresponding path program 1 times [2025-03-16 19:03:52,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:52,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62920185] [2025-03-16 19:03:52,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:52,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:52,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:03:52,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:03:52,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:52,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:52,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:52,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62920185] [2025-03-16 19:03:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62920185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:52,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:52,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:03:52,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073809276] [2025-03-16 19:03:52,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:52,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:03:52,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:52,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:03:52,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:03:52,169 INFO L87 Difference]: Start difference. First operand 631 states and 929 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-16 19:03:52,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:52,612 INFO L93 Difference]: Finished difference Result 1855 states and 2747 transitions. [2025-03-16 19:03:52,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:03:52,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2025-03-16 19:03:52,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:52,619 INFO L225 Difference]: With dead ends: 1855 [2025-03-16 19:03:52,619 INFO L226 Difference]: Without dead ends: 1233 [2025-03-16 19:03:52,621 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-16 19:03:52,622 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 384 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:52,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 921 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:03:52,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2025-03-16 19:03:52,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1125. [2025-03-16 19:03:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 950 states have (on average 1.476842105263158) internal successors, (1403), 971 states have internal predecessors, (1403), 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-16 19:03:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1667 transitions. [2025-03-16 19:03:52,690 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1667 transitions. Word has length 71 [2025-03-16 19:03:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:52,690 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1667 transitions. [2025-03-16 19:03:52,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-16 19:03:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1667 transitions. [2025-03-16 19:03:52,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:03:52,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:52,692 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] [2025-03-16 19:03:52,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:03:52,692 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:52,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:52,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1841714409, now seen corresponding path program 1 times [2025-03-16 19:03:52,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:52,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111236102] [2025-03-16 19:03:52,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:52,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:52,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:03:52,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:03:52,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:52,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:52,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:52,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:52,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111236102] [2025-03-16 19:03:52,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111236102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:52,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:52,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:03:52,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586430102] [2025-03-16 19:03:52,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:52,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:03:52,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:52,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:03:52,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:03:52,759 INFO L87 Difference]: Start difference. First operand 1125 states and 1667 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 19:03:52,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:52,933 INFO L93 Difference]: Finished difference Result 2299 states and 3432 transitions. [2025-03-16 19:03:52,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:03:52,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2025-03-16 19:03:52,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:52,940 INFO L225 Difference]: With dead ends: 2299 [2025-03-16 19:03:52,941 INFO L226 Difference]: Without dead ends: 1183 [2025-03-16 19:03:52,944 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-16 19:03:52,944 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 247 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:52,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 343 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:03:52,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-03-16 19:03:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1125. [2025-03-16 19:03:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 950 states have (on average 1.4673684210526317) internal successors, (1394), 971 states have internal predecessors, (1394), 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-16 19:03:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1658 transitions. [2025-03-16 19:03:53,030 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1658 transitions. Word has length 71 [2025-03-16 19:03:53,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:53,030 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1658 transitions. [2025-03-16 19:03:53,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 19:03:53,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1658 transitions. [2025-03-16 19:03:53,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:03:53,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:53,034 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] [2025-03-16 19:03:53,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:03:53,034 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:53,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:53,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1403704906, now seen corresponding path program 1 times [2025-03-16 19:03:53,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:53,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250418571] [2025-03-16 19:03:53,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:53,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:53,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:03:53,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:03:53,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:53,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:53,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-16 19:03:53,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:53,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250418571] [2025-03-16 19:03:53,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250418571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:53,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:53,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:03:53,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891457438] [2025-03-16 19:03:53,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:53,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:03:53,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:53,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:03:53,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:53,082 INFO L87 Difference]: Start difference. First operand 1125 states and 1658 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-16 19:03:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:53,150 INFO L93 Difference]: Finished difference Result 2242 states and 3345 transitions. [2025-03-16 19:03:53,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:03:53,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2025-03-16 19:03:53,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:53,156 INFO L225 Difference]: With dead ends: 2242 [2025-03-16 19:03:53,157 INFO L226 Difference]: Without dead ends: 1127 [2025-03-16 19:03:53,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:53,162 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:53,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 598 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-03-16 19:03:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1127. [2025-03-16 19:03:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 952 states have (on average 1.4579831932773109) internal successors, (1388), 973 states have internal predecessors, (1388), 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-16 19:03:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1652 transitions. [2025-03-16 19:03:53,218 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1652 transitions. Word has length 71 [2025-03-16 19:03:53,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:53,219 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1652 transitions. [2025-03-16 19:03:53,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-16 19:03:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1652 transitions. [2025-03-16 19:03:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:03:53,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:53,225 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] [2025-03-16 19:03:53,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:03:53,225 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:53,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:53,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1707915093, now seen corresponding path program 1 times [2025-03-16 19:03:53,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:53,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64856290] [2025-03-16 19:03:53,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:53,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:53,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:03:53,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:03:53,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:53,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:53,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:53,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64856290] [2025-03-16 19:03:53,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64856290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:53,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:53,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:03:53,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692933028] [2025-03-16 19:03:53,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:53,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:03:53,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:53,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:03:53,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:53,268 INFO L87 Difference]: Start difference. First operand 1127 states and 1652 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-16 19:03:53,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:53,498 INFO L93 Difference]: Finished difference Result 3327 states and 4904 transitions. [2025-03-16 19:03:53,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:03:53,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2025-03-16 19:03:53,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:53,509 INFO L225 Difference]: With dead ends: 3327 [2025-03-16 19:03:53,510 INFO L226 Difference]: Without dead ends: 2210 [2025-03-16 19:03:53,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:53,514 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 351 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 679 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-16 19:03:53,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 679 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:03:53,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2025-03-16 19:03:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2198. [2025-03-16 19:03:53,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2198 states, 1858 states have (on average 1.4477933261571583) internal successors, (2690), 1899 states have internal predecessors, (2690), 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-16 19:03:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 3193 transitions. [2025-03-16 19:03:53,637 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 3193 transitions. Word has length 71 [2025-03-16 19:03:53,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:53,637 INFO L471 AbstractCegarLoop]: Abstraction has 2198 states and 3193 transitions. [2025-03-16 19:03:53,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-16 19:03:53,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 3193 transitions. [2025-03-16 19:03:53,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:03:53,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:53,639 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] [2025-03-16 19:03:53,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:03:53,640 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:53,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:53,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1580614450, now seen corresponding path program 1 times [2025-03-16 19:03:53,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:53,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532891301] [2025-03-16 19:03:53,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:53,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:53,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:03:53,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:03:53,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:53,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:53,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:53,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:53,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532891301] [2025-03-16 19:03:53,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532891301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:53,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:53,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:03:53,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172596956] [2025-03-16 19:03:53,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:53,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:03:53,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:53,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:03:53,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:03:53,683 INFO L87 Difference]: Start difference. First operand 2198 states and 3193 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 19:03:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:54,310 INFO L93 Difference]: Finished difference Result 12615 states and 18777 transitions. [2025-03-16 19:03:54,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:03:54,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2025-03-16 19:03:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:54,364 INFO L225 Difference]: With dead ends: 12615 [2025-03-16 19:03:54,365 INFO L226 Difference]: Without dead ends: 10427 [2025-03-16 19:03:54,378 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-16 19:03:54,378 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 881 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 857 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-16 19:03:54,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 857 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:03:54,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10427 states. [2025-03-16 19:03:54,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10427 to 10235. [2025-03-16 19:03:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10235 states, 8671 states have (on average 1.4495444585399608) internal successors, (12569), 8890 states have internal predecessors, (12569), 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-16 19:03:54,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10235 states to 10235 states and 15031 transitions. [2025-03-16 19:03:54,999 INFO L78 Accepts]: Start accepts. Automaton has 10235 states and 15031 transitions. Word has length 71 [2025-03-16 19:03:55,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:55,000 INFO L471 AbstractCegarLoop]: Abstraction has 10235 states and 15031 transitions. [2025-03-16 19:03:55,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 19:03:55,000 INFO L276 IsEmpty]: Start isEmpty. Operand 10235 states and 15031 transitions. [2025-03-16 19:03:55,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:03:55,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:55,002 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] [2025-03-16 19:03:55,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:03:55,002 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:55,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:55,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1687290165, now seen corresponding path program 1 times [2025-03-16 19:03:55,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:55,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127639755] [2025-03-16 19:03:55,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:55,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:55,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:03:55,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:03:55,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:55,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:55,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:55,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:55,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127639755] [2025-03-16 19:03:55,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127639755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:55,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:55,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:03:55,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2250379] [2025-03-16 19:03:55,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:55,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:03:55,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:55,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:03:55,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:55,046 INFO L87 Difference]: Start difference. First operand 10235 states and 15031 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-16 19:03:55,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:55,504 INFO L93 Difference]: Finished difference Result 20550 states and 30686 transitions. [2025-03-16 19:03:55,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:03:55,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2025-03-16 19:03:55,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:55,554 INFO L225 Difference]: With dead ends: 20550 [2025-03-16 19:03:55,555 INFO L226 Difference]: Without dead ends: 10325 [2025-03-16 19:03:55,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:55,586 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:55,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 598 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:55,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10325 states. [2025-03-16 19:03:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10325 to 10325. [2025-03-16 19:03:56,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10325 states, 8761 states have (on average 1.439789978312978) internal successors, (12614), 8980 states have internal predecessors, (12614), 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-16 19:03:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10325 states to 10325 states and 15076 transitions. [2025-03-16 19:03:56,322 INFO L78 Accepts]: Start accepts. Automaton has 10325 states and 15076 transitions. Word has length 71 [2025-03-16 19:03:56,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:56,323 INFO L471 AbstractCegarLoop]: Abstraction has 10325 states and 15076 transitions. [2025-03-16 19:03:56,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-16 19:03:56,323 INFO L276 IsEmpty]: Start isEmpty. Operand 10325 states and 15076 transitions. [2025-03-16 19:03:56,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:03:56,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:56,324 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] [2025-03-16 19:03:56,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:03:56,325 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:56,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:56,325 INFO L85 PathProgramCache]: Analyzing trace with hash -248370122, now seen corresponding path program 1 times [2025-03-16 19:03:56,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:56,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240137569] [2025-03-16 19:03:56,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:56,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:56,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:03:56,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:03:56,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:56,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:56,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:56,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240137569] [2025-03-16 19:03:56,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240137569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:56,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:56,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:03:56,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376936057] [2025-03-16 19:03:56,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:56,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:03:56,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:56,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:03:56,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:56,359 INFO L87 Difference]: Start difference. First operand 10325 states and 15076 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-16 19:03:57,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:57,116 INFO L93 Difference]: Finished difference Result 30771 states and 45419 transitions. [2025-03-16 19:03:57,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:03:57,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2025-03-16 19:03:57,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:57,209 INFO L225 Difference]: With dead ends: 30771 [2025-03-16 19:03:57,209 INFO L226 Difference]: Without dead ends: 20456 [2025-03-16 19:03:57,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:57,249 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 363 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 681 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-16 19:03:57,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 681 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:03:57,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20456 states. [2025-03-16 19:03:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20456 to 20366. [2025-03-16 19:03:58,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20366 states, 17243 states have (on average 1.4257959751783333) internal successors, (24585), 17680 states have internal predecessors, (24585), 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-16 19:03:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20366 states to 20366 states and 29494 transitions. [2025-03-16 19:03:58,535 INFO L78 Accepts]: Start accepts. Automaton has 20366 states and 29494 transitions. Word has length 71 [2025-03-16 19:03:58,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:58,536 INFO L471 AbstractCegarLoop]: Abstraction has 20366 states and 29494 transitions. [2025-03-16 19:03:58,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-16 19:03:58,537 INFO L276 IsEmpty]: Start isEmpty. Operand 20366 states and 29494 transitions. [2025-03-16 19:03:58,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:03:58,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:58,545 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] [2025-03-16 19:03:58,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:03:58,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:58,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:58,546 INFO L85 PathProgramCache]: Analyzing trace with hash -347437752, now seen corresponding path program 1 times [2025-03-16 19:03:58,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:58,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698500810] [2025-03-16 19:03:58,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:58,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:58,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:03:58,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:03:58,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:58,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:58,613 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-16 19:03:58,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:58,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698500810] [2025-03-16 19:03:58,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698500810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:58,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:58,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:03:58,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523244758] [2025-03-16 19:03:58,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:58,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:03:58,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:58,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:03:58,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:58,615 INFO L87 Difference]: Start difference. First operand 20366 states and 29494 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-16 19:03:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:59,617 INFO L93 Difference]: Finished difference Result 40866 states and 60198 transitions. [2025-03-16 19:03:59,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:03:59,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 88 [2025-03-16 19:03:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:59,688 INFO L225 Difference]: With dead ends: 40866 [2025-03-16 19:03:59,688 INFO L226 Difference]: Without dead ends: 20510 [2025-03-16 19:03:59,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:03:59,725 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:59,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 598 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:03:59,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20510 states. [2025-03-16 19:04:00,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20510 to 20510. [2025-03-16 19:04:00,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20510 states, 17387 states have (on average 1.4160579743486512) internal successors, (24621), 17824 states have internal predecessors, (24621), 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-16 19:04:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20510 states to 20510 states and 29530 transitions. [2025-03-16 19:04:00,625 INFO L78 Accepts]: Start accepts. Automaton has 20510 states and 29530 transitions. Word has length 88 [2025-03-16 19:04:00,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:04:00,626 INFO L471 AbstractCegarLoop]: Abstraction has 20510 states and 29530 transitions. [2025-03-16 19:04:00,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-16 19:04:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 20510 states and 29530 transitions. [2025-03-16 19:04:00,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:04:00,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:04:00,631 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] [2025-03-16 19:04:00,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:04:00,632 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:04:00,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:04:00,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2021996233, now seen corresponding path program 1 times [2025-03-16 19:04:00,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:04:00,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323348215] [2025-03-16 19:04:00,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:04:00,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:04:00,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:04:00,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:04:00,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:04:00,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:04:00,672 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-16 19:04:00,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:04:00,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323348215] [2025-03-16 19:04:00,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323348215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:04:00,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:04:00,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:04:00,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296496016] [2025-03-16 19:04:00,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:04:00,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:04:00,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:04:00,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:04:00,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:04:00,674 INFO L87 Difference]: Start difference. First operand 20510 states and 29530 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-16 19:04:01,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:04:01,385 INFO L93 Difference]: Finished difference Result 41190 states and 60324 transitions. [2025-03-16 19:04:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:04:01,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 88 [2025-03-16 19:04:01,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:04:01,463 INFO L225 Difference]: With dead ends: 41190 [2025-03-16 19:04:01,464 INFO L226 Difference]: Without dead ends: 20690 [2025-03-16 19:04:01,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:04:01,499 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:04:01,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 598 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:04:01,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20690 states. [2025-03-16 19:04:02,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20690 to 20690. [2025-03-16 19:04:02,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20690 states, 17567 states have (on average 1.4066716001593897) internal successors, (24711), 18004 states have internal predecessors, (24711), 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-16 19:04:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20690 states to 20690 states and 29620 transitions. [2025-03-16 19:04:02,501 INFO L78 Accepts]: Start accepts. Automaton has 20690 states and 29620 transitions. Word has length 88 [2025-03-16 19:04:02,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:04:02,501 INFO L471 AbstractCegarLoop]: Abstraction has 20690 states and 29620 transitions. [2025-03-16 19:04:02,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-16 19:04:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 20690 states and 29620 transitions. [2025-03-16 19:04:02,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:04:02,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:04:02,509 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] [2025-03-16 19:04:02,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:04:02,509 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:04:02,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:04:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1303390040, now seen corresponding path program 1 times [2025-03-16 19:04:02,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:04:02,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789628551] [2025-03-16 19:04:02,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:04:02,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:04:02,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:04:02,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:04:02,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:04:02,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:04:02,582 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-16 19:04:02,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:04:02,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789628551] [2025-03-16 19:04:02,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789628551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:04:02,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:04:02,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:04:02,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289893328] [2025-03-16 19:04:02,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:04:02,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:04:02,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:04:02,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:04:02,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:04:02,584 INFO L87 Difference]: Start difference. First operand 20690 states and 29620 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-16 19:04:03,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:04:03,781 INFO L93 Difference]: Finished difference Result 41369 states and 60542 transitions. [2025-03-16 19:04:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:04:03,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 88 [2025-03-16 19:04:03,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:04:03,869 INFO L225 Difference]: With dead ends: 41369 [2025-03-16 19:04:03,869 INFO L226 Difference]: Without dead ends: 20690 [2025-03-16 19:04:03,911 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-16 19:04:03,912 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 244 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:04:03,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 338 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:04:03,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20690 states. [2025-03-16 19:04:04,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20690 to 20690. [2025-03-16 19:04:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20690 states, 17567 states have (on average 1.39300962031081) internal successors, (24471), 18004 states have internal predecessors, (24471), 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-16 19:04:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20690 states to 20690 states and 29380 transitions. [2025-03-16 19:04:05,101 INFO L78 Accepts]: Start accepts. Automaton has 20690 states and 29380 transitions. Word has length 88 [2025-03-16 19:04:05,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:04:05,101 INFO L471 AbstractCegarLoop]: Abstraction has 20690 states and 29380 transitions. [2025-03-16 19:04:05,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-16 19:04:05,102 INFO L276 IsEmpty]: Start isEmpty. Operand 20690 states and 29380 transitions. [2025-03-16 19:04:05,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:04:05,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:04:05,109 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] [2025-03-16 19:04:05,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:04:05,109 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:04:05,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:04:05,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1752086679, now seen corresponding path program 1 times [2025-03-16 19:04:05,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:04:05,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447204383] [2025-03-16 19:04:05,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:04:05,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:04:05,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:04:05,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:04:05,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:04:05,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:04:05,222 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-16 19:04:05,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:04:05,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447204383] [2025-03-16 19:04:05,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447204383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:04:05,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:04:05,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:04:05,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67655849] [2025-03-16 19:04:05,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:04:05,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:04:05,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:04:05,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:04:05,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:04:05,223 INFO L87 Difference]: Start difference. First operand 20690 states and 29380 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-16 19:04:06,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:04:06,312 INFO L93 Difference]: Finished difference Result 26992 states and 38296 transitions. [2025-03-16 19:04:06,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:04:06,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 88 [2025-03-16 19:04:06,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:04:06,367 INFO L225 Difference]: With dead ends: 26992 [2025-03-16 19:04:06,367 INFO L226 Difference]: Without dead ends: 14925 [2025-03-16 19:04:06,389 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-16 19:04:06,389 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 378 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:04:06,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 644 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:04:06,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14925 states. [2025-03-16 19:04:06,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14925 to 13692. [2025-03-16 19:04:06,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13692 states, 11707 states have (on average 1.3715725634235927) internal successors, (16057), 11876 states have internal predecessors, (16057), 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-16 19:04:06,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13692 states to 13692 states and 18916 transitions. [2025-03-16 19:04:06,936 INFO L78 Accepts]: Start accepts. Automaton has 13692 states and 18916 transitions. Word has length 88 [2025-03-16 19:04:06,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:04:06,936 INFO L471 AbstractCegarLoop]: Abstraction has 13692 states and 18916 transitions. [2025-03-16 19:04:06,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-16 19:04:06,937 INFO L276 IsEmpty]: Start isEmpty. Operand 13692 states and 18916 transitions. [2025-03-16 19:04:06,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:04:06,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:04:06,940 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] [2025-03-16 19:04:06,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:04:06,940 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:04:06,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:04:06,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1628013432, now seen corresponding path program 1 times [2025-03-16 19:04:06,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:04:06,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955739720] [2025-03-16 19:04:06,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:04:06,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:04:06,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:04:06,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:04:06,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:04:06,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:04:07,037 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-16 19:04:07,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:04:07,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955739720] [2025-03-16 19:04:07,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955739720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:04:07,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:04:07,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:04:07,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615126696] [2025-03-16 19:04:07,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:04:07,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:04:07,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:04:07,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:04:07,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:04:07,039 INFO L87 Difference]: Start difference. First operand 13692 states and 18916 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-16 19:04:07,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:04:07,694 INFO L93 Difference]: Finished difference Result 19234 states and 26732 transitions. [2025-03-16 19:04:07,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:04:07,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 88 [2025-03-16 19:04:07,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:04:07,742 INFO L225 Difference]: With dead ends: 19234 [2025-03-16 19:04:07,742 INFO L226 Difference]: Without dead ends: 9849 [2025-03-16 19:04:07,760 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-16 19:04:07,761 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 370 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:04:07,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 636 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:04:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9849 states. [2025-03-16 19:04:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9849 to 9136. [2025-03-16 19:04:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9136 states, 7839 states have (on average 1.371220818982013) internal successors, (10749), 7912 states have internal predecessors, (10749), 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-16 19:04:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9136 states to 9136 states and 12576 transitions. [2025-03-16 19:04:08,112 INFO L78 Accepts]: Start accepts. Automaton has 9136 states and 12576 transitions. Word has length 88 [2025-03-16 19:04:08,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:04:08,113 INFO L471 AbstractCegarLoop]: Abstraction has 9136 states and 12576 transitions. [2025-03-16 19:04:08,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-16 19:04:08,113 INFO L276 IsEmpty]: Start isEmpty. Operand 9136 states and 12576 transitions. [2025-03-16 19:04:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:04:08,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:04:08,115 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] [2025-03-16 19:04:08,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:04:08,115 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:04:08,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:04:08,116 INFO L85 PathProgramCache]: Analyzing trace with hash 731293577, now seen corresponding path program 1 times [2025-03-16 19:04:08,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:04:08,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616312014] [2025-03-16 19:04:08,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:04:08,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:04:08,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:04:08,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:04:08,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:04:08,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:04:08,216 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-16 19:04:08,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:04:08,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616312014] [2025-03-16 19:04:08,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616312014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:04:08,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:04:08,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:04:08,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287369784] [2025-03-16 19:04:08,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:04:08,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:04:08,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:04:08,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:04:08,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:04:08,218 INFO L87 Difference]: Start difference. First operand 9136 states and 12576 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-16 19:04:08,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:04:08,721 INFO L93 Difference]: Finished difference Result 19945 states and 27478 transitions. [2025-03-16 19:04:08,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:04:08,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 88 [2025-03-16 19:04:08,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:04:08,762 INFO L225 Difference]: With dead ends: 19945 [2025-03-16 19:04:08,763 INFO L226 Difference]: Without dead ends: 10820 [2025-03-16 19:04:08,782 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-16 19:04:08,783 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 277 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:04:08,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 337 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:04:08,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10820 states. [2025-03-16 19:04:09,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10820 to 10144. [2025-03-16 19:04:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10144 states, 8765 states have (on average 1.325156873930405) internal successors, (11615), 8830 states have internal predecessors, (11615), 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-16 19:04:09,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10144 states to 10144 states and 13518 transitions. [2025-03-16 19:04:09,183 INFO L78 Accepts]: Start accepts. Automaton has 10144 states and 13518 transitions. Word has length 88 [2025-03-16 19:04:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:04:09,183 INFO L471 AbstractCegarLoop]: Abstraction has 10144 states and 13518 transitions. [2025-03-16 19:04:09,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-16 19:04:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 10144 states and 13518 transitions. [2025-03-16 19:04:09,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:04:09,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:04:09,185 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] [2025-03-16 19:04:09,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:04:09,185 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:04:09,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:04:09,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2102093720, now seen corresponding path program 1 times [2025-03-16 19:04:09,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:04:09,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785668219] [2025-03-16 19:04:09,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:04:09,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:04:09,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:04:09,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:04:09,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:04:09,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:04:09,261 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-16 19:04:09,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:04:09,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785668219] [2025-03-16 19:04:09,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785668219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:04:09,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:04:09,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:04:09,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501187049] [2025-03-16 19:04:09,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:04:09,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:04:09,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:04:09,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:04:09,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:04:09,263 INFO L87 Difference]: Start difference. First operand 10144 states and 13518 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-16 19:04:09,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:04:09,930 INFO L93 Difference]: Finished difference Result 19122 states and 25548 transitions. [2025-03-16 19:04:09,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:04:09,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 88 [2025-03-16 19:04:09,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:04:09,973 INFO L225 Difference]: With dead ends: 19122 [2025-03-16 19:04:09,974 INFO L226 Difference]: Without dead ends: 9881 [2025-03-16 19:04:09,990 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-16 19:04:09,992 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 356 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:04:09,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 610 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:04:09,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9881 states. [2025-03-16 19:04:10,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9881 to 8952. [2025-03-16 19:04:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8952 states, 7745 states have (on average 1.3251129761136218) internal successors, (10263), 7788 states have internal predecessors, (10263), 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-16 19:04:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8952 states to 8952 states and 11935 transitions. [2025-03-16 19:04:10,348 INFO L78 Accepts]: Start accepts. Automaton has 8952 states and 11935 transitions. Word has length 88 [2025-03-16 19:04:10,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:04:10,349 INFO L471 AbstractCegarLoop]: Abstraction has 8952 states and 11935 transitions. [2025-03-16 19:04:10,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-16 19:04:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 8952 states and 11935 transitions. [2025-03-16 19:04:10,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:04:10,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:04:10,351 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] [2025-03-16 19:04:10,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:04:10,351 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:04:10,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:04:10,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1270189993, now seen corresponding path program 1 times [2025-03-16 19:04:10,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:04:10,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335218473] [2025-03-16 19:04:10,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:04:10,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:04:10,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:04:10,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:04:10,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:04:10,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:04:10,404 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-16 19:04:10,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:04:10,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335218473] [2025-03-16 19:04:10,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335218473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:04:10,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:04:10,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:04:10,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110719834] [2025-03-16 19:04:10,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:04:10,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:04:10,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:04:10,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:04:10,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:04:10,405 INFO L87 Difference]: Start difference. First operand 8952 states and 11935 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-16 19:04:10,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:04:10,909 INFO L93 Difference]: Finished difference Result 19028 states and 25461 transitions. [2025-03-16 19:04:10,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:04:10,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 88 [2025-03-16 19:04:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:04:10,954 INFO L225 Difference]: With dead ends: 19028 [2025-03-16 19:04:10,954 INFO L226 Difference]: Without dead ends: 10087 [2025-03-16 19:04:10,972 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-16 19:04:10,973 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 268 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:04:10,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 332 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:04:10,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10087 states. [2025-03-16 19:04:11,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10087 to 9965. [2025-03-16 19:04:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9965 states, 8684 states have (on average 1.2840856748042377) internal successors, (11151), 8741 states have internal predecessors, (11151), 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-16 19:04:11,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9965 states to 9965 states and 12899 transitions. [2025-03-16 19:04:11,346 INFO L78 Accepts]: Start accepts. Automaton has 9965 states and 12899 transitions. Word has length 88 [2025-03-16 19:04:11,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:04:11,347 INFO L471 AbstractCegarLoop]: Abstraction has 9965 states and 12899 transitions. [2025-03-16 19:04:11,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-16 19:04:11,347 INFO L276 IsEmpty]: Start isEmpty. Operand 9965 states and 12899 transitions. [2025-03-16 19:04:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:04:11,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:04:11,348 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] [2025-03-16 19:04:11,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:04:11,348 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:04:11,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:04:11,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1391973304, now seen corresponding path program 1 times [2025-03-16 19:04:11,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:04:11,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428869770] [2025-03-16 19:04:11,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:04:11,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:04:11,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:04:11,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:04:11,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:04:11,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:04:11,388 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-16 19:04:11,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:04:11,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428869770] [2025-03-16 19:04:11,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428869770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:04:11,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:04:11,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:04:11,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372992543] [2025-03-16 19:04:11,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:04:11,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:04:11,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:04:11,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:04:11,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:04:11,389 INFO L87 Difference]: Start difference. First operand 9965 states and 12899 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-16 19:04:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:04:12,083 INFO L93 Difference]: Finished difference Result 28572 states and 37284 transitions. [2025-03-16 19:04:12,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:04:12,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 88 [2025-03-16 19:04:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:04:12,149 INFO L225 Difference]: With dead ends: 28572 [2025-03-16 19:04:12,150 INFO L226 Difference]: Without dead ends: 18618 [2025-03-16 19:04:12,173 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-16 19:04:12,173 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 263 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:04:12,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 491 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:04:12,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18618 states. [2025-03-16 19:04:12,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18618 to 18611. [2025-03-16 19:04:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18611 states, 16171 states have (on average 1.2688145445550678) internal successors, (20518), 16293 states have internal predecessors, (20518), 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-16 19:04:12,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18611 states to 18611 states and 24047 transitions. [2025-03-16 19:04:12,958 INFO L78 Accepts]: Start accepts. Automaton has 18611 states and 24047 transitions. Word has length 88 [2025-03-16 19:04:12,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:04:12,958 INFO L471 AbstractCegarLoop]: Abstraction has 18611 states and 24047 transitions. [2025-03-16 19:04:12,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-16 19:04:12,959 INFO L276 IsEmpty]: Start isEmpty. Operand 18611 states and 24047 transitions. [2025-03-16 19:04:12,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 19:04:12,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:04:12,960 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] [2025-03-16 19:04:12,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:04:12,961 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:04:12,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:04:12,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1596765465, now seen corresponding path program 1 times [2025-03-16 19:04:12,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:04:12,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259988331] [2025-03-16 19:04:12,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:04:12,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:04:12,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 19:04:12,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 19:04:12,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:04:12,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:04:12,978 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-16 19:04:12,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:04:12,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259988331] [2025-03-16 19:04:12,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259988331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:04:12,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:04:12,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:04:12,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64641087] [2025-03-16 19:04:12,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:04:12,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:04:12,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:04:12,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:04:12,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:04:12,980 INFO L87 Difference]: Start difference. First operand 18611 states and 24047 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-16 19:04:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:04:13,533 INFO L93 Difference]: Finished difference Result 35969 states and 46384 transitions. [2025-03-16 19:04:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:04:13,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 90 [2025-03-16 19:04:13,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:04:13,605 INFO L225 Difference]: With dead ends: 35969 [2025-03-16 19:04:13,606 INFO L226 Difference]: Without dead ends: 17369 [2025-03-16 19:04:13,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:04:13,641 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 193 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:04:13,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 195 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:04:13,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17369 states. [2025-03-16 19:04:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17369 to 17233. [2025-03-16 19:04:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17233 states, 14990 states have (on average 1.2661774516344229) internal successors, (18980), 15107 states have internal predecessors, (18980), 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-16 19:04:14,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17233 states to 17233 states and 22215 transitions. [2025-03-16 19:04:14,669 INFO L78 Accepts]: Start accepts. Automaton has 17233 states and 22215 transitions. Word has length 90 [2025-03-16 19:04:14,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:04:14,669 INFO L471 AbstractCegarLoop]: Abstraction has 17233 states and 22215 transitions. [2025-03-16 19:04:14,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-16 19:04:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 17233 states and 22215 transitions. [2025-03-16 19:04:14,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:04:14,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:04:14,671 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] [2025-03-16 19:04:14,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:04:14,671 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:04:14,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:04:14,671 INFO L85 PathProgramCache]: Analyzing trace with hash 295215784, now seen corresponding path program 1 times [2025-03-16 19:04:14,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:04:14,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609660385] [2025-03-16 19:04:14,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:04:14,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:04:14,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:04:14,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:04:14,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:04:14,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:04:14,714 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-16 19:04:14,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:04:14,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609660385] [2025-03-16 19:04:14,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609660385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:04:14,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:04:14,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:04:14,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779710184] [2025-03-16 19:04:14,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:04:14,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:04:14,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:04:14,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:04:14,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:04:14,716 INFO L87 Difference]: Start difference. First operand 17233 states and 22215 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-16 19:04:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:04:16,224 INFO L93 Difference]: Finished difference Result 51057 states and 65833 transitions. [2025-03-16 19:04:16,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:04:16,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 92 [2025-03-16 19:04:16,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:04:16,345 INFO L225 Difference]: With dead ends: 51057 [2025-03-16 19:04:16,345 INFO L226 Difference]: Without dead ends: 33835 [2025-03-16 19:04:16,391 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-16 19:04:16,392 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 245 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 507 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-16 19:04:16,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 507 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:04:16,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33835 states. [2025-03-16 19:04:17,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33835 to 33794. [2025-03-16 19:04:17,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33794 states, 29436 states have (on average 1.254008696833809) internal successors, (36913), 29694 states have internal predecessors, (36913), 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-16 19:04:17,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33794 states to 33794 states and 43240 transitions. [2025-03-16 19:04:17,861 INFO L78 Accepts]: Start accepts. Automaton has 33794 states and 43240 transitions. Word has length 92 [2025-03-16 19:04:17,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:04:17,862 INFO L471 AbstractCegarLoop]: Abstraction has 33794 states and 43240 transitions. [2025-03-16 19:04:17,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-16 19:04:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 33794 states and 43240 transitions. [2025-03-16 19:04:17,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:04:17,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:04:17,863 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] [2025-03-16 19:04:17,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:04:17,864 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:04:17,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:04:17,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1463412039, now seen corresponding path program 1 times [2025-03-16 19:04:17,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:04:17,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158344293] [2025-03-16 19:04:17,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:04:17,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:04:17,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:04:17,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:04:17,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:04:17,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:04:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 19:04:17,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:04:17,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158344293] [2025-03-16 19:04:17,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158344293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:04:17,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:04:17,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:04:17,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164937058] [2025-03-16 19:04:17,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:04:17,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:04:17,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:04:17,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:04:17,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:04:17,889 INFO L87 Difference]: Start difference. First operand 33794 states and 43240 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-16 19:04:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:04:18,968 INFO L93 Difference]: Finished difference Result 60730 states and 77668 transitions. [2025-03-16 19:04:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:04:18,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 92 [2025-03-16 19:04:18,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:04:19,073 INFO L225 Difference]: With dead ends: 60730 [2025-03-16 19:04:19,073 INFO L226 Difference]: Without dead ends: 26947 [2025-03-16 19:04:19,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:04:19,124 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 191 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:04:19,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 194 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:04:19,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26947 states. [2025-03-16 19:04:20,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26947 to 26947. [2025-03-16 19:04:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26947 states, 23466 states have (on average 1.2524929685502428) internal successors, (29391), 23673 states have internal predecessors, (29391), 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-16 19:04:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26947 states to 26947 states and 34445 transitions. [2025-03-16 19:04:20,387 INFO L78 Accepts]: Start accepts. Automaton has 26947 states and 34445 transitions. Word has length 92 [2025-03-16 19:04:20,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:04:20,387 INFO L471 AbstractCegarLoop]: Abstraction has 26947 states and 34445 transitions. [2025-03-16 19:04:20,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-16 19:04:20,387 INFO L276 IsEmpty]: Start isEmpty. Operand 26947 states and 34445 transitions. [2025-03-16 19:04:20,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:04:20,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:04:20,388 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] [2025-03-16 19:04:20,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:04:20,389 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:04:20,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:04:20,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2061499608, now seen corresponding path program 1 times [2025-03-16 19:04:20,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:04:20,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360196969] [2025-03-16 19:04:20,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:04:20,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:04:20,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:04:20,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:04:20,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:04:20,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:04:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:04:20,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:04:20,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360196969] [2025-03-16 19:04:20,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360196969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:04:20,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:04:20,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:04:20,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117043640] [2025-03-16 19:04:20,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:04:20,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:04:20,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:04:20,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:04:20,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:04:20,419 INFO L87 Difference]: Start difference. First operand 26947 states and 34445 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-16 19:04:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:04:22,937 INFO L93 Difference]: Finished difference Result 78109 states and 100178 transitions. [2025-03-16 19:04:22,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:04:22,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 96 [2025-03-16 19:04:22,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:04:23,109 INFO L225 Difference]: With dead ends: 78109 [2025-03-16 19:04:23,110 INFO L226 Difference]: Without dead ends: 51173 [2025-03-16 19:04:23,162 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-16 19:04:23,163 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 244 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 446 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-16 19:04:23,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 446 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:04:23,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51173 states. [2025-03-16 19:04:25,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51173 to 50260. [2025-03-16 19:04:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50260 states, 43537 states have (on average 1.2430805981119508) internal successors, (54120), 44051 states have internal predecessors, (54120), 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-16 19:04:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50260 states to 50260 states and 64378 transitions. [2025-03-16 19:04:25,643 INFO L78 Accepts]: Start accepts. Automaton has 50260 states and 64378 transitions. Word has length 96 [2025-03-16 19:04:25,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:04:25,643 INFO L471 AbstractCegarLoop]: Abstraction has 50260 states and 64378 transitions. [2025-03-16 19:04:25,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-16 19:04:25,643 INFO L276 IsEmpty]: Start isEmpty. Operand 50260 states and 64378 transitions. [2025-03-16 19:04:25,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:04:25,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:04:25,645 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] [2025-03-16 19:04:25,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:04:25,645 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:04:25,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:04:25,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1848100905, now seen corresponding path program 1 times [2025-03-16 19:04:25,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:04:25,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998540323] [2025-03-16 19:04:25,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:04:25,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:04:25,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:04:25,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:04:25,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:04:25,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:04:25,672 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-16 19:04:25,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:04:25,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998540323] [2025-03-16 19:04:25,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998540323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:04:25,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:04:25,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:04:25,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861031294] [2025-03-16 19:04:25,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:04:25,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:04:25,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:04:25,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:04:25,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:04:25,674 INFO L87 Difference]: Start difference. First operand 50260 states and 64378 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-16 19:04:27,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:04:27,476 INFO L93 Difference]: Finished difference Result 92351 states and 118462 transitions. [2025-03-16 19:04:27,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:04:27,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-16 19:04:27,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:04:27,628 INFO L225 Difference]: With dead ends: 92351 [2025-03-16 19:04:27,628 INFO L226 Difference]: Without dead ends: 42102 [2025-03-16 19:04:27,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:04:27,702 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:04:27,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 193 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:04:27,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42102 states. [2025-03-16 19:04:30,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42102 to 42102. [2025-03-16 19:04:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42102 states, 36492 states have (on average 1.246081332894881) internal successors, (45472), 36885 states have internal predecessors, (45472), 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-16 19:04:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42102 states to 42102 states and 54100 transitions. [2025-03-16 19:04:30,741 INFO L78 Accepts]: Start accepts. Automaton has 42102 states and 54100 transitions. Word has length 96 [2025-03-16 19:04:30,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:04:30,741 INFO L471 AbstractCegarLoop]: Abstraction has 42102 states and 54100 transitions. [2025-03-16 19:04:30,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-16 19:04:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 42102 states and 54100 transitions. [2025-03-16 19:04:30,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:04:30,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:04:30,743 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] [2025-03-16 19:04:30,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:04:30,743 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:04:30,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:04:30,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1037330344, now seen corresponding path program 1 times [2025-03-16 19:04:30,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:04:30,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317806731] [2025-03-16 19:04:30,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:04:30,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:04:30,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:04:30,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:04:30,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:04:30,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:04:30,785 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-16 19:04:30,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:04:30,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317806731] [2025-03-16 19:04:30,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317806731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:04:30,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:04:30,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:04:30,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797825926] [2025-03-16 19:04:30,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:04:30,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:04:30,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:04:30,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:04:30,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:04:30,786 INFO L87 Difference]: Start difference. First operand 42102 states and 54100 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 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-16 19:04:34,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:04:34,500 INFO L93 Difference]: Finished difference Result 124428 states and 160125 transitions. [2025-03-16 19:04:34,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:04:34,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 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 100 [2025-03-16 19:04:34,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:04:34,685 INFO L225 Difference]: With dead ends: 124428 [2025-03-16 19:04:34,685 INFO L226 Difference]: Without dead ends: 61512 [2025-03-16 19:04:34,759 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-16 19:04:34,759 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 940 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:04:34,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 693 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:04:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61512 states. [2025-03-16 19:04:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61512 to 58683. [2025-03-16 19:04:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58683 states, 50792 states have (on average 1.2400968656481335) internal successors, (62987), 51340 states have internal predecessors, (62987), 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-16 19:04:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58683 states to 58683 states and 75549 transitions. [2025-03-16 19:04:38,115 INFO L78 Accepts]: Start accepts. Automaton has 58683 states and 75549 transitions. Word has length 100 [2025-03-16 19:04:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:04:38,115 INFO L471 AbstractCegarLoop]: Abstraction has 58683 states and 75549 transitions. [2025-03-16 19:04:38,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 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-16 19:04:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 58683 states and 75549 transitions. [2025-03-16 19:04:38,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 19:04:38,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:04:38,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:04:38,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:04:38,125 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:04:38,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:04:38,125 INFO L85 PathProgramCache]: Analyzing trace with hash 176404634, now seen corresponding path program 1 times [2025-03-16 19:04:38,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:04:38,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822158839] [2025-03-16 19:04:38,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:04:38,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:04:38,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 19:04:38,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 19:04:38,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:04:38,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:04:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 19:04:38,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:04:38,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822158839] [2025-03-16 19:04:38,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822158839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:04:38,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:04:38,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:04:38,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084357433] [2025-03-16 19:04:38,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:04:38,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:04:38,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:04:38,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:04:38,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:04:38,201 INFO L87 Difference]: Start difference. First operand 58683 states and 75549 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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)