./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.09.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/transmitter.09.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 3945fa4b58cef50cb4b44b435a699812e99a1f6375664d08551274c6b50bee45 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:09:23,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:09:23,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:09:23,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:09:23,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:09:23,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:09:23,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:09:23,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:09:23,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:09:23,332 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:09:23,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:09:23,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:09:23,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:09:23,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:09:23,333 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:09:23,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:09:23,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:09:23,333 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:09:23,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:09:23,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:09:23,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:09:23,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:09:23,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:09:23,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:09:23,334 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:09:23,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:09:23,334 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:09:23,334 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:09:23,334 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:09:23,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:09:23,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:09:23,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:09:23,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:09:23,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:09:23,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:09:23,335 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:09:23,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:09:23,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:09:23,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:09:23,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:09:23,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:09:23,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:09:23,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:09:23,336 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-jdk21/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 -> 3945fa4b58cef50cb4b44b435a699812e99a1f6375664d08551274c6b50bee45 [2025-02-05 16:09:23,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:09:23,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:09:23,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:09:23,675 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:09:23,675 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:09:23,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.09.cil.c [2025-02-05 16:09:25,109 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/363b8dab4/062bf499ec294c108a5d241a76fa89ff/FLAGd1ffe0a84 [2025-02-05 16:09:25,398 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:09:25,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.09.cil.c [2025-02-05 16:09:25,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/363b8dab4/062bf499ec294c108a5d241a76fa89ff/FLAGd1ffe0a84 [2025-02-05 16:09:25,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/363b8dab4/062bf499ec294c108a5d241a76fa89ff [2025-02-05 16:09:25,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:09:25,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:09:25,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:09:25,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:09:25,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:09:25,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:09:25" (1/1) ... [2025-02-05 16:09:25,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@228d7dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:09:25, skipping insertion in model container [2025-02-05 16:09:25,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:09:25" (1/1) ... [2025-02-05 16:09:25,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:09:25,610 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.09.cil.c[706,719] [2025-02-05 16:09:25,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:09:25,755 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:09:25,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.09.cil.c[706,719] [2025-02-05 16:09:25,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:09:25,863 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:09:25,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:09:25 WrapperNode [2025-02-05 16:09:25,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:09:25,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:09:25,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:09:25,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:09:25,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:09:25" (1/1) ... [2025-02-05 16:09:25,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:09:25" (1/1) ... [2025-02-05 16:09:25,931 INFO L138 Inliner]: procedures = 46, calls = 57, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 643 [2025-02-05 16:09:25,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:09:25,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:09:25,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:09:25,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:09:25,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:09:25" (1/1) ... [2025-02-05 16:09:25,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:09:25" (1/1) ... [2025-02-05 16:09:25,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:09:25" (1/1) ... [2025-02-05 16:09:25,972 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-02-05 16:09:25,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:09:25" (1/1) ... [2025-02-05 16:09:25,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:09:25" (1/1) ... [2025-02-05 16:09:25,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:09:25" (1/1) ... [2025-02-05 16:09:25,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:09:25" (1/1) ... [2025-02-05 16:09:25,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:09:25" (1/1) ... [2025-02-05 16:09:25,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:09:25" (1/1) ... [2025-02-05 16:09:26,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:09:26,005 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:09:26,005 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:09:26,005 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:09:26,008 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:09:25" (1/1) ... [2025-02-05 16:09:26,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:09:26,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:09:26,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:09:26,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:09:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:09:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 16:09:26,069 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 16:09:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 16:09:26,069 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 16:09:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 16:09:26,070 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 16:09:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 16:09:26,070 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 16:09:26,071 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 16:09:26,071 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 16:09:26,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:09:26,071 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 16:09:26,071 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 16:09:26,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:09:26,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:09:26,169 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:09:26,171 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:09:26,925 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-02-05 16:09:26,925 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:09:26,953 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:09:26,953 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:09:26,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:09:26 BoogieIcfgContainer [2025-02-05 16:09:26,954 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:09:26,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:09:26,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:09:26,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:09:26,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:09:25" (1/3) ... [2025-02-05 16:09:26,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6476df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:09:26, skipping insertion in model container [2025-02-05 16:09:26,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:09:25" (2/3) ... [2025-02-05 16:09:26,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6476df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:09:26, skipping insertion in model container [2025-02-05 16:09:26,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:09:26" (3/3) ... [2025-02-05 16:09:26,963 INFO L128 eAbstractionObserver]: Analyzing ICFG transmitter.09.cil.c [2025-02-05 16:09:26,974 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:09:26,976 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG transmitter.09.cil.c that has 7 procedures, 325 locations, 1 initial locations, 13 loop locations, and 1 error locations. [2025-02-05 16:09:27,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:09:27,054 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;@112b6d4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:09:27,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:09:27,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 325 states, 295 states have (on average 1.5593220338983051) internal successors, (460), 297 states have internal predecessors, (460), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 16:09:27,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:09:27,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:27,077 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:27,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:27,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:27,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1079843104, now seen corresponding path program 1 times [2025-02-05 16:09:27,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:27,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905613980] [2025-02-05 16:09:27,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:27,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:27,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:09:27,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:09:27,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:27,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:27,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:09:27,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:27,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905613980] [2025-02-05 16:09:27,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905613980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:27,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:27,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:09:27,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453316071] [2025-02-05 16:09:27,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:27,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:09:27,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:27,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:09:27,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:09:27,504 INFO L87 Difference]: Start difference. First operand has 325 states, 295 states have (on average 1.5593220338983051) internal successors, (460), 297 states have internal predecessors, (460), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-02-05 16:09:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:27,583 INFO L93 Difference]: Finished difference Result 642 states and 998 transitions. [2025-02-05 16:09:27,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:09:27,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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 151 [2025-02-05 16:09:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:27,597 INFO L225 Difference]: With dead ends: 642 [2025-02-05 16:09:27,597 INFO L226 Difference]: Without dead ends: 319 [2025-02-05 16:09:27,605 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-02-05 16:09:27,607 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 482 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:27,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 486 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:09:27,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-02-05 16:09:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2025-02-05 16:09:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 290 states have (on average 1.513793103448276) internal successors, (439), 291 states have internal predecessors, (439), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 16:09:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 483 transitions. [2025-02-05 16:09:27,685 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 483 transitions. Word has length 151 [2025-02-05 16:09:27,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:27,686 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 483 transitions. [2025-02-05 16:09:27,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-02-05 16:09:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 483 transitions. [2025-02-05 16:09:27,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:09:27,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:27,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:27,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:09:27,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:27,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:27,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1248986879, now seen corresponding path program 1 times [2025-02-05 16:09:27,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:27,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502460851] [2025-02-05 16:09:27,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:27,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:27,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:09:27,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:09:27,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:27,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:09:27,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:27,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502460851] [2025-02-05 16:09:27,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502460851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:27,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:27,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:09:27,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265226148] [2025-02-05 16:09:27,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:27,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:09:27,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:27,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:09:27,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:09:27,885 INFO L87 Difference]: Start difference. First operand 319 states and 483 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-02-05 16:09:27,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:27,928 INFO L93 Difference]: Finished difference Result 624 states and 943 transitions. [2025-02-05 16:09:27,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:09:27,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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 151 [2025-02-05 16:09:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:27,935 INFO L225 Difference]: With dead ends: 624 [2025-02-05 16:09:27,936 INFO L226 Difference]: Without dead ends: 319 [2025-02-05 16:09:27,938 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-02-05 16:09:27,941 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 469 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:27,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 481 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:09:27,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-02-05 16:09:27,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2025-02-05 16:09:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 290 states have (on average 1.5103448275862068) internal successors, (438), 291 states have internal predecessors, (438), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 16:09:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 482 transitions. [2025-02-05 16:09:27,973 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 482 transitions. Word has length 151 [2025-02-05 16:09:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:27,974 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 482 transitions. [2025-02-05 16:09:27,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-02-05 16:09:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 482 transitions. [2025-02-05 16:09:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:09:27,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:27,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:27,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:09:27,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:27,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:27,982 INFO L85 PathProgramCache]: Analyzing trace with hash 689552418, now seen corresponding path program 1 times [2025-02-05 16:09:27,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:27,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754737582] [2025-02-05 16:09:27,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:27,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:28,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:09:28,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:09:28,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:28,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:28,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:09:28,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:28,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754737582] [2025-02-05 16:09:28,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754737582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:28,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:28,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:09:28,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770510727] [2025-02-05 16:09:28,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:28,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:09:28,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:28,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:09:28,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:09:28,306 INFO L87 Difference]: Start difference. First operand 319 states and 482 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 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-02-05 16:09:29,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:29,016 INFO L93 Difference]: Finished difference Result 957 states and 1474 transitions. [2025-02-05 16:09:29,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:09:29,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 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 151 [2025-02-05 16:09:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:29,023 INFO L225 Difference]: With dead ends: 957 [2025-02-05 16:09:29,023 INFO L226 Difference]: Without dead ends: 655 [2025-02-05 16:09:29,025 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-02-05 16:09:29,026 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 895 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:29,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1338 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:09:29,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-02-05 16:09:29,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 632. [2025-02-05 16:09:29,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 579 states have (on average 1.5215889464594128) internal successors, (881), 581 states have internal predecessors, (881), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-02-05 16:09:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 960 transitions. [2025-02-05 16:09:29,075 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 960 transitions. Word has length 151 [2025-02-05 16:09:29,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:29,077 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 960 transitions. [2025-02-05 16:09:29,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 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-02-05 16:09:29,077 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 960 transitions. [2025-02-05 16:09:29,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:09:29,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:29,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:29,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:09:29,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:29,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:29,083 INFO L85 PathProgramCache]: Analyzing trace with hash -36192635, now seen corresponding path program 1 times [2025-02-05 16:09:29,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:29,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716002770] [2025-02-05 16:09:29,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:29,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:29,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:09:29,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:09:29,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:29,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:09:29,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:29,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716002770] [2025-02-05 16:09:29,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716002770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:29,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:29,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:09:29,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349075772] [2025-02-05 16:09:29,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:29,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:09:29,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:29,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:09:29,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:09:29,333 INFO L87 Difference]: Start difference. First operand 632 states and 960 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:30,365 INFO L93 Difference]: Finished difference Result 1709 states and 2628 transitions. [2025-02-05 16:09:30,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:09:30,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-02-05 16:09:30,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:30,375 INFO L225 Difference]: With dead ends: 1709 [2025-02-05 16:09:30,375 INFO L226 Difference]: Without dead ends: 1094 [2025-02-05 16:09:30,377 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-02-05 16:09:30,377 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 993 mSDsluCounter, 1966 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 2613 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:30,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 2613 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:09:30,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2025-02-05 16:09:30,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 925. [2025-02-05 16:09:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 848 states have (on average 1.5141509433962264) internal successors, (1284), 851 states have internal predecessors, (1284), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-02-05 16:09:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1400 transitions. [2025-02-05 16:09:30,450 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1400 transitions. Word has length 151 [2025-02-05 16:09:30,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:30,451 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1400 transitions. [2025-02-05 16:09:30,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:30,451 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1400 transitions. [2025-02-05 16:09:30,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:09:30,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:30,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:30,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:09:30,456 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:30,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:30,456 INFO L85 PathProgramCache]: Analyzing trace with hash -308628922, now seen corresponding path program 1 times [2025-02-05 16:09:30,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:30,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053301186] [2025-02-05 16:09:30,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:30,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:30,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:09:30,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:09:30,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:30,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:09:30,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:30,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053301186] [2025-02-05 16:09:30,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053301186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:30,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:30,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:09:30,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905384513] [2025-02-05 16:09:30,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:30,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:09:30,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:30,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:09:30,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:09:30,667 INFO L87 Difference]: Start difference. First operand 925 states and 1400 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:31,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:31,673 INFO L93 Difference]: Finished difference Result 2637 states and 4045 transitions. [2025-02-05 16:09:31,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:09:31,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-02-05 16:09:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:31,690 INFO L225 Difference]: With dead ends: 2637 [2025-02-05 16:09:31,690 INFO L226 Difference]: Without dead ends: 1729 [2025-02-05 16:09:31,693 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-02-05 16:09:31,694 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 988 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:31,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 2597 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:09:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2025-02-05 16:09:31,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1546. [2025-02-05 16:09:31,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1419 states have (on average 1.5172656800563777) internal successors, (2153), 1426 states have internal predecessors, (2153), 90 states have call successors, (90), 30 states have call predecessors, (90), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-02-05 16:09:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2349 transitions. [2025-02-05 16:09:31,799 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2349 transitions. Word has length 151 [2025-02-05 16:09:31,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:31,800 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2349 transitions. [2025-02-05 16:09:31,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2349 transitions. [2025-02-05 16:09:31,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:09:31,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:31,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:31,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:09:31,804 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:31,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2118532507, now seen corresponding path program 1 times [2025-02-05 16:09:31,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:31,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947886642] [2025-02-05 16:09:31,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:31,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:31,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:09:31,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:09:31,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:31,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:32,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:09:32,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:32,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947886642] [2025-02-05 16:09:32,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947886642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:32,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:32,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:09:32,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917322018] [2025-02-05 16:09:32,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:32,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:09:32,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:32,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:09:32,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:09:32,011 INFO L87 Difference]: Start difference. First operand 1546 states and 2349 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:32,386 INFO L93 Difference]: Finished difference Result 3262 states and 5040 transitions. [2025-02-05 16:09:32,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:09:32,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-02-05 16:09:32,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:32,396 INFO L225 Difference]: With dead ends: 3262 [2025-02-05 16:09:32,397 INFO L226 Difference]: Without dead ends: 1733 [2025-02-05 16:09:32,401 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-02-05 16:09:32,402 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 642 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:32,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 961 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:09:32,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2025-02-05 16:09:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1546. [2025-02-05 16:09:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1419 states have (on average 1.5137420718816068) internal successors, (2148), 1426 states have internal predecessors, (2148), 90 states have call successors, (90), 30 states have call predecessors, (90), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-02-05 16:09:32,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2344 transitions. [2025-02-05 16:09:32,500 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2344 transitions. Word has length 151 [2025-02-05 16:09:32,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:32,500 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2344 transitions. [2025-02-05 16:09:32,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2344 transitions. [2025-02-05 16:09:32,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:09:32,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:32,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:32,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:09:32,504 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:32,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:32,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1702408806, now seen corresponding path program 1 times [2025-02-05 16:09:32,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:32,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282877792] [2025-02-05 16:09:32,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:32,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:32,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:09:32,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:09:32,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:32,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:32,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:09:32,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:32,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282877792] [2025-02-05 16:09:32,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282877792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:32,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:32,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:09:32,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949736500] [2025-02-05 16:09:32,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:32,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:09:32,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:32,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:09:32,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:09:32,648 INFO L87 Difference]: Start difference. First operand 1546 states and 2344 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:33,014 INFO L93 Difference]: Finished difference Result 3251 states and 5008 transitions. [2025-02-05 16:09:33,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:09:33,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-02-05 16:09:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:33,025 INFO L225 Difference]: With dead ends: 3251 [2025-02-05 16:09:33,025 INFO L226 Difference]: Without dead ends: 1722 [2025-02-05 16:09:33,030 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-02-05 16:09:33,031 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 639 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:33,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 953 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:09:33,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2025-02-05 16:09:33,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1546. [2025-02-05 16:09:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1419 states have (on average 1.5102184637068359) internal successors, (2143), 1426 states have internal predecessors, (2143), 90 states have call successors, (90), 30 states have call predecessors, (90), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-02-05 16:09:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2339 transitions. [2025-02-05 16:09:33,123 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2339 transitions. Word has length 151 [2025-02-05 16:09:33,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:33,123 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2339 transitions. [2025-02-05 16:09:33,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:33,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2339 transitions. [2025-02-05 16:09:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:09:33,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:33,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:33,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:09:33,127 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:33,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:33,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1410022981, now seen corresponding path program 1 times [2025-02-05 16:09:33,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:33,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989936881] [2025-02-05 16:09:33,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:33,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:33,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:09:33,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:09:33,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:33,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:09:33,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:33,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989936881] [2025-02-05 16:09:33,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989936881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:33,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:33,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:09:33,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93244290] [2025-02-05 16:09:33,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:33,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:09:33,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:33,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:09:33,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:09:33,299 INFO L87 Difference]: Start difference. First operand 1546 states and 2339 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:34,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:34,375 INFO L93 Difference]: Finished difference Result 4596 states and 7058 transitions. [2025-02-05 16:09:34,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:09:34,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-02-05 16:09:34,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:34,393 INFO L225 Difference]: With dead ends: 4596 [2025-02-05 16:09:34,393 INFO L226 Difference]: Without dead ends: 3067 [2025-02-05 16:09:34,398 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-02-05 16:09:34,399 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 967 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 2547 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:34,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 2547 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:09:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2025-02-05 16:09:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 2869. [2025-02-05 16:09:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2869 states, 2636 states have (on average 1.5231411229135052) internal successors, (4015), 2657 states have internal predecessors, (4015), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-02-05 16:09:34,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 4395 transitions. [2025-02-05 16:09:34,556 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 4395 transitions. Word has length 151 [2025-02-05 16:09:34,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:34,557 INFO L471 AbstractCegarLoop]: Abstraction has 2869 states and 4395 transitions. [2025-02-05 16:09:34,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 4395 transitions. [2025-02-05 16:09:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:09:34,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:34,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:34,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:09:34,562 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:34,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:34,563 INFO L85 PathProgramCache]: Analyzing trace with hash -954713466, now seen corresponding path program 1 times [2025-02-05 16:09:34,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:34,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036852145] [2025-02-05 16:09:34,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:34,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:34,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:09:34,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:09:34,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:34,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:34,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:09:34,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:34,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036852145] [2025-02-05 16:09:34,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036852145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:34,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:34,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:09:34,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624652968] [2025-02-05 16:09:34,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:34,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:09:34,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:34,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:09:34,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:09:34,691 INFO L87 Difference]: Start difference. First operand 2869 states and 4395 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:35,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:35,109 INFO L93 Difference]: Finished difference Result 6127 states and 9572 transitions. [2025-02-05 16:09:35,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:09:35,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-02-05 16:09:35,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:35,130 INFO L225 Difference]: With dead ends: 6127 [2025-02-05 16:09:35,130 INFO L226 Difference]: Without dead ends: 3275 [2025-02-05 16:09:35,140 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-02-05 16:09:35,141 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 635 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:35,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 939 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:09:35,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2025-02-05 16:09:35,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 2869. [2025-02-05 16:09:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2869 states, 2636 states have (on average 1.5197268588770865) internal successors, (4006), 2657 states have internal predecessors, (4006), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-02-05 16:09:35,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 4386 transitions. [2025-02-05 16:09:35,312 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 4386 transitions. Word has length 151 [2025-02-05 16:09:35,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:35,313 INFO L471 AbstractCegarLoop]: Abstraction has 2869 states and 4386 transitions. [2025-02-05 16:09:35,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:35,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 4386 transitions. [2025-02-05 16:09:35,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:09:35,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:35,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:35,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:09:35,318 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:35,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:35,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1169542619, now seen corresponding path program 1 times [2025-02-05 16:09:35,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:35,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329159915] [2025-02-05 16:09:35,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:35,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:35,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:09:35,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:09:35,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:35,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:09:35,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:35,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329159915] [2025-02-05 16:09:35,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329159915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:35,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:35,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:09:35,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571407291] [2025-02-05 16:09:35,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:35,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:09:35,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:35,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:09:35,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:09:35,488 INFO L87 Difference]: Start difference. First operand 2869 states and 4386 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:36,625 INFO L93 Difference]: Finished difference Result 8819 states and 13745 transitions. [2025-02-05 16:09:36,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:09:36,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-02-05 16:09:36,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:36,656 INFO L225 Difference]: With dead ends: 8819 [2025-02-05 16:09:36,656 INFO L226 Difference]: Without dead ends: 5967 [2025-02-05 16:09:36,665 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-02-05 16:09:36,666 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 954 mSDsluCounter, 1894 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 2516 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:36,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 2516 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:09:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5967 states. [2025-02-05 16:09:36,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5967 to 5731. [2025-02-05 16:09:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5731 states, 5268 states have (on average 1.5406226271829917) internal successors, (8116), 5335 states have internal predecessors, (8116), 294 states have call successors, (294), 102 states have call predecessors, (294), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-02-05 16:09:37,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5731 states to 5731 states and 8960 transitions. [2025-02-05 16:09:37,008 INFO L78 Accepts]: Start accepts. Automaton has 5731 states and 8960 transitions. Word has length 151 [2025-02-05 16:09:37,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:37,009 INFO L471 AbstractCegarLoop]: Abstraction has 5731 states and 8960 transitions. [2025-02-05 16:09:37,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:37,010 INFO L276 IsEmpty]: Start isEmpty. Operand 5731 states and 8960 transitions. [2025-02-05 16:09:37,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:09:37,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:37,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:37,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:09:37,018 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:37,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:37,019 INFO L85 PathProgramCache]: Analyzing trace with hash 624642726, now seen corresponding path program 1 times [2025-02-05 16:09:37,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:37,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381005878] [2025-02-05 16:09:37,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:37,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:37,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:09:37,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:09:37,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:37,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:37,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:09:37,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:37,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381005878] [2025-02-05 16:09:37,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381005878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:37,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:37,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:09:37,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880468441] [2025-02-05 16:09:37,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:37,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:09:37,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:37,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:09:37,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:09:37,160 INFO L87 Difference]: Start difference. First operand 5731 states and 8960 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:37,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:37,729 INFO L93 Difference]: Finished difference Result 12441 states and 19928 transitions. [2025-02-05 16:09:37,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:09:37,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-02-05 16:09:37,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:37,777 INFO L225 Difference]: With dead ends: 12441 [2025-02-05 16:09:37,777 INFO L226 Difference]: Without dead ends: 6727 [2025-02-05 16:09:37,795 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-02-05 16:09:37,796 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 631 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:37,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 925 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:09:37,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6727 states. [2025-02-05 16:09:38,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6727 to 5731. [2025-02-05 16:09:38,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5731 states, 5268 states have (on average 1.5373955960516326) internal successors, (8099), 5335 states have internal predecessors, (8099), 294 states have call successors, (294), 102 states have call predecessors, (294), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-02-05 16:09:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5731 states to 5731 states and 8943 transitions. [2025-02-05 16:09:38,231 INFO L78 Accepts]: Start accepts. Automaton has 5731 states and 8943 transitions. Word has length 151 [2025-02-05 16:09:38,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:38,231 INFO L471 AbstractCegarLoop]: Abstraction has 5731 states and 8943 transitions. [2025-02-05 16:09:38,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand 5731 states and 8943 transitions. [2025-02-05 16:09:38,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:09:38,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:38,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:38,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:09:38,240 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:38,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:38,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1098161669, now seen corresponding path program 1 times [2025-02-05 16:09:38,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:38,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526746191] [2025-02-05 16:09:38,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:38,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:38,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:09:38,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:09:38,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:38,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:09:38,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:38,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526746191] [2025-02-05 16:09:38,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526746191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:38,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:38,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:09:38,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715808112] [2025-02-05 16:09:38,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:38,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:09:38,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:38,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:09:38,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:09:38,383 INFO L87 Difference]: Start difference. First operand 5731 states and 8943 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:39,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:39,708 INFO L93 Difference]: Finished difference Result 18011 states and 28842 transitions. [2025-02-05 16:09:39,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:09:39,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-02-05 16:09:39,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:39,785 INFO L225 Difference]: With dead ends: 18011 [2025-02-05 16:09:39,785 INFO L226 Difference]: Without dead ends: 12297 [2025-02-05 16:09:39,807 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-02-05 16:09:39,808 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 941 mSDsluCounter, 1871 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 2485 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:39,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 2485 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:09:39,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12297 states. [2025-02-05 16:09:40,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12297 to 11995. [2025-02-05 16:09:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11995 states, 11018 states have (on average 1.562261753494282) internal successors, (17213), 11231 states have internal predecessors, (17213), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-02-05 16:09:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11995 states to 11995 states and 19369 transitions. [2025-02-05 16:09:40,617 INFO L78 Accepts]: Start accepts. Automaton has 11995 states and 19369 transitions. Word has length 151 [2025-02-05 16:09:40,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:40,618 INFO L471 AbstractCegarLoop]: Abstraction has 11995 states and 19369 transitions. [2025-02-05 16:09:40,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:40,618 INFO L276 IsEmpty]: Start isEmpty. Operand 11995 states and 19369 transitions. [2025-02-05 16:09:40,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:09:40,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:40,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:40,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:09:40,635 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:40,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:40,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1529078470, now seen corresponding path program 1 times [2025-02-05 16:09:40,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:40,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401763546] [2025-02-05 16:09:40,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:40,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:40,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:09:40,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:09:40,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:40,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:09:40,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:40,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401763546] [2025-02-05 16:09:40,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401763546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:40,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:40,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:09:40,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981504651] [2025-02-05 16:09:40,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:40,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:09:40,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:40,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:09:40,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:09:40,813 INFO L87 Difference]: Start difference. First operand 11995 states and 19369 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:42,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:42,701 INFO L93 Difference]: Finished difference Result 40435 states and 67491 transitions. [2025-02-05 16:09:42,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:09:42,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-02-05 16:09:42,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:42,856 INFO L225 Difference]: With dead ends: 40435 [2025-02-05 16:09:42,856 INFO L226 Difference]: Without dead ends: 28457 [2025-02-05 16:09:42,903 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-02-05 16:09:42,904 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 1190 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:42,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 2451 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:09:42,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28457 states. [2025-02-05 16:09:44,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28457 to 25902. [2025-02-05 16:09:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25902 states, 23767 states have (on average 1.5941852147936213) internal successors, (37889), 24434 states have internal predecessors, (37889), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-02-05 16:09:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25902 states to 25902 states and 44141 transitions. [2025-02-05 16:09:44,755 INFO L78 Accepts]: Start accepts. Automaton has 25902 states and 44141 transitions. Word has length 151 [2025-02-05 16:09:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:44,756 INFO L471 AbstractCegarLoop]: Abstraction has 25902 states and 44141 transitions. [2025-02-05 16:09:44,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:44,757 INFO L276 IsEmpty]: Start isEmpty. Operand 25902 states and 44141 transitions. [2025-02-05 16:09:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:09:44,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:44,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:44,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:09:44,786 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:44,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:44,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1643609627, now seen corresponding path program 1 times [2025-02-05 16:09:44,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:44,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361714183] [2025-02-05 16:09:44,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:44,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:44,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:09:44,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:09:44,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:44,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:09:44,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:44,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361714183] [2025-02-05 16:09:44,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361714183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:44,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:44,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:09:44,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916276652] [2025-02-05 16:09:44,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:44,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:09:44,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:44,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:09:44,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:09:44,946 INFO L87 Difference]: Start difference. First operand 25902 states and 44141 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:47,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:47,781 INFO L93 Difference]: Finished difference Result 88044 states and 157533 transitions. [2025-02-05 16:09:47,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:09:47,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-02-05 16:09:47,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:48,143 INFO L225 Difference]: With dead ends: 88044 [2025-02-05 16:09:48,143 INFO L226 Difference]: Without dead ends: 62159 [2025-02-05 16:09:48,234 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-02-05 16:09:48,234 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1155 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 2439 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:48,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 2439 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:09:48,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62159 states. [2025-02-05 16:09:51,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62159 to 57815. [2025-02-05 16:09:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57815 states, 52910 states have (on average 1.6256473256473256) internal successors, (86013), 54971 states have internal predecessors, (86013), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-02-05 16:09:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57815 states to 57815 states and 106537 transitions. [2025-02-05 16:09:52,484 INFO L78 Accepts]: Start accepts. Automaton has 57815 states and 106537 transitions. Word has length 151 [2025-02-05 16:09:52,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:52,485 INFO L471 AbstractCegarLoop]: Abstraction has 57815 states and 106537 transitions. [2025-02-05 16:09:52,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:52,486 INFO L276 IsEmpty]: Start isEmpty. Operand 57815 states and 106537 transitions. [2025-02-05 16:09:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:09:52,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:52,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:52,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:09:52,539 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:52,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:52,540 INFO L85 PathProgramCache]: Analyzing trace with hash 747897574, now seen corresponding path program 1 times [2025-02-05 16:09:52,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:52,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165787390] [2025-02-05 16:09:52,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:52,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:52,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:09:52,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:09:52,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:52,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:09:52,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:52,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165787390] [2025-02-05 16:09:52,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165787390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:52,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:52,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:09:52,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411126850] [2025-02-05 16:09:52,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:52,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:09:52,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:52,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:09:52,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:09:52,686 INFO L87 Difference]: Start difference. First operand 57815 states and 106537 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:09:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:58,653 INFO L93 Difference]: Finished difference Result 197723 states and 391555 transitions. [2025-02-05 16:09:58,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:09:58,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-02-05 16:09:58,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:59,612 INFO L225 Difference]: With dead ends: 197723 [2025-02-05 16:09:59,612 INFO L226 Difference]: Without dead ends: 139925 [2025-02-05 16:09:59,841 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-02-05 16:09:59,842 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 1120 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 2427 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:59,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 2427 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:09:59,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139925 states. [2025-02-05 16:10:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139925 to 132384. [2025-02-05 16:10:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132384 states, 120545 states have (on average 1.6555228337965076) internal successors, (199565), 126852 states have internal predecessors, (199565), 3990 states have call successors, (3990), 1542 states have call predecessors, (3990), 7848 states have return successors, (69526), 4245 states have call predecessors, (69526), 3990 states have call successors, (69526) [2025-02-05 16:10:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132384 states to 132384 states and 273081 transitions. [2025-02-05 16:10:07,295 INFO L78 Accepts]: Start accepts. Automaton has 132384 states and 273081 transitions. Word has length 151 [2025-02-05 16:10:07,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:07,295 INFO L471 AbstractCegarLoop]: Abstraction has 132384 states and 273081 transitions. [2025-02-05 16:10:07,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-02-05 16:10:07,296 INFO L276 IsEmpty]: Start isEmpty. Operand 132384 states and 273081 transitions. [2025-02-05 16:10:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:10:07,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:07,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:07,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:10:07,408 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:07,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:07,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1945903675, now seen corresponding path program 1 times [2025-02-05 16:10:07,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:07,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087628858] [2025-02-05 16:10:07,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:07,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:07,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:10:07,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:10:07,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:07,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:10:07,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:07,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087628858] [2025-02-05 16:10:07,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087628858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:07,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:07,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:10:07,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442082054] [2025-02-05 16:10:07,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:07,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:10:07,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:07,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:10:07,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:10:07,557 INFO L87 Difference]: Start difference. First operand 132384 states and 273081 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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)