./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:46:30,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:46:30,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:46:30,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:46:30,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:46:30,075 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:46:30,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:46:30,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:46:30,076 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:46:30,076 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:46:30,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:46:30,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:46:30,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:46:30,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:46:30,076 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:46:30,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:46:30,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:46:30,077 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:46:30,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:46:30,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:46:30,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:46:30,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:46:30,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:46:30,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:46:30,077 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:46:30,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:46:30,077 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:46:30,077 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:46:30,077 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:46:30,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:46:30,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:46:30,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:46:30,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:46:30,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:46:30,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:46:30,078 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:46:30,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:46:30,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:46:30,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:46:30,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:46:30,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:46:30,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:46:30,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:46:30,078 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3 [2025-03-03 14:46:30,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:46:30,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:46:30,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:46:30,343 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:46:30,344 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:46:30,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2025-03-03 14:46:31,517 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeebad0a4/cd7b4676cbff48ee8106d7e394f486e9/FLAG6c07bd365 [2025-03-03 14:46:31,767 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:46:31,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2025-03-03 14:46:31,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeebad0a4/cd7b4676cbff48ee8106d7e394f486e9/FLAG6c07bd365 [2025-03-03 14:46:32,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeebad0a4/cd7b4676cbff48ee8106d7e394f486e9 [2025-03-03 14:46:32,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:46:32,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:46:32,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:46:32,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:46:32,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:46:32,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:46:32" (1/1) ... [2025-03-03 14:46:32,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@680e9c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:32, skipping insertion in model container [2025-03-03 14:46:32,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:46:32" (1/1) ... [2025-03-03 14:46:32,127 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:46:32,303 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c[12106,12119] [2025-03-03 14:46:32,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:46:32,321 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:46:32,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c[12106,12119] [2025-03-03 14:46:32,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:46:32,398 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:46:32,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:32 WrapperNode [2025-03-03 14:46:32,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:46:32,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:46:32,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:46:32,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:46:32,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:32" (1/1) ... [2025-03-03 14:46:32,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:32" (1/1) ... [2025-03-03 14:46:32,447 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 418 [2025-03-03 14:46:32,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:46:32,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:46:32,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:46:32,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:46:32,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:32" (1/1) ... [2025-03-03 14:46:32,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:32" (1/1) ... [2025-03-03 14:46:32,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:32" (1/1) ... [2025-03-03 14:46:32,470 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:46:32,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:32" (1/1) ... [2025-03-03 14:46:32,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:32" (1/1) ... [2025-03-03 14:46:32,476 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:32" (1/1) ... [2025-03-03 14:46:32,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:32" (1/1) ... [2025-03-03 14:46:32,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:32" (1/1) ... [2025-03-03 14:46:32,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:32" (1/1) ... [2025-03-03 14:46:32,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:46:32,482 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:46:32,482 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:46:32,482 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:46:32,483 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:32" (1/1) ... [2025-03-03 14:46:32,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:46:32,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:32,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:46:32,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:46:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:46:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2025-03-03 14:46:32,539 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2025-03-03 14:46:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-03-03 14:46:32,539 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-03-03 14:46:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2025-03-03 14:46:32,539 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2025-03-03 14:46:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2025-03-03 14:46:32,540 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2025-03-03 14:46:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2025-03-03 14:46:32,540 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2025-03-03 14:46:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 14:46:32,540 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 14:46:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:46:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:46:32,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:46:32,629 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:46:32,630 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:46:33,049 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2025-03-03 14:46:33,050 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:46:33,065 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:46:33,065 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:46:33,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:46:33 BoogieIcfgContainer [2025-03-03 14:46:33,065 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:46:33,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:46:33,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:46:33,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:46:33,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:46:32" (1/3) ... [2025-03-03 14:46:33,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3e56b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:46:33, skipping insertion in model container [2025-03-03 14:46:33,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:32" (2/3) ... [2025-03-03 14:46:33,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3e56b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:46:33, skipping insertion in model container [2025-03-03 14:46:33,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:46:33" (3/3) ... [2025-03-03 14:46:33,075 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2025-03-03 14:46:33,086 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:46:33,088 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c that has 7 procedures, 177 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 14:46:33,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:46:33,144 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;@34a30db4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:46:33,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:46:33,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 177 states, 132 states have (on average 1.5833333333333333) internal successors, (209), 137 states have internal predecessors, (209), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 14:46:33,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 14:46:33,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:33,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:33,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:33,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:33,159 INFO L85 PathProgramCache]: Analyzing trace with hash -543215507, now seen corresponding path program 1 times [2025-03-03 14:46:33,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:33,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359302367] [2025-03-03 14:46:33,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:33,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:33,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 14:46:33,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 14:46:33,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:33,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:33,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:33,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:33,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359302367] [2025-03-03 14:46:33,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359302367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:33,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:33,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:33,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183239613] [2025-03-03 14:46:33,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:33,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:33,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:33,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:33,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:33,486 INFO L87 Difference]: Start difference. First operand has 177 states, 132 states have (on average 1.5833333333333333) internal successors, (209), 137 states have internal predecessors, (209), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:46:33,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:33,586 INFO L93 Difference]: Finished difference Result 354 states and 605 transitions. [2025-03-03 14:46:33,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:33,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 14:46:33,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:33,596 INFO L225 Difference]: With dead ends: 354 [2025-03-03 14:46:33,597 INFO L226 Difference]: Without dead ends: 180 [2025-03-03 14:46:33,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:33,604 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 7 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:33,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 806 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:33,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-03 14:46:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-03 14:46:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 135 states have (on average 1.5629629629629629) internal successors, (211), 139 states have internal predecessors, (211), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 14:46:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 285 transitions. [2025-03-03 14:46:33,651 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 285 transitions. Word has length 15 [2025-03-03 14:46:33,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:33,651 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 285 transitions. [2025-03-03 14:46:33,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:46:33,651 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 285 transitions. [2025-03-03 14:46:33,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 14:46:33,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:33,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:33,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:46:33,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:33,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1874285935, now seen corresponding path program 1 times [2025-03-03 14:46:33,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:33,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402617716] [2025-03-03 14:46:33,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:33,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:33,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 14:46:33,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 14:46:33,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:33,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:33,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:33,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402617716] [2025-03-03 14:46:33,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402617716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:33,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:33,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:33,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213085416] [2025-03-03 14:46:33,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:33,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:33,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:33,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:33,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:33,775 INFO L87 Difference]: Start difference. First operand 180 states and 285 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:46:33,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:33,829 INFO L93 Difference]: Finished difference Result 371 states and 591 transitions. [2025-03-03 14:46:33,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:33,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-03 14:46:33,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:33,834 INFO L225 Difference]: With dead ends: 371 [2025-03-03 14:46:33,834 INFO L226 Difference]: Without dead ends: 194 [2025-03-03 14:46:33,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:33,839 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 22 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:33,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 824 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-03 14:46:33,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2025-03-03 14:46:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 145 states have (on average 1.5448275862068965) internal successors, (224), 149 states have internal predecessors, (224), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 14:46:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 300 transitions. [2025-03-03 14:46:33,860 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 300 transitions. Word has length 16 [2025-03-03 14:46:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:33,860 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 300 transitions. [2025-03-03 14:46:33,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:46:33,861 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 300 transitions. [2025-03-03 14:46:33,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 14:46:33,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:33,863 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:33,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:46:33,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:33,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:33,866 INFO L85 PathProgramCache]: Analyzing trace with hash -754782601, now seen corresponding path program 1 times [2025-03-03 14:46:33,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:33,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160857902] [2025-03-03 14:46:33,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:33,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:33,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 14:46:33,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 14:46:33,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:33,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:33,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:33,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160857902] [2025-03-03 14:46:33,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160857902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:33,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:33,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:46:33,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248925949] [2025-03-03 14:46:33,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:33,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:46:33,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:33,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:46:33,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:46:33,962 INFO L87 Difference]: Start difference. First operand 192 states and 300 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:46:33,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:33,986 INFO L93 Difference]: Finished difference Result 403 states and 637 transitions. [2025-03-03 14:46:33,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:46:33,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-03 14:46:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:33,990 INFO L225 Difference]: With dead ends: 403 [2025-03-03 14:46:33,990 INFO L226 Difference]: Without dead ends: 221 [2025-03-03 14:46:34,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:46:34,004 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 22 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:34,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 556 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:34,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-03 14:46:34,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 194. [2025-03-03 14:46:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 147 states have (on average 1.5374149659863945) internal successors, (226), 151 states have internal predecessors, (226), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 14:46:34,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 302 transitions. [2025-03-03 14:46:34,016 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 302 transitions. Word has length 23 [2025-03-03 14:46:34,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:34,016 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 302 transitions. [2025-03-03 14:46:34,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:46:34,016 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 302 transitions. [2025-03-03 14:46:34,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 14:46:34,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:34,017 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:34,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:46:34,017 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:34,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:34,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1780982333, now seen corresponding path program 1 times [2025-03-03 14:46:34,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:34,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827190426] [2025-03-03 14:46:34,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:34,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:34,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 14:46:34,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 14:46:34,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:34,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:34,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:34,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:34,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827190426] [2025-03-03 14:46:34,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827190426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:34,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:34,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:46:34,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165434037] [2025-03-03 14:46:34,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:34,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:46:34,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:34,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:46:34,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:34,104 INFO L87 Difference]: Start difference. First operand 194 states and 302 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:34,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:34,135 INFO L93 Difference]: Finished difference Result 379 states and 594 transitions. [2025-03-03 14:46:34,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:34,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-03 14:46:34,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:34,137 INFO L225 Difference]: With dead ends: 379 [2025-03-03 14:46:34,137 INFO L226 Difference]: Without dead ends: 200 [2025-03-03 14:46:34,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:34,138 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 0 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:34,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1098 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-03 14:46:34,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2025-03-03 14:46:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 150 states have (on average 1.5266666666666666) internal successors, (229), 154 states have internal predecessors, (229), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-03 14:46:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 306 transitions. [2025-03-03 14:46:34,159 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 306 transitions. Word has length 32 [2025-03-03 14:46:34,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:34,160 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 306 transitions. [2025-03-03 14:46:34,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 306 transitions. [2025-03-03 14:46:34,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 14:46:34,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:34,161 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:34,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:46:34,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:34,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:34,161 INFO L85 PathProgramCache]: Analyzing trace with hash -818158595, now seen corresponding path program 1 times [2025-03-03 14:46:34,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:34,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927871171] [2025-03-03 14:46:34,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:34,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:34,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 14:46:34,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 14:46:34,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:34,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:34,239 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:34,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:34,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927871171] [2025-03-03 14:46:34,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927871171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:34,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896627547] [2025-03-03 14:46:34,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:34,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:34,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:34,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:34,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:46:34,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 14:46:34,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 14:46:34,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:34,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:34,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:46:34,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:34,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:46:34,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:34,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896627547] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:46:34,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:46:34,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 14:46:34,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7769613] [2025-03-03 14:46:34,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:46:34,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:46:34,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:34,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:46:34,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:34,400 INFO L87 Difference]: Start difference. First operand 198 states and 306 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 14:46:34,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:34,467 INFO L93 Difference]: Finished difference Result 444 states and 700 transitions. [2025-03-03 14:46:34,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:34,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2025-03-03 14:46:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:34,470 INFO L225 Difference]: With dead ends: 444 [2025-03-03 14:46:34,470 INFO L226 Difference]: Without dead ends: 261 [2025-03-03 14:46:34,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:34,471 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 76 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:34,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1091 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-03 14:46:34,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 251. [2025-03-03 14:46:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 193 states have (on average 1.5025906735751295) internal successors, (290), 197 states have internal predecessors, (290), 48 states have call successors, (48), 8 states have call predecessors, (48), 9 states have return successors, (49), 49 states have call predecessors, (49), 48 states have call successors, (49) [2025-03-03 14:46:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 387 transitions. [2025-03-03 14:46:34,499 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 387 transitions. Word has length 34 [2025-03-03 14:46:34,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:34,501 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 387 transitions. [2025-03-03 14:46:34,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 14:46:34,502 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 387 transitions. [2025-03-03 14:46:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 14:46:34,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:34,503 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] [2025-03-03 14:46:34,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:34,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:34,704 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:34,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:34,704 INFO L85 PathProgramCache]: Analyzing trace with hash 661252842, now seen corresponding path program 1 times [2025-03-03 14:46:34,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:34,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802269032] [2025-03-03 14:46:34,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:34,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:34,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 14:46:34,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 14:46:34,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:34,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:34,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:34,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802269032] [2025-03-03 14:46:34,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802269032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:34,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:34,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:46:34,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244871291] [2025-03-03 14:46:34,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:34,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:46:34,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:34,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:46:34,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:34,803 INFO L87 Difference]: Start difference. First operand 251 states and 387 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:46:34,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:34,872 INFO L93 Difference]: Finished difference Result 396 states and 617 transitions. [2025-03-03 14:46:34,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:46:34,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-03-03 14:46:34,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:34,874 INFO L225 Difference]: With dead ends: 396 [2025-03-03 14:46:34,874 INFO L226 Difference]: Without dead ends: 247 [2025-03-03 14:46:34,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:34,875 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 0 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:34,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1335 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:34,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-03 14:46:34,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-03-03 14:46:34,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 190 states have (on average 1.4736842105263157) internal successors, (280), 194 states have internal predecessors, (280), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 14:46:34,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 376 transitions. [2025-03-03 14:46:34,894 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 376 transitions. Word has length 35 [2025-03-03 14:46:34,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:34,895 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 376 transitions. [2025-03-03 14:46:34,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:46:34,895 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 376 transitions. [2025-03-03 14:46:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 14:46:34,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:34,897 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:34,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:46:34,897 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:34,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:34,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1511902141, now seen corresponding path program 2 times [2025-03-03 14:46:34,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:34,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947670169] [2025-03-03 14:46:34,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:46:34,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:34,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-03 14:46:34,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 56 statements. [2025-03-03 14:46:34,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:46:34,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:34,948 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 14:46:34,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:34,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947670169] [2025-03-03 14:46:34,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947670169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:34,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:34,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:34,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301954407] [2025-03-03 14:46:34,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:34,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:34,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:34,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:34,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:34,950 INFO L87 Difference]: Start difference. First operand 247 states and 376 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:35,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:35,002 INFO L93 Difference]: Finished difference Result 473 states and 737 transitions. [2025-03-03 14:46:35,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:35,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-03-03 14:46:35,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:35,005 INFO L225 Difference]: With dead ends: 473 [2025-03-03 14:46:35,005 INFO L226 Difference]: Without dead ends: 254 [2025-03-03 14:46:35,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:35,009 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 8 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:35,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 796 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:35,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-03 14:46:35,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-03-03 14:46:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 196 states have (on average 1.469387755102041) internal successors, (288), 200 states have internal predecessors, (288), 48 states have call successors, (48), 9 states have call predecessors, (48), 9 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 14:46:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2025-03-03 14:46:35,023 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 56 [2025-03-03 14:46:35,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:35,037 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2025-03-03 14:46:35,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:35,037 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2025-03-03 14:46:35,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 14:46:35,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:35,038 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:35,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:46:35,038 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:35,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:35,038 INFO L85 PathProgramCache]: Analyzing trace with hash -52522777, now seen corresponding path program 1 times [2025-03-03 14:46:35,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:35,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128418029] [2025-03-03 14:46:35,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:35,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:35,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 14:46:35,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 14:46:35,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:35,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:46:35,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:35,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128418029] [2025-03-03 14:46:35,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128418029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:35,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:35,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:35,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14544371] [2025-03-03 14:46:35,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:35,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:35,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:35,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:35,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:35,119 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:35,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:35,158 INFO L93 Difference]: Finished difference Result 517 states and 793 transitions. [2025-03-03 14:46:35,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:35,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-03-03 14:46:35,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:35,160 INFO L225 Difference]: With dead ends: 517 [2025-03-03 14:46:35,161 INFO L226 Difference]: Without dead ends: 291 [2025-03-03 14:46:35,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:35,162 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 22 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:35,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 811 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:35,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-03 14:46:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2025-03-03 14:46:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 227 states have (on average 1.4273127753303965) internal successors, (324), 231 states have internal predecessors, (324), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-03 14:46:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 426 transitions. [2025-03-03 14:46:35,176 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 426 transitions. Word has length 56 [2025-03-03 14:46:35,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:35,176 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 426 transitions. [2025-03-03 14:46:35,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 426 transitions. [2025-03-03 14:46:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:46:35,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:35,177 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:35,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:46:35,178 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:35,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:35,178 INFO L85 PathProgramCache]: Analyzing trace with hash -85441016, now seen corresponding path program 1 times [2025-03-03 14:46:35,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:35,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062374486] [2025-03-03 14:46:35,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:35,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:35,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:46:35,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:46:35,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:35,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-03 14:46:35,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:35,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062374486] [2025-03-03 14:46:35,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062374486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:35,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:35,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:46:35,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568666275] [2025-03-03 14:46:35,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:35,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:46:35,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:35,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:46:35,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:35,294 INFO L87 Difference]: Start difference. First operand 289 states and 426 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:46:35,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:35,323 INFO L93 Difference]: Finished difference Result 529 states and 793 transitions. [2025-03-03 14:46:35,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:35,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2025-03-03 14:46:35,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:35,325 INFO L225 Difference]: With dead ends: 529 [2025-03-03 14:46:35,325 INFO L226 Difference]: Without dead ends: 291 [2025-03-03 14:46:35,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:35,329 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:35,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1085 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:35,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-03 14:46:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2025-03-03 14:46:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 227 states have (on average 1.4140969162995596) internal successors, (321), 231 states have internal predecessors, (321), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-03 14:46:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 423 transitions. [2025-03-03 14:46:35,347 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 423 transitions. Word has length 74 [2025-03-03 14:46:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:35,348 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 423 transitions. [2025-03-03 14:46:35,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:46:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 423 transitions. [2025-03-03 14:46:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:46:35,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:35,349 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:35,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:46:35,349 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:35,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:35,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1521403048, now seen corresponding path program 1 times [2025-03-03 14:46:35,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:35,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104631581] [2025-03-03 14:46:35,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:35,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:35,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:46:35,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:46:35,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:35,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-03 14:46:35,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:35,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104631581] [2025-03-03 14:46:35,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104631581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:35,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:35,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:35,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959992156] [2025-03-03 14:46:35,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:35,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:35,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:35,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:35,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:35,466 INFO L87 Difference]: Start difference. First operand 289 states and 423 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:46:35,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:35,513 INFO L93 Difference]: Finished difference Result 564 states and 847 transitions. [2025-03-03 14:46:35,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:35,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 102 [2025-03-03 14:46:35,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:35,516 INFO L225 Difference]: With dead ends: 564 [2025-03-03 14:46:35,516 INFO L226 Difference]: Without dead ends: 331 [2025-03-03 14:46:35,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:35,518 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 23 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:35,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 811 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:35,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-03 14:46:35,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2025-03-03 14:46:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 263 states have (on average 1.376425855513308) internal successors, (362), 267 states have internal predecessors, (362), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 14:46:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 470 transitions. [2025-03-03 14:46:35,539 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 470 transitions. Word has length 102 [2025-03-03 14:46:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:35,540 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 470 transitions. [2025-03-03 14:46:35,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:46:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 470 transitions. [2025-03-03 14:46:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:46:35,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:35,542 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:35,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:46:35,543 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:35,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:35,543 INFO L85 PathProgramCache]: Analyzing trace with hash 423024422, now seen corresponding path program 1 times [2025-03-03 14:46:35,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:35,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748821218] [2025-03-03 14:46:35,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:35,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:35,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:46:35,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:46:35,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:35,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-03 14:46:35,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:35,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748821218] [2025-03-03 14:46:35,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748821218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:35,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:35,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:35,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014492337] [2025-03-03 14:46:35,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:35,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:35,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:35,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:35,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:35,632 INFO L87 Difference]: Start difference. First operand 329 states and 470 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:46:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:35,675 INFO L93 Difference]: Finished difference Result 590 states and 867 transitions. [2025-03-03 14:46:35,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:35,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 103 [2025-03-03 14:46:35,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:35,678 INFO L225 Difference]: With dead ends: 590 [2025-03-03 14:46:35,678 INFO L226 Difference]: Without dead ends: 323 [2025-03-03 14:46:35,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:35,679 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 9 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:35,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 779 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-03 14:46:35,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2025-03-03 14:46:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 258 states have (on average 1.3565891472868217) internal successors, (350), 262 states have internal predecessors, (350), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-03 14:46:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 456 transitions. [2025-03-03 14:46:35,701 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 456 transitions. Word has length 103 [2025-03-03 14:46:35,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:35,704 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 456 transitions. [2025-03-03 14:46:35,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:46:35,704 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 456 transitions. [2025-03-03 14:46:35,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:46:35,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:35,705 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:35,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:46:35,705 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:35,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:35,706 INFO L85 PathProgramCache]: Analyzing trace with hash 139629820, now seen corresponding path program 1 times [2025-03-03 14:46:35,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:35,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116501212] [2025-03-03 14:46:35,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:35,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:35,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:46:35,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:46:35,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:35,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2025-03-03 14:46:35,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:35,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116501212] [2025-03-03 14:46:35,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116501212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:35,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:35,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:46:35,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336357642] [2025-03-03 14:46:35,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:35,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:46:35,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:35,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:46:35,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:35,817 INFO L87 Difference]: Start difference. First operand 323 states and 456 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 14:46:35,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:35,843 INFO L93 Difference]: Finished difference Result 566 states and 817 transitions. [2025-03-03 14:46:35,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:35,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 122 [2025-03-03 14:46:35,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:35,846 INFO L225 Difference]: With dead ends: 566 [2025-03-03 14:46:35,846 INFO L226 Difference]: Without dead ends: 325 [2025-03-03 14:46:35,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:35,847 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 0 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:35,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1069 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:35,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-03 14:46:35,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2025-03-03 14:46:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 258 states have (on average 1.3449612403100775) internal successors, (347), 262 states have internal predecessors, (347), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-03 14:46:35,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 453 transitions. [2025-03-03 14:46:35,863 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 453 transitions. Word has length 122 [2025-03-03 14:46:35,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:35,863 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 453 transitions. [2025-03-03 14:46:35,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 14:46:35,863 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 453 transitions. [2025-03-03 14:46:35,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 14:46:35,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:35,866 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:35,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:46:35,866 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:35,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:35,867 INFO L85 PathProgramCache]: Analyzing trace with hash 987507324, now seen corresponding path program 1 times [2025-03-03 14:46:35,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:35,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82247030] [2025-03-03 14:46:35,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:35,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:35,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 14:46:35,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 14:46:35,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:35,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-03 14:46:35,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:35,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82247030] [2025-03-03 14:46:35,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82247030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:35,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:35,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:35,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186320441] [2025-03-03 14:46:35,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:35,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:35,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:35,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:35,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:35,951 INFO L87 Difference]: Start difference. First operand 323 states and 453 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 14:46:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:35,999 INFO L93 Difference]: Finished difference Result 529 states and 777 transitions. [2025-03-03 14:46:35,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:35,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 154 [2025-03-03 14:46:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:36,001 INFO L225 Difference]: With dead ends: 529 [2025-03-03 14:46:36,001 INFO L226 Difference]: Without dead ends: 321 [2025-03-03 14:46:36,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:36,002 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 7 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:36,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 747 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:36,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-03 14:46:36,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2025-03-03 14:46:36,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 257 states have (on average 1.3424124513618676) internal successors, (345), 261 states have internal predecessors, (345), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 14:46:36,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 449 transitions. [2025-03-03 14:46:36,017 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 449 transitions. Word has length 154 [2025-03-03 14:46:36,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:36,017 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 449 transitions. [2025-03-03 14:46:36,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 14:46:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 449 transitions. [2025-03-03 14:46:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 14:46:36,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:36,020 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:36,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:46:36,021 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:36,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:36,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1772457906, now seen corresponding path program 1 times [2025-03-03 14:46:36,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:36,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964127364] [2025-03-03 14:46:36,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:36,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:36,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 14:46:36,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 14:46:36,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:36,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2025-03-03 14:46:36,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:36,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964127364] [2025-03-03 14:46:36,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964127364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:36,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:36,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:36,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35585321] [2025-03-03 14:46:36,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:36,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:36,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:36,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:36,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:36,131 INFO L87 Difference]: Start difference. First operand 321 states and 449 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:46:36,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:36,195 INFO L93 Difference]: Finished difference Result 469 states and 673 transitions. [2025-03-03 14:46:36,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:36,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 173 [2025-03-03 14:46:36,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:36,197 INFO L225 Difference]: With dead ends: 469 [2025-03-03 14:46:36,197 INFO L226 Difference]: Without dead ends: 304 [2025-03-03 14:46:36,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:36,200 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 32 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:36,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 724 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:36,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-03 14:46:36,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-03-03 14:46:36,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 243 states have (on average 1.3333333333333333) internal successors, (324), 247 states have internal predecessors, (324), 49 states have call successors, (49), 11 states have call predecessors, (49), 11 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-03 14:46:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2025-03-03 14:46:36,212 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 173 [2025-03-03 14:46:36,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:36,213 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2025-03-03 14:46:36,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:46:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2025-03-03 14:46:36,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 14:46:36,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:36,214 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:36,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:46:36,214 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:36,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:36,215 INFO L85 PathProgramCache]: Analyzing trace with hash 96714777, now seen corresponding path program 1 times [2025-03-03 14:46:36,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:36,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978299175] [2025-03-03 14:46:36,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:36,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:36,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 14:46:36,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 14:46:36,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:36,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-03-03 14:46:36,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:36,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978299175] [2025-03-03 14:46:36,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978299175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:36,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:36,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:36,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834349063] [2025-03-03 14:46:36,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:36,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:36,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:36,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:36,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:36,332 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:46:36,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:36,381 INFO L93 Difference]: Finished difference Result 452 states and 646 transitions. [2025-03-03 14:46:36,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:36,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 175 [2025-03-03 14:46:36,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:36,384 INFO L225 Difference]: With dead ends: 452 [2025-03-03 14:46:36,384 INFO L226 Difference]: Without dead ends: 285 [2025-03-03 14:46:36,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:36,386 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 28 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:36,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 727 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-03 14:46:36,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2025-03-03 14:46:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 227 states have (on average 1.3259911894273129) internal successors, (301), 231 states have internal predecessors, (301), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 14:46:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 393 transitions. [2025-03-03 14:46:36,399 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 393 transitions. Word has length 175 [2025-03-03 14:46:36,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:36,401 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 393 transitions. [2025-03-03 14:46:36,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:46:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 393 transitions. [2025-03-03 14:46:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 14:46:36,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:36,402 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:36,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:46:36,402 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:36,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:36,402 INFO L85 PathProgramCache]: Analyzing trace with hash -677126328, now seen corresponding path program 1 times [2025-03-03 14:46:36,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:36,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132870041] [2025-03-03 14:46:36,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:36,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:36,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 14:46:36,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 14:46:36,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:36,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:36,534 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-03 14:46:36,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:36,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132870041] [2025-03-03 14:46:36,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132870041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:36,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:36,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:46:36,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356230079] [2025-03-03 14:46:36,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:36,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:46:36,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:36,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:46:36,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:36,540 INFO L87 Difference]: Start difference. First operand 285 states and 393 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:46:36,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:36,563 INFO L93 Difference]: Finished difference Result 433 states and 617 transitions. [2025-03-03 14:46:36,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:36,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 176 [2025-03-03 14:46:36,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:36,566 INFO L225 Difference]: With dead ends: 433 [2025-03-03 14:46:36,566 INFO L226 Difference]: Without dead ends: 285 [2025-03-03 14:46:36,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:36,568 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:36,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1047 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:36,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-03 14:46:36,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2025-03-03 14:46:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 227 states have (on average 1.2995594713656389) internal successors, (295), 231 states have internal predecessors, (295), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 14:46:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 387 transitions. [2025-03-03 14:46:36,579 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 387 transitions. Word has length 176 [2025-03-03 14:46:36,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:36,580 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 387 transitions. [2025-03-03 14:46:36,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:46:36,580 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 387 transitions. [2025-03-03 14:46:36,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 14:46:36,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:36,582 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:36,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:46:36,582 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:36,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:36,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1593458729, now seen corresponding path program 1 times [2025-03-03 14:46:36,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:36,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298321834] [2025-03-03 14:46:36,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:36,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:36,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 14:46:36,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 14:46:36,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:36,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-03 14:46:36,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:36,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298321834] [2025-03-03 14:46:36,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298321834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:36,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341423291] [2025-03-03 14:46:36,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:36,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:36,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:36,692 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:36,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:46:36,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 14:46:36,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 14:46:36,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:36,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:36,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:46:36,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-03 14:46:36,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:46:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-03 14:46:37,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341423291] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:37,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:46:37,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2025-03-03 14:46:37,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321399087] [2025-03-03 14:46:37,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:37,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:37,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:37,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:37,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:37,027 INFO L87 Difference]: Start difference. First operand 285 states and 387 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:46:37,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:37,062 INFO L93 Difference]: Finished difference Result 453 states and 638 transitions. [2025-03-03 14:46:37,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:37,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 182 [2025-03-03 14:46:37,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:37,065 INFO L225 Difference]: With dead ends: 453 [2025-03-03 14:46:37,065 INFO L226 Difference]: Without dead ends: 264 [2025-03-03 14:46:37,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:37,066 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 19 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:37,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 727 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:37,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-03 14:46:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2025-03-03 14:46:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 209 states have (on average 1.291866028708134) internal successors, (270), 213 states have internal predecessors, (270), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 14:46:37,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 356 transitions. [2025-03-03 14:46:37,076 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 356 transitions. Word has length 182 [2025-03-03 14:46:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:37,076 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 356 transitions. [2025-03-03 14:46:37,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:46:37,076 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 356 transitions. [2025-03-03 14:46:37,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 14:46:37,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:37,077 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:37,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:46:37,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 14:46:37,278 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:37,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:37,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1235584020, now seen corresponding path program 1 times [2025-03-03 14:46:37,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:37,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246099630] [2025-03-03 14:46:37,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:37,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:37,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 14:46:37,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 14:46:37,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:37,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-03-03 14:46:37,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:37,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246099630] [2025-03-03 14:46:37,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246099630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:37,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:37,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:37,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111540947] [2025-03-03 14:46:37,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:37,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:37,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:37,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:37,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:37,392 INFO L87 Difference]: Start difference. First operand 264 states and 356 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-03 14:46:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:37,424 INFO L93 Difference]: Finished difference Result 409 states and 577 transitions. [2025-03-03 14:46:37,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:37,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 206 [2025-03-03 14:46:37,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:37,426 INFO L225 Difference]: With dead ends: 409 [2025-03-03 14:46:37,426 INFO L226 Difference]: Without dead ends: 268 [2025-03-03 14:46:37,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:37,427 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 3 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:37,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 767 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:37,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-03 14:46:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-03-03 14:46:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 212 states have (on average 1.2877358490566038) internal successors, (273), 216 states have internal predecessors, (273), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 14:46:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 359 transitions. [2025-03-03 14:46:37,437 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 359 transitions. Word has length 206 [2025-03-03 14:46:37,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:37,439 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 359 transitions. [2025-03-03 14:46:37,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-03 14:46:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 359 transitions. [2025-03-03 14:46:37,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-03 14:46:37,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:37,441 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:37,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:46:37,441 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:37,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:37,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1420638242, now seen corresponding path program 1 times [2025-03-03 14:46:37,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:37,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455280915] [2025-03-03 14:46:37,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:37,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:37,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-03 14:46:37,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-03 14:46:37,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:37,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-03-03 14:46:37,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:37,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455280915] [2025-03-03 14:46:37,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455280915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:37,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:37,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:37,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189637399] [2025-03-03 14:46:37,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:37,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:37,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:37,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:37,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:37,552 INFO L87 Difference]: Start difference. First operand 268 states and 359 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 14:46:37,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:37,588 INFO L93 Difference]: Finished difference Result 418 states and 585 transitions. [2025-03-03 14:46:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:37,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 213 [2025-03-03 14:46:37,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:37,590 INFO L225 Difference]: With dead ends: 418 [2025-03-03 14:46:37,590 INFO L226 Difference]: Without dead ends: 273 [2025-03-03 14:46:37,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:37,591 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 4 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:37,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 769 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:37,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-03 14:46:37,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-03-03 14:46:37,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 216 states have (on average 1.2824074074074074) internal successors, (277), 220 states have internal predecessors, (277), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 14:46:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 363 transitions. [2025-03-03 14:46:37,603 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 363 transitions. Word has length 213 [2025-03-03 14:46:37,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:37,605 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 363 transitions. [2025-03-03 14:46:37,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 14:46:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 363 transitions. [2025-03-03 14:46:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-03 14:46:37,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:37,606 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:37,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:46:37,607 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:37,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:37,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1320270901, now seen corresponding path program 1 times [2025-03-03 14:46:37,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:37,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138977765] [2025-03-03 14:46:37,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:37,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:37,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-03 14:46:37,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-03 14:46:37,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:37,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-03-03 14:46:37,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:37,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138977765] [2025-03-03 14:46:37,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138977765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:37,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:37,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:37,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199242205] [2025-03-03 14:46:37,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:37,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:37,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:37,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:37,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:37,749 INFO L87 Difference]: Start difference. First operand 273 states and 363 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 14:46:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:37,783 INFO L93 Difference]: Finished difference Result 422 states and 585 transitions. [2025-03-03 14:46:37,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:37,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 221 [2025-03-03 14:46:37,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:37,785 INFO L225 Difference]: With dead ends: 422 [2025-03-03 14:46:37,785 INFO L226 Difference]: Without dead ends: 272 [2025-03-03 14:46:37,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:37,786 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 5 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:37,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 759 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-03 14:46:37,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2025-03-03 14:46:37,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 216 states have (on average 1.2685185185185186) internal successors, (274), 219 states have internal predecessors, (274), 42 states have call successors, (42), 13 states have call predecessors, (42), 13 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 14:46:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 358 transitions. [2025-03-03 14:46:37,799 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 358 transitions. Word has length 221 [2025-03-03 14:46:37,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:37,799 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 358 transitions. [2025-03-03 14:46:37,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 14:46:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 358 transitions. [2025-03-03 14:46:37,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 14:46:37,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:37,802 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:37,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:46:37,802 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:37,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:37,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1184331035, now seen corresponding path program 1 times [2025-03-03 14:46:37,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:37,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117679634] [2025-03-03 14:46:37,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:37,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:37,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 14:46:37,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 14:46:37,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:37,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:37,905 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-03-03 14:46:37,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:37,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117679634] [2025-03-03 14:46:37,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117679634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:37,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:37,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:46:37,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573740783] [2025-03-03 14:46:37,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:37,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:46:37,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:37,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:46:37,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:46:37,907 INFO L87 Difference]: Start difference. First operand 272 states and 358 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 14:46:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:37,918 INFO L93 Difference]: Finished difference Result 420 states and 574 transitions. [2025-03-03 14:46:37,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:46:37,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 229 [2025-03-03 14:46:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:37,920 INFO L225 Difference]: With dead ends: 420 [2025-03-03 14:46:37,920 INFO L226 Difference]: Without dead ends: 271 [2025-03-03 14:46:37,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:46:37,921 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:37,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 506 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:37,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-03 14:46:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-03-03 14:46:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 216 states have (on average 1.2638888888888888) internal successors, (273), 218 states have internal predecessors, (273), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-03 14:46:37,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 355 transitions. [2025-03-03 14:46:37,931 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 355 transitions. Word has length 229 [2025-03-03 14:46:37,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:37,931 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 355 transitions. [2025-03-03 14:46:37,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 14:46:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 355 transitions. [2025-03-03 14:46:37,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-03 14:46:37,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:37,933 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:37,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:46:37,933 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:37,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:37,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1408732007, now seen corresponding path program 1 times [2025-03-03 14:46:37,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:37,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074424648] [2025-03-03 14:46:37,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:37,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:37,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 14:46:37,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 14:46:37,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:37,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:38,112 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-03-03 14:46:38,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:38,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074424648] [2025-03-03 14:46:38,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074424648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:38,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:38,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:38,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223431098] [2025-03-03 14:46:38,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:38,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:38,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:38,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:38,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:38,114 INFO L87 Difference]: Start difference. First operand 271 states and 355 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:46:38,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:38,180 INFO L93 Difference]: Finished difference Result 632 states and 855 transitions. [2025-03-03 14:46:38,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:38,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 231 [2025-03-03 14:46:38,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:38,183 INFO L225 Difference]: With dead ends: 632 [2025-03-03 14:46:38,183 INFO L226 Difference]: Without dead ends: 484 [2025-03-03 14:46:38,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:38,185 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 329 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:38,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 719 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-03 14:46:38,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 478. [2025-03-03 14:46:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 376 states have (on average 1.3138297872340425) internal successors, (494), 378 states have internal predecessors, (494), 70 states have call successors, (70), 31 states have call predecessors, (70), 31 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 14:46:38,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 634 transitions. [2025-03-03 14:46:38,202 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 634 transitions. Word has length 231 [2025-03-03 14:46:38,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:38,202 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 634 transitions. [2025-03-03 14:46:38,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:46:38,202 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 634 transitions. [2025-03-03 14:46:38,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 14:46:38,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:38,204 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:38,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:46:38,204 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:38,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:38,205 INFO L85 PathProgramCache]: Analyzing trace with hash 227687844, now seen corresponding path program 1 times [2025-03-03 14:46:38,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:38,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488909353] [2025-03-03 14:46:38,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:38,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:38,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 14:46:38,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 14:46:38,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:38,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-03 14:46:38,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:38,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488909353] [2025-03-03 14:46:38,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488909353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:38,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:38,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:46:38,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808385527] [2025-03-03 14:46:38,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:38,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:46:38,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:38,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:46:38,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:46:38,289 INFO L87 Difference]: Start difference. First operand 478 states and 634 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:46:38,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:38,323 INFO L93 Difference]: Finished difference Result 1051 states and 1444 transitions. [2025-03-03 14:46:38,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:46:38,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 263 [2025-03-03 14:46:38,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:38,327 INFO L225 Difference]: With dead ends: 1051 [2025-03-03 14:46:38,327 INFO L226 Difference]: Without dead ends: 768 [2025-03-03 14:46:38,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:46:38,328 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 176 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:38,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 529 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:38,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-03-03 14:46:38,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 599. [2025-03-03 14:46:38,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 472 states have (on average 1.3220338983050848) internal successors, (624), 478 states have internal predecessors, (624), 85 states have call successors, (85), 41 states have call predecessors, (85), 41 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-03 14:46:38,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 794 transitions. [2025-03-03 14:46:38,354 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 794 transitions. Word has length 263 [2025-03-03 14:46:38,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:38,354 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 794 transitions. [2025-03-03 14:46:38,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:46:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 794 transitions. [2025-03-03 14:46:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 14:46:38,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:38,356 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:38,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:46:38,357 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:38,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:38,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1715662278, now seen corresponding path program 1 times [2025-03-03 14:46:38,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:38,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820322775] [2025-03-03 14:46:38,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:38,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:38,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 14:46:38,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 14:46:38,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:38,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-03 14:46:38,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:38,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820322775] [2025-03-03 14:46:38,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820322775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:38,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:38,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:46:38,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603515099] [2025-03-03 14:46:38,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:38,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:46:38,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:38,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:46:38,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:46:38,441 INFO L87 Difference]: Start difference. First operand 599 states and 794 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:46:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:38,485 INFO L93 Difference]: Finished difference Result 1331 states and 1814 transitions. [2025-03-03 14:46:38,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:46:38,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 264 [2025-03-03 14:46:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:38,490 INFO L225 Difference]: With dead ends: 1331 [2025-03-03 14:46:38,490 INFO L226 Difference]: Without dead ends: 960 [2025-03-03 14:46:38,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:46:38,491 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 178 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:38,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 547 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:38,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-03-03 14:46:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 952. [2025-03-03 14:46:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 745 states have (on average 1.348993288590604) internal successors, (1005), 759 states have internal predecessors, (1005), 139 states have call successors, (139), 67 states have call predecessors, (139), 67 states have return successors, (139), 129 states have call predecessors, (139), 139 states have call successors, (139) [2025-03-03 14:46:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1283 transitions. [2025-03-03 14:46:38,533 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1283 transitions. Word has length 264 [2025-03-03 14:46:38,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:38,533 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1283 transitions. [2025-03-03 14:46:38,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:46:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1283 transitions. [2025-03-03 14:46:38,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-03 14:46:38,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:38,536 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:38,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 14:46:38,536 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:38,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:38,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1888998209, now seen corresponding path program 1 times [2025-03-03 14:46:38,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:38,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405583836] [2025-03-03 14:46:38,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:38,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:38,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-03 14:46:38,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-03 14:46:38,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:38,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-03 14:46:38,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405583836] [2025-03-03 14:46:38,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405583836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:38,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:38,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:46:38,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744589885] [2025-03-03 14:46:38,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:38,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:46:38,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:38,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:46:38,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:46:38,624 INFO L87 Difference]: Start difference. First operand 952 states and 1283 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:46:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:38,688 INFO L93 Difference]: Finished difference Result 2228 states and 3077 transitions. [2025-03-03 14:46:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:46:38,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 265 [2025-03-03 14:46:38,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:38,696 INFO L225 Difference]: With dead ends: 2228 [2025-03-03 14:46:38,696 INFO L226 Difference]: Without dead ends: 1544 [2025-03-03 14:46:38,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:46:38,698 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 179 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:38,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 564 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:38,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2025-03-03 14:46:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1530. [2025-03-03 14:46:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1191 states have (on average 1.3744752308984047) internal successors, (1637), 1219 states have internal predecessors, (1637), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-03 14:46:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 2099 transitions. [2025-03-03 14:46:38,772 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 2099 transitions. Word has length 265 [2025-03-03 14:46:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:38,773 INFO L471 AbstractCegarLoop]: Abstraction has 1530 states and 2099 transitions. [2025-03-03 14:46:38,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:46:38,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 2099 transitions. [2025-03-03 14:46:38,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-03 14:46:38,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:38,775 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:38,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 14:46:38,776 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:38,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:38,776 INFO L85 PathProgramCache]: Analyzing trace with hash -455668832, now seen corresponding path program 1 times [2025-03-03 14:46:38,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:38,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107916267] [2025-03-03 14:46:38,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:38,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:38,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-03 14:46:38,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-03 14:46:38,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:38,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-03-03 14:46:38,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:38,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107916267] [2025-03-03 14:46:38,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107916267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:38,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126397530] [2025-03-03 14:46:38,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:38,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:38,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:38,956 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:38,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:46:39,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-03 14:46:39,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-03 14:46:39,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:39,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:39,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:46:39,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2025-03-03 14:46:39,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:39,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126397530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:39,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:39,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-03 14:46:39,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065275960] [2025-03-03 14:46:39,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:39,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:39,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:39,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:39,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:46:39,177 INFO L87 Difference]: Start difference. First operand 1530 states and 2099 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:46:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:39,286 INFO L93 Difference]: Finished difference Result 2832 states and 3942 transitions. [2025-03-03 14:46:39,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:39,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 265 [2025-03-03 14:46:39,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:39,293 INFO L225 Difference]: With dead ends: 2832 [2025-03-03 14:46:39,293 INFO L226 Difference]: Without dead ends: 1530 [2025-03-03 14:46:39,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:46:39,297 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 31 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:39,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 694 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:39,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2025-03-03 14:46:39,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1530. [2025-03-03 14:46:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1191 states have (on average 1.3543240973971453) internal successors, (1613), 1219 states have internal predecessors, (1613), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-03 14:46:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 2075 transitions. [2025-03-03 14:46:39,363 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 2075 transitions. Word has length 265 [2025-03-03 14:46:39,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:39,364 INFO L471 AbstractCegarLoop]: Abstraction has 1530 states and 2075 transitions. [2025-03-03 14:46:39,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:46:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 2075 transitions. [2025-03-03 14:46:39,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-03 14:46:39,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:39,367 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:39,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:39,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:39,569 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:39,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:39,569 INFO L85 PathProgramCache]: Analyzing trace with hash 274629425, now seen corresponding path program 1 times [2025-03-03 14:46:39,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:39,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232879755] [2025-03-03 14:46:39,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:39,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:39,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-03 14:46:39,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-03 14:46:39,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:39,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-03 14:46:39,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:39,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232879755] [2025-03-03 14:46:39,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232879755] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:39,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88082259] [2025-03-03 14:46:39,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:39,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:39,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:39,759 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:39,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:46:39,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-03 14:46:39,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-03 14:46:39,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:39,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:39,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:46:39,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2025-03-03 14:46:39,980 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:39,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88082259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:39,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:39,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-03 14:46:39,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467110690] [2025-03-03 14:46:39,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:39,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:39,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:39,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:39,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:46:39,982 INFO L87 Difference]: Start difference. First operand 1530 states and 2075 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:46:40,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:40,096 INFO L93 Difference]: Finished difference Result 2832 states and 3886 transitions. [2025-03-03 14:46:40,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:40,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 266 [2025-03-03 14:46:40,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:40,105 INFO L225 Difference]: With dead ends: 2832 [2025-03-03 14:46:40,105 INFO L226 Difference]: Without dead ends: 1578 [2025-03-03 14:46:40,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:46:40,108 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 7 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:40,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 702 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-03-03 14:46:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2025-03-03 14:46:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1231 states have (on average 1.3558082859463851) internal successors, (1669), 1259 states have internal predecessors, (1669), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-03 14:46:40,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2131 transitions. [2025-03-03 14:46:40,179 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2131 transitions. Word has length 266 [2025-03-03 14:46:40,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:40,179 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2131 transitions. [2025-03-03 14:46:40,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:46:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2131 transitions. [2025-03-03 14:46:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-03 14:46:40,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:40,182 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:40,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:40,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 14:46:40,386 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:40,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash 196620310, now seen corresponding path program 1 times [2025-03-03 14:46:40,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:40,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561232839] [2025-03-03 14:46:40,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:40,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:40,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-03 14:46:40,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-03 14:46:40,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:40,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:40,712 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-03 14:46:40,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:40,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561232839] [2025-03-03 14:46:40,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561232839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:40,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:40,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:46:40,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2173598] [2025-03-03 14:46:40,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:40,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:46:40,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:40,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:46:40,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:40,714 INFO L87 Difference]: Start difference. First operand 1578 states and 2131 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 14:46:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:40,817 INFO L93 Difference]: Finished difference Result 2416 states and 3494 transitions. [2025-03-03 14:46:40,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:46:40,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 267 [2025-03-03 14:46:40,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:40,830 INFO L225 Difference]: With dead ends: 2416 [2025-03-03 14:46:40,830 INFO L226 Difference]: Without dead ends: 2414 [2025-03-03 14:46:40,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:46:40,832 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 118 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:40,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1797 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2025-03-03 14:46:40,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 1626. [2025-03-03 14:46:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1263 states have (on average 1.3467933491686461) internal successors, (1701), 1299 states have internal predecessors, (1701), 239 states have call successors, (239), 123 states have call predecessors, (239), 123 states have return successors, (239), 211 states have call predecessors, (239), 239 states have call successors, (239) [2025-03-03 14:46:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2179 transitions. [2025-03-03 14:46:40,924 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2179 transitions. Word has length 267 [2025-03-03 14:46:40,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:40,925 INFO L471 AbstractCegarLoop]: Abstraction has 1626 states and 2179 transitions. [2025-03-03 14:46:40,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 14:46:40,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2179 transitions. [2025-03-03 14:46:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 14:46:40,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:40,928 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:40,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 14:46:40,928 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:40,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:40,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1184433482, now seen corresponding path program 1 times [2025-03-03 14:46:40,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:40,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710002259] [2025-03-03 14:46:40,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:40,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:40,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 14:46:40,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 14:46:40,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:40,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-03-03 14:46:41,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:41,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710002259] [2025-03-03 14:46:41,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710002259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:41,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637968775] [2025-03-03 14:46:41,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:41,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:41,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:41,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:41,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:46:41,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 14:46:41,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 14:46:41,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:41,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:41,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:46:41,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 248 proven. 37 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2025-03-03 14:46:41,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:46:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 143 proven. 23 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-03-03 14:46:41,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637968775] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:46:41,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:46:41,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-03-03 14:46:41,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514431339] [2025-03-03 14:46:41,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:46:41,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 14:46:41,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:41,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 14:46:41,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-03 14:46:41,866 INFO L87 Difference]: Start difference. First operand 1626 states and 2179 transitions. Second operand has 18 states, 18 states have (on average 8.277777777777779) internal successors, (149), 14 states have internal predecessors, (149), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2025-03-03 14:46:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:42,309 INFO L93 Difference]: Finished difference Result 4005 states and 5563 transitions. [2025-03-03 14:46:42,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 14:46:42,309 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.277777777777779) internal successors, (149), 14 states have internal predecessors, (149), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) Word has length 275 [2025-03-03 14:46:42,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:42,322 INFO L225 Difference]: With dead ends: 4005 [2025-03-03 14:46:42,322 INFO L226 Difference]: Without dead ends: 2655 [2025-03-03 14:46:42,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 541 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:46:42,327 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 250 mSDsluCounter, 3191 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 3548 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:42,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 3548 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:46:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2025-03-03 14:46:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2419. [2025-03-03 14:46:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2419 states, 1873 states have (on average 1.3352909770421784) internal successors, (2501), 1925 states have internal predecessors, (2501), 356 states have call successors, (356), 183 states have call predecessors, (356), 189 states have return successors, (364), 318 states have call predecessors, (364), 356 states have call successors, (364) [2025-03-03 14:46:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 3221 transitions. [2025-03-03 14:46:42,473 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 3221 transitions. Word has length 275 [2025-03-03 14:46:42,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:42,474 INFO L471 AbstractCegarLoop]: Abstraction has 2419 states and 3221 transitions. [2025-03-03 14:46:42,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.277777777777779) internal successors, (149), 14 states have internal predecessors, (149), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2025-03-03 14:46:42,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 3221 transitions. [2025-03-03 14:46:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 14:46:42,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:42,478 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:42,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:42,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 14:46:42,679 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:42,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:42,679 INFO L85 PathProgramCache]: Analyzing trace with hash -222819465, now seen corresponding path program 1 times [2025-03-03 14:46:42,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:42,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232724767] [2025-03-03 14:46:42,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:42,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:42,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 14:46:42,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 14:46:42,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:42,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2025-03-03 14:46:42,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:42,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232724767] [2025-03-03 14:46:42,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232724767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:42,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90547768] [2025-03-03 14:46:42,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:42,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:42,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:42,773 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:42,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:46:42,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 14:46:42,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 14:46:42,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:42,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:42,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:46:42,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2025-03-03 14:46:42,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:42,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90547768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:42,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:42,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-03 14:46:42,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8011993] [2025-03-03 14:46:42,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:42,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:42,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:42,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:42,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:42,962 INFO L87 Difference]: Start difference. First operand 2419 states and 3221 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:46:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:43,080 INFO L93 Difference]: Finished difference Result 4674 states and 6321 transitions. [2025-03-03 14:46:43,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:43,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 275 [2025-03-03 14:46:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:43,092 INFO L225 Difference]: With dead ends: 4674 [2025-03-03 14:46:43,092 INFO L226 Difference]: Without dead ends: 2355 [2025-03-03 14:46:43,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:43,098 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 4 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:43,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 702 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:43,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2025-03-03 14:46:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 2355. [2025-03-03 14:46:43,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2355 states, 1829 states have (on average 1.3182066703116457) internal successors, (2411), 1881 states have internal predecessors, (2411), 340 states have call successors, (340), 183 states have call predecessors, (340), 185 states have return successors, (344), 298 states have call predecessors, (344), 340 states have call successors, (344) [2025-03-03 14:46:43,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 3095 transitions. [2025-03-03 14:46:43,236 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 3095 transitions. Word has length 275 [2025-03-03 14:46:43,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:43,237 INFO L471 AbstractCegarLoop]: Abstraction has 2355 states and 3095 transitions. [2025-03-03 14:46:43,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:46:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 3095 transitions. [2025-03-03 14:46:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-03 14:46:43,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:43,242 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:43,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:43,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:43,443 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:43,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:43,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1582081070, now seen corresponding path program 1 times [2025-03-03 14:46:43,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:43,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698649829] [2025-03-03 14:46:43,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:43,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:43,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-03 14:46:43,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-03 14:46:43,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:43,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2025-03-03 14:46:43,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:43,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698649829] [2025-03-03 14:46:43,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698649829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:43,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664713408] [2025-03-03 14:46:43,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:43,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:43,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:43,557 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:43,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:46:43,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-03 14:46:43,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-03 14:46:43,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:43,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:43,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:46:43,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-03 14:46:43,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:43,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664713408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:43,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:43,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-03 14:46:43,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340084900] [2025-03-03 14:46:43,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:43,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:43,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:43,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:43,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:43,751 INFO L87 Difference]: Start difference. First operand 2355 states and 3095 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:46:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:43,845 INFO L93 Difference]: Finished difference Result 4457 states and 5963 transitions. [2025-03-03 14:46:43,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:43,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 278 [2025-03-03 14:46:43,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:43,855 INFO L225 Difference]: With dead ends: 4457 [2025-03-03 14:46:43,855 INFO L226 Difference]: Without dead ends: 2184 [2025-03-03 14:46:43,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:43,860 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 4 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:43,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 730 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:43,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2025-03-03 14:46:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2184. [2025-03-03 14:46:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 1688 states have (on average 1.3122037914691944) internal successors, (2215), 1740 states have internal predecessors, (2215), 323 states have call successors, (323), 172 states have call predecessors, (323), 172 states have return successors, (323), 279 states have call predecessors, (323), 323 states have call successors, (323) [2025-03-03 14:46:43,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 2861 transitions. [2025-03-03 14:46:43,940 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 2861 transitions. Word has length 278 [2025-03-03 14:46:43,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:43,941 INFO L471 AbstractCegarLoop]: Abstraction has 2184 states and 2861 transitions. [2025-03-03 14:46:43,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:46:43,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2861 transitions. [2025-03-03 14:46:43,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-03 14:46:43,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:43,943 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:43,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 14:46:44,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:44,144 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:44,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:44,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1898468476, now seen corresponding path program 1 times [2025-03-03 14:46:44,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:44,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078752349] [2025-03-03 14:46:44,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:44,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:44,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-03 14:46:44,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-03 14:46:44,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:44,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2025-03-03 14:46:44,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:44,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078752349] [2025-03-03 14:46:44,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078752349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:44,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123266678] [2025-03-03 14:46:44,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:44,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:44,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:44,376 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:44,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:46:44,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-03 14:46:44,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-03 14:46:44,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:44,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:44,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 14:46:44,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:44,687 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-03 14:46:44,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:44,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123266678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:44,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:44,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-03 14:46:44,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599231426] [2025-03-03 14:46:44,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:44,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:46:44,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:44,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:46:44,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2025-03-03 14:46:44,689 INFO L87 Difference]: Start difference. First operand 2184 states and 2861 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 9 states have internal predecessors, (108), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-03 14:46:45,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:45,342 INFO L93 Difference]: Finished difference Result 7086 states and 9247 transitions. [2025-03-03 14:46:45,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 14:46:45,343 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 9 states have internal predecessors, (108), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 290 [2025-03-03 14:46:45,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:45,369 INFO L225 Difference]: With dead ends: 7086 [2025-03-03 14:46:45,369 INFO L226 Difference]: Without dead ends: 5472 [2025-03-03 14:46:45,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2025-03-03 14:46:45,374 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 629 mSDsluCounter, 2481 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 2869 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:45,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 2869 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:46:45,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5472 states. [2025-03-03 14:46:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5472 to 5200. [2025-03-03 14:46:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5200 states, 3981 states have (on average 1.2981662898769153) internal successors, (5168), 4109 states have internal predecessors, (5168), 787 states have call successors, (787), 431 states have call predecessors, (787), 431 states have return successors, (787), 667 states have call predecessors, (787), 787 states have call successors, (787) [2025-03-03 14:46:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 6742 transitions. [2025-03-03 14:46:45,594 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 6742 transitions. Word has length 290 [2025-03-03 14:46:45,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:45,595 INFO L471 AbstractCegarLoop]: Abstraction has 5200 states and 6742 transitions. [2025-03-03 14:46:45,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 9 states have internal predecessors, (108), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-03 14:46:45,595 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 6742 transitions. [2025-03-03 14:46:45,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 14:46:45,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:45,598 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:45,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:45,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-03 14:46:45,798 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:45,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:45,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1683508057, now seen corresponding path program 1 times [2025-03-03 14:46:45,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:45,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486387021] [2025-03-03 14:46:45,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:45,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:45,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 14:46:45,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 14:46:45,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:45,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:45,944 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-03-03 14:46:45,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:45,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486387021] [2025-03-03 14:46:45,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486387021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:45,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:45,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:46:45,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092791329] [2025-03-03 14:46:45,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:45,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:46:45,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:45,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:46:45,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:45,946 INFO L87 Difference]: Start difference. First operand 5200 states and 6742 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-03 14:46:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:46,120 INFO L93 Difference]: Finished difference Result 10430 states and 13787 transitions. [2025-03-03 14:46:46,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:46:46,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 296 [2025-03-03 14:46:46,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:46,145 INFO L225 Difference]: With dead ends: 10430 [2025-03-03 14:46:46,146 INFO L226 Difference]: Without dead ends: 5740 [2025-03-03 14:46:46,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:46,157 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 35 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:46,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1025 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:46,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5740 states. [2025-03-03 14:46:46,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5740 to 5632. [2025-03-03 14:46:46,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5632 states, 4329 states have (on average 1.3083853083853083) internal successors, (5664), 4457 states have internal predecessors, (5664), 871 states have call successors, (871), 431 states have call predecessors, (871), 431 states have return successors, (871), 751 states have call predecessors, (871), 871 states have call successors, (871) [2025-03-03 14:46:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5632 states to 5632 states and 7406 transitions. [2025-03-03 14:46:46,454 INFO L78 Accepts]: Start accepts. Automaton has 5632 states and 7406 transitions. Word has length 296 [2025-03-03 14:46:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:46,455 INFO L471 AbstractCegarLoop]: Abstraction has 5632 states and 7406 transitions. [2025-03-03 14:46:46,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-03 14:46:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 5632 states and 7406 transitions. [2025-03-03 14:46:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 14:46:46,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:46,458 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:46,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 14:46:46,458 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:46,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1379183081, now seen corresponding path program 1 times [2025-03-03 14:46:46,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:46,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81907650] [2025-03-03 14:46:46,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:46,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:46,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 14:46:46,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 14:46:46,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:46,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:46,705 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2025-03-03 14:46:46,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:46,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81907650] [2025-03-03 14:46:46,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81907650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:46,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454924144] [2025-03-03 14:46:46,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:46,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:46,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:46,708 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:46,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:46:46,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 14:46:46,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 14:46:46,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:46,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:46,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 14:46:46,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-03 14:46:47,015 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:47,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454924144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:47,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:47,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 11 [2025-03-03 14:46:47,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036739745] [2025-03-03 14:46:47,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:47,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:46:47,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:47,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:46:47,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:46:47,016 INFO L87 Difference]: Start difference. First operand 5632 states and 7406 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 9 states have internal predecessors, (116), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-03 14:46:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:47,798 INFO L93 Difference]: Finished difference Result 16762 states and 21879 transitions. [2025-03-03 14:46:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 14:46:47,798 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 9 states have internal predecessors, (116), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 296 [2025-03-03 14:46:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:47,833 INFO L225 Difference]: With dead ends: 16762 [2025-03-03 14:46:47,834 INFO L226 Difference]: Without dead ends: 11644 [2025-03-03 14:46:47,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-03-03 14:46:47,846 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 626 mSDsluCounter, 2488 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 2892 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:47,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 2892 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:46:47,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11644 states. [2025-03-03 14:46:48,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11644 to 8100. [2025-03-03 14:46:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8100 states, 6205 states have (on average 1.3034649476228848) internal successors, (8088), 6397 states have internal predecessors, (8088), 1271 states have call successors, (1271), 623 states have call predecessors, (1271), 623 states have return successors, (1271), 1087 states have call predecessors, (1271), 1271 states have call successors, (1271) [2025-03-03 14:46:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8100 states to 8100 states and 10630 transitions. [2025-03-03 14:46:48,218 INFO L78 Accepts]: Start accepts. Automaton has 8100 states and 10630 transitions. Word has length 296 [2025-03-03 14:46:48,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:48,218 INFO L471 AbstractCegarLoop]: Abstraction has 8100 states and 10630 transitions. [2025-03-03 14:46:48,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 9 states have internal predecessors, (116), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-03 14:46:48,219 INFO L276 IsEmpty]: Start isEmpty. Operand 8100 states and 10630 transitions. [2025-03-03 14:46:48,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 14:46:48,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:48,222 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:48,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 14:46:48,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:48,423 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:48,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:48,423 INFO L85 PathProgramCache]: Analyzing trace with hash -935655657, now seen corresponding path program 1 times [2025-03-03 14:46:48,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:48,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082520362] [2025-03-03 14:46:48,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:48,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:48,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 14:46:48,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 14:46:48,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:48,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2025-03-03 14:46:48,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:48,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082520362] [2025-03-03 14:46:48,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082520362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:48,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:48,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:46:48,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925760740] [2025-03-03 14:46:48,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:48,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:46:48,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:48,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:46:48,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:48,667 INFO L87 Difference]: Start difference. First operand 8100 states and 10630 transitions. Second operand has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 14:46:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:48,982 INFO L93 Difference]: Finished difference Result 15173 states and 19978 transitions. [2025-03-03 14:46:48,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:48,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 296 [2025-03-03 14:46:48,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:49,017 INFO L225 Difference]: With dead ends: 15173 [2025-03-03 14:46:49,018 INFO L226 Difference]: Without dead ends: 7960 [2025-03-03 14:46:49,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:49,033 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 0 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:49,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 973 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:49,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7960 states. [2025-03-03 14:46:49,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7960 to 7960. [2025-03-03 14:46:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7960 states, 6088 states have (on average 1.3019053876478317) internal successors, (7926), 6268 states have internal predecessors, (7926), 1260 states have call successors, (1260), 612 states have call predecessors, (1260), 611 states have return successors, (1259), 1086 states have call predecessors, (1259), 1259 states have call successors, (1259) [2025-03-03 14:46:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7960 states to 7960 states and 10445 transitions. [2025-03-03 14:46:49,477 INFO L78 Accepts]: Start accepts. Automaton has 7960 states and 10445 transitions. Word has length 296 [2025-03-03 14:46:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:49,477 INFO L471 AbstractCegarLoop]: Abstraction has 7960 states and 10445 transitions. [2025-03-03 14:46:49,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 14:46:49,478 INFO L276 IsEmpty]: Start isEmpty. Operand 7960 states and 10445 transitions. [2025-03-03 14:46:49,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-03 14:46:49,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:49,481 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:49,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 14:46:49,481 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:49,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:49,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2114271132, now seen corresponding path program 1 times [2025-03-03 14:46:49,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:49,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492369622] [2025-03-03 14:46:49,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:49,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:49,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-03 14:46:49,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-03 14:46:49,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:49,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-03-03 14:46:50,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:50,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492369622] [2025-03-03 14:46:50,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492369622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:50,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222020845] [2025-03-03 14:46:50,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:50,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:50,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:50,235 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:50,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 14:46:50,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-03 14:46:50,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-03 14:46:50,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:50,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:50,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 14:46:50,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 195 proven. 4 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2025-03-03 14:46:50,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:46:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-03-03 14:46:50,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222020845] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:46:50,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:46:50,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 15 [2025-03-03 14:46:50,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220862264] [2025-03-03 14:46:50,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:46:50,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 14:46:50,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:50,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 14:46:50,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:46:50,675 INFO L87 Difference]: Start difference. First operand 7960 states and 10445 transitions. Second operand has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 14 states have internal predecessors, (154), 7 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (41), 8 states have call predecessors, (41), 7 states have call successors, (41) [2025-03-03 14:46:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:52,084 INFO L93 Difference]: Finished difference Result 16207 states and 21164 transitions. [2025-03-03 14:46:52,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 14:46:52,085 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 14 states have internal predecessors, (154), 7 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (41), 8 states have call predecessors, (41), 7 states have call successors, (41) Word has length 301 [2025-03-03 14:46:52,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:52,120 INFO L225 Difference]: With dead ends: 16207 [2025-03-03 14:46:52,120 INFO L226 Difference]: Without dead ends: 8936 [2025-03-03 14:46:52,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=308, Invalid=1584, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 14:46:52,138 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 972 mSDsluCounter, 3230 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 3591 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:52,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 3591 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 14:46:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8936 states. [2025-03-03 14:46:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8936 to 7740. [2025-03-03 14:46:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7740 states, 5921 states have (on average 1.2935314980577606) internal successors, (7659), 6097 states have internal predecessors, (7659), 1208 states have call successors, (1208), 611 states have call predecessors, (1208), 610 states have return successors, (1207), 1038 states have call predecessors, (1207), 1207 states have call successors, (1207) [2025-03-03 14:46:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7740 states to 7740 states and 10074 transitions. [2025-03-03 14:46:52,505 INFO L78 Accepts]: Start accepts. Automaton has 7740 states and 10074 transitions. Word has length 301 [2025-03-03 14:46:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:52,505 INFO L471 AbstractCegarLoop]: Abstraction has 7740 states and 10074 transitions. [2025-03-03 14:46:52,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 14 states have internal predecessors, (154), 7 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (41), 8 states have call predecessors, (41), 7 states have call successors, (41) [2025-03-03 14:46:52,506 INFO L276 IsEmpty]: Start isEmpty. Operand 7740 states and 10074 transitions. [2025-03-03 14:46:52,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-03 14:46:52,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:52,508 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:52,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:52,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-03 14:46:52,710 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:52,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:52,710 INFO L85 PathProgramCache]: Analyzing trace with hash -438289541, now seen corresponding path program 1 times [2025-03-03 14:46:52,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:52,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711804273] [2025-03-03 14:46:52,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:52,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:52,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-03 14:46:52,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-03 14:46:52,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:52,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2025-03-03 14:46:52,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:52,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711804273] [2025-03-03 14:46:52,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711804273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:52,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:52,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:46:52,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936047583] [2025-03-03 14:46:52,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:52,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:46:52,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:52,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:46:52,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:52,845 INFO L87 Difference]: Start difference. First operand 7740 states and 10074 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 14:46:53,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:53,511 INFO L93 Difference]: Finished difference Result 16241 states and 21118 transitions. [2025-03-03 14:46:53,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:46:53,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 301 [2025-03-03 14:46:53,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:53,550 INFO L225 Difference]: With dead ends: 16241 [2025-03-03 14:46:53,550 INFO L226 Difference]: Without dead ends: 9292 [2025-03-03 14:46:53,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:46:53,564 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 559 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:53,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 795 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:46:53,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9292 states. [2025-03-03 14:46:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9292 to 7202. [2025-03-03 14:46:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7202 states, 5509 states have (on average 1.2960609911054637) internal successors, (7140), 5670 states have internal predecessors, (7140), 1129 states have call successors, (1129), 564 states have call predecessors, (1129), 563 states have return successors, (1128), 974 states have call predecessors, (1128), 1128 states have call successors, (1128) [2025-03-03 14:46:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7202 states to 7202 states and 9397 transitions. [2025-03-03 14:46:53,938 INFO L78 Accepts]: Start accepts. Automaton has 7202 states and 9397 transitions. Word has length 301 [2025-03-03 14:46:53,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:53,939 INFO L471 AbstractCegarLoop]: Abstraction has 7202 states and 9397 transitions. [2025-03-03 14:46:53,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 14:46:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 7202 states and 9397 transitions. [2025-03-03 14:46:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-03 14:46:53,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:53,943 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:53,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 14:46:53,943 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:53,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:53,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1826958003, now seen corresponding path program 1 times [2025-03-03 14:46:53,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:53,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663076474] [2025-03-03 14:46:53,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:53,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:53,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-03 14:46:53,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-03 14:46:53,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:53,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2025-03-03 14:46:54,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:54,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663076474] [2025-03-03 14:46:54,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663076474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:54,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:54,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:54,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258541891] [2025-03-03 14:46:54,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:54,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:54,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:54,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:54,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:54,051 INFO L87 Difference]: Start difference. First operand 7202 states and 9397 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 14:46:54,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:54,501 INFO L93 Difference]: Finished difference Result 13157 states and 17187 transitions. [2025-03-03 14:46:54,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:54,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 308 [2025-03-03 14:46:54,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:54,525 INFO L225 Difference]: With dead ends: 13157 [2025-03-03 14:46:54,525 INFO L226 Difference]: Without dead ends: 6738 [2025-03-03 14:46:54,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:54,535 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 430 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:54,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 915 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:46:54,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6738 states. [2025-03-03 14:46:54,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6738 to 6484. [2025-03-03 14:46:54,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6484 states, 4964 states have (on average 1.2763900080580177) internal successors, (6336), 5103 states have internal predecessors, (6336), 1010 states have call successors, (1010), 509 states have call predecessors, (1010), 509 states have return successors, (1010), 871 states have call predecessors, (1010), 1010 states have call successors, (1010) [2025-03-03 14:46:54,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6484 states to 6484 states and 8356 transitions. [2025-03-03 14:46:54,837 INFO L78 Accepts]: Start accepts. Automaton has 6484 states and 8356 transitions. Word has length 308 [2025-03-03 14:46:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:54,838 INFO L471 AbstractCegarLoop]: Abstraction has 6484 states and 8356 transitions. [2025-03-03 14:46:54,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 14:46:54,838 INFO L276 IsEmpty]: Start isEmpty. Operand 6484 states and 8356 transitions. [2025-03-03 14:46:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-03 14:46:54,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:54,848 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:54,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 14:46:54,849 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:54,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:54,849 INFO L85 PathProgramCache]: Analyzing trace with hash 521730027, now seen corresponding path program 1 times [2025-03-03 14:46:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:54,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573334877] [2025-03-03 14:46:54,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:54,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:54,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-03 14:46:54,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-03 14:46:54,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:54,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 24 proven. 19 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2025-03-03 14:46:55,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:55,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573334877] [2025-03-03 14:46:55,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573334877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:55,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184843782] [2025-03-03 14:46:55,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:55,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:55,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:55,475 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:55,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 14:46:55,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-03 14:46:55,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-03 14:46:55,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:55,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:55,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 1343 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 14:46:55,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 254 proven. 72 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2025-03-03 14:46:56,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:46:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2025-03-03 14:46:56,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184843782] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:46:56,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:46:56,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 12] total 31 [2025-03-03 14:46:56,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528650761] [2025-03-03 14:46:56,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:46:56,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 14:46:56,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:56,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 14:46:56,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2025-03-03 14:46:56,823 INFO L87 Difference]: Start difference. First operand 6484 states and 8356 transitions. Second operand has 31 states, 30 states have (on average 9.266666666666667) internal successors, (278), 29 states have internal predecessors, (278), 17 states have call successors, (69), 7 states have call predecessors, (69), 7 states have return successors, (67), 17 states have call predecessors, (67), 16 states have call successors, (67) [2025-03-03 14:47:04,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:04,568 INFO L93 Difference]: Finished difference Result 43848 states and 60591 transitions. [2025-03-03 14:47:04,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2025-03-03 14:47:04,569 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 9.266666666666667) internal successors, (278), 29 states have internal predecessors, (278), 17 states have call successors, (69), 7 states have call predecessors, (69), 7 states have return successors, (67), 17 states have call predecessors, (67), 16 states have call successors, (67) Word has length 357 [2025-03-03 14:47:04,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:04,723 INFO L225 Difference]: With dead ends: 43848 [2025-03-03 14:47:04,723 INFO L226 Difference]: Without dead ends: 38155 [2025-03-03 14:47:04,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 834 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4049 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1488, Invalid=12318, Unknown=0, NotChecked=0, Total=13806 [2025-03-03 14:47:04,745 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 3154 mSDsluCounter, 15559 mSDsCounter, 0 mSdLazyCounter, 7932 mSolverCounterSat, 1053 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3154 SdHoareTripleChecker+Valid, 16512 SdHoareTripleChecker+Invalid, 8985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1053 IncrementalHoareTripleChecker+Valid, 7932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:04,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3154 Valid, 16512 Invalid, 8985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1053 Valid, 7932 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-03 14:47:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38155 states. [2025-03-03 14:47:05,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38155 to 12869. [2025-03-03 14:47:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12869 states, 9760 states have (on average 1.283094262295082) internal successors, (12523), 10116 states have internal predecessors, (12523), 2092 states have call successors, (2092), 1016 states have call predecessors, (2092), 1016 states have return successors, (2092), 1736 states have call predecessors, (2092), 2092 states have call successors, (2092) [2025-03-03 14:47:05,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12869 states to 12869 states and 16707 transitions. [2025-03-03 14:47:06,012 INFO L78 Accepts]: Start accepts. Automaton has 12869 states and 16707 transitions. Word has length 357 [2025-03-03 14:47:06,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:06,013 INFO L471 AbstractCegarLoop]: Abstraction has 12869 states and 16707 transitions. [2025-03-03 14:47:06,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 9.266666666666667) internal successors, (278), 29 states have internal predecessors, (278), 17 states have call successors, (69), 7 states have call predecessors, (69), 7 states have return successors, (67), 17 states have call predecessors, (67), 16 states have call successors, (67) [2025-03-03 14:47:06,014 INFO L276 IsEmpty]: Start isEmpty. Operand 12869 states and 16707 transitions. [2025-03-03 14:47:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-03 14:47:06,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:06,031 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:47:06,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 14:47:06,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-03 14:47:06,232 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:06,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:06,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1654920620, now seen corresponding path program 1 times [2025-03-03 14:47:06,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:06,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107817635] [2025-03-03 14:47:06,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:06,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:06,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-03 14:47:06,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-03 14:47:06,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:06,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 14:47:06,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:06,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107817635] [2025-03-03 14:47:06,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107817635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:06,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:06,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:47:06,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993458090] [2025-03-03 14:47:06,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:06,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:47:06,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:06,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:47:06,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:47:06,517 INFO L87 Difference]: Start difference. First operand 12869 states and 16707 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:47:07,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:07,936 INFO L93 Difference]: Finished difference Result 25661 states and 33281 transitions. [2025-03-03 14:47:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:47:07,937 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 357 [2025-03-03 14:47:07,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:07,986 INFO L225 Difference]: With dead ends: 25661 [2025-03-03 14:47:07,986 INFO L226 Difference]: Without dead ends: 14141 [2025-03-03 14:47:08,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:47:08,006 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 161 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 2329 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:08,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 2329 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:47:08,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14141 states. [2025-03-03 14:47:08,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14141 to 12453. [2025-03-03 14:47:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12453 states, 9464 states have (on average 1.2716610312764158) internal successors, (12035), 9828 states have internal predecessors, (12035), 1980 states have call successors, (1980), 1008 states have call predecessors, (1980), 1008 states have return successors, (1980), 1616 states have call predecessors, (1980), 1980 states have call successors, (1980) [2025-03-03 14:47:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12453 states to 12453 states and 15995 transitions. [2025-03-03 14:47:09,038 INFO L78 Accepts]: Start accepts. Automaton has 12453 states and 15995 transitions. Word has length 357 [2025-03-03 14:47:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:09,038 INFO L471 AbstractCegarLoop]: Abstraction has 12453 states and 15995 transitions. [2025-03-03 14:47:09,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:47:09,039 INFO L276 IsEmpty]: Start isEmpty. Operand 12453 states and 15995 transitions. [2025-03-03 14:47:09,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-03 14:47:09,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:09,052 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:47:09,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 14:47:09,052 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:09,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:09,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1465824227, now seen corresponding path program 1 times [2025-03-03 14:47:09,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:09,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853265134] [2025-03-03 14:47:09,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:09,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:09,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-03 14:47:09,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-03 14:47:09,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:09,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:09,667 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2025-03-03 14:47:09,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:09,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853265134] [2025-03-03 14:47:09,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853265134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:09,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:09,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:47:09,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653911139] [2025-03-03 14:47:09,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:09,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:47:09,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:09,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:47:09,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:47:09,669 INFO L87 Difference]: Start difference. First operand 12453 states and 15995 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:47:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:11,541 INFO L93 Difference]: Finished difference Result 27537 states and 35167 transitions. [2025-03-03 14:47:11,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:47:11,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) Word has length 358 [2025-03-03 14:47:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:11,597 INFO L225 Difference]: With dead ends: 27537 [2025-03-03 14:47:11,597 INFO L226 Difference]: Without dead ends: 16433 [2025-03-03 14:47:11,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:47:11,620 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 76 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:11,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1747 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:47:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16433 states. [2025-03-03 14:47:12,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16433 to 15237. [2025-03-03 14:47:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15237 states, 11520 states have (on average 1.2613715277777777) internal successors, (14531), 11956 states have internal predecessors, (14531), 2396 states have call successors, (2396), 1224 states have call predecessors, (2396), 1320 states have return successors, (2516), 2056 states have call predecessors, (2516), 2396 states have call successors, (2516) [2025-03-03 14:47:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15237 states to 15237 states and 19443 transitions. [2025-03-03 14:47:12,787 INFO L78 Accepts]: Start accepts. Automaton has 15237 states and 19443 transitions. Word has length 358 [2025-03-03 14:47:12,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:12,787 INFO L471 AbstractCegarLoop]: Abstraction has 15237 states and 19443 transitions. [2025-03-03 14:47:12,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:47:12,788 INFO L276 IsEmpty]: Start isEmpty. Operand 15237 states and 19443 transitions. [2025-03-03 14:47:12,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-03 14:47:12,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:12,803 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:47:12,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 14:47:12,804 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:12,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:12,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1662337732, now seen corresponding path program 1 times [2025-03-03 14:47:12,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:12,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467762463] [2025-03-03 14:47:12,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:12,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:12,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-03 14:47:12,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-03 14:47:12,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:12,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:12,908 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 863 trivial. 0 not checked. [2025-03-03 14:47:12,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:12,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467762463] [2025-03-03 14:47:12,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467762463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:12,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:12,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:47:12,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251854282] [2025-03-03 14:47:12,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:12,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:47:12,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:12,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:47:12,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:47:12,910 INFO L87 Difference]: Start difference. First operand 15237 states and 19443 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 14:47:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:13,983 INFO L93 Difference]: Finished difference Result 30707 states and 39081 transitions. [2025-03-03 14:47:13,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:47:13,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 358 [2025-03-03 14:47:13,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:14,037 INFO L225 Difference]: With dead ends: 30707 [2025-03-03 14:47:14,037 INFO L226 Difference]: Without dead ends: 14853 [2025-03-03 14:47:14,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:47:14,068 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 26 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:14,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 673 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:47:14,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14853 states. [2025-03-03 14:47:15,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14853 to 14853. [2025-03-03 14:47:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14853 states, 11232 states have (on average 1.2314814814814814) internal successors, (13832), 11668 states have internal predecessors, (13832), 2396 states have call successors, (2396), 1224 states have call predecessors, (2396), 1224 states have return successors, (2396), 1960 states have call predecessors, (2396), 2396 states have call successors, (2396) [2025-03-03 14:47:15,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14853 states to 14853 states and 18624 transitions. [2025-03-03 14:47:15,194 INFO L78 Accepts]: Start accepts. Automaton has 14853 states and 18624 transitions. Word has length 358 [2025-03-03 14:47:15,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:15,195 INFO L471 AbstractCegarLoop]: Abstraction has 14853 states and 18624 transitions. [2025-03-03 14:47:15,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 14:47:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 14853 states and 18624 transitions. [2025-03-03 14:47:15,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-03-03 14:47:15,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:15,213 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:47:15,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 14:47:15,213 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:15,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:15,213 INFO L85 PathProgramCache]: Analyzing trace with hash -2036306492, now seen corresponding path program 1 times [2025-03-03 14:47:15,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:15,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225257531] [2025-03-03 14:47:15,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:15,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:15,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-03 14:47:15,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-03 14:47:15,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:15,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2025-03-03 14:47:16,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225257531] [2025-03-03 14:47:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225257531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:47:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018112836] [2025-03-03 14:47:16,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:16,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:47:16,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:47:16,114 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:47:16,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 14:47:16,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-03 14:47:16,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-03 14:47:16,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:16,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:16,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 14:47:16,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:47:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 303 proven. 70 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2025-03-03 14:47:16,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:47:17,408 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-03-03 14:47:17,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018112836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:47:17,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:47:17,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 13] total 33 [2025-03-03 14:47:17,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145563585] [2025-03-03 14:47:17,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:47:17,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 14:47:17,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:17,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 14:47:17,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=960, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 14:47:17,411 INFO L87 Difference]: Start difference. First operand 14853 states and 18624 transitions. Second operand has 33 states, 32 states have (on average 10.5625) internal successors, (338), 30 states have internal predecessors, (338), 16 states have call successors, (78), 9 states have call predecessors, (78), 11 states have return successors, (76), 17 states have call predecessors, (76), 15 states have call successors, (76)