./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label12.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/eca-rers2012/Problem11_label12.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 ffbcc3b4e73f8ad55a0649493c69e3be3f48518c4d71790476a2cf0516dec892 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:31:46,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:31:46,688 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:31:46,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:31:46,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:31:46,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:31:46,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:31:46,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:31:46,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:31:46,711 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:31:46,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:31:46,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:31:46,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:31:46,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:31:46,712 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:31:46,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:31:46,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:31:46,713 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:31:46,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:31:46,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:31:46,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:31:46,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:31:46,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:31:46,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:31:46,713 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:31:46,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:31:46,713 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:31:46,713 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:31:46,713 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:31:46,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:31:46,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:31:46,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:31:46,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:31:46,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:31:46,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:31:46,714 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:31:46,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:31:46,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:31:46,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:31:46,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:31:46,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:31:46,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:31:46,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:31:46,715 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 -> ffbcc3b4e73f8ad55a0649493c69e3be3f48518c4d71790476a2cf0516dec892 [2025-03-03 10:31:46,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:31:46,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:31:46,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:31:46,919 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:31:46,919 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:31:46,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label12.c [2025-03-03 10:31:48,015 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e53e235/2e8d4eac41b445e787efef22480641a1/FLAG41ff38d80 [2025-03-03 10:31:48,275 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:31:48,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label12.c [2025-03-03 10:31:48,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e53e235/2e8d4eac41b445e787efef22480641a1/FLAG41ff38d80 [2025-03-03 10:31:48,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e53e235/2e8d4eac41b445e787efef22480641a1 [2025-03-03 10:31:48,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:31:48,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:31:48,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:31:48,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:31:48,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:31:48,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:48,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b53348a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48, skipping insertion in model container [2025-03-03 10:31:48,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:48,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:31:48,725 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/eca-rers2012/Problem11_label12.c[3684,3697] [2025-03-03 10:31:48,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:31:48,872 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:31:48,886 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/eca-rers2012/Problem11_label12.c[3684,3697] [2025-03-03 10:31:48,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:31:48,966 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:31:48,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48 WrapperNode [2025-03-03 10:31:48,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:31:48,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:31:48,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:31:48,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:31:48,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:48,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:49,067 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-03 10:31:49,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:31:49,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:31:49,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:31:49,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:31:49,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:49,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:49,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:49,134 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 10:31:49,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:49,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:49,157 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:49,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:49,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:49,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:49,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:31:49,191 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:31:49,191 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:31:49,191 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:31:49,192 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:49,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:31:49,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:31:49,215 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 10:31:49,220 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 10:31:49,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:31:49,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:31:49,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:31:49,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:31:49,284 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:31:49,285 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:31:50,500 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-03 10:31:50,500 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:31:50,515 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:31:50,517 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:31:50,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:31:50 BoogieIcfgContainer [2025-03-03 10:31:50,517 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:31:50,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:31:50,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:31:50,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:31:50,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:31:48" (1/3) ... [2025-03-03 10:31:50,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7093c715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:31:50, skipping insertion in model container [2025-03-03 10:31:50,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (2/3) ... [2025-03-03 10:31:50,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7093c715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:31:50, skipping insertion in model container [2025-03-03 10:31:50,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:31:50" (3/3) ... [2025-03-03 10:31:50,523 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label12.c [2025-03-03 10:31:50,533 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:31:50,534 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label12.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:31:50,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:31:50,601 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;@1b921080, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:31:50,602 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:31:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 10:31:50,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:50,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:50,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:50,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:50,612 INFO L85 PathProgramCache]: Analyzing trace with hash 462608409, now seen corresponding path program 1 times [2025-03-03 10:31:50,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:50,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305995928] [2025-03-03 10:31:50,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:50,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:50,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 10:31:50,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 10:31:50,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:50,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:50,845 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 10:31:50,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:50,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305995928] [2025-03-03 10:31:50,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305995928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:50,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:50,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:31:50,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573078116] [2025-03-03 10:31:50,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:50,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:50,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:50,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:50,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:50,868 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:51,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:51,690 INFO L93 Difference]: Finished difference Result 761 states and 1342 transitions. [2025-03-03 10:31:51,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:51,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-03 10:31:51,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:51,700 INFO L225 Difference]: With dead ends: 761 [2025-03-03 10:31:51,701 INFO L226 Difference]: Without dead ends: 413 [2025-03-03 10:31:51,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:31:51,705 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 203 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:51,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 223 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:31:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-03 10:31:51,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-03-03 10:31:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2025-03-03 10:31:51,741 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 25 [2025-03-03 10:31:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:51,742 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2025-03-03 10:31:51,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2025-03-03 10:31:51,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 10:31:51,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:51,745 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:31:51,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:31:51,746 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:51,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:51,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2072452733, now seen corresponding path program 1 times [2025-03-03 10:31:51,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:51,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686220192] [2025-03-03 10:31:51,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:51,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:51,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 10:31:51,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 10:31:51,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:51,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:51,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:51,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686220192] [2025-03-03 10:31:51,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686220192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:51,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:51,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:31:51,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342723849] [2025-03-03 10:31:51,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:51,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:51,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:51,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:51,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:51,984 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:52,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:52,645 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2025-03-03 10:31:52,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:52,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-03 10:31:52,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:52,650 INFO L225 Difference]: With dead ends: 1211 [2025-03-03 10:31:52,650 INFO L226 Difference]: Without dead ends: 800 [2025-03-03 10:31:52,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:31:52,651 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:52,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 121 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:31:52,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-03 10:31:52,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2025-03-03 10:31:52,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:52,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2025-03-03 10:31:52,669 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 93 [2025-03-03 10:31:52,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:52,669 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2025-03-03 10:31:52,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2025-03-03 10:31:52,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 10:31:52,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:52,673 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:31:52,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:31:52,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:52,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:52,674 INFO L85 PathProgramCache]: Analyzing trace with hash 902588264, now seen corresponding path program 1 times [2025-03-03 10:31:52,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:52,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526092209] [2025-03-03 10:31:52,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:52,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:52,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 10:31:52,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 10:31:52,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:52,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:52,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:52,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526092209] [2025-03-03 10:31:52,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526092209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:52,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:52,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:31:52,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280181611] [2025-03-03 10:31:52,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:52,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:52,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:52,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:52,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:52,938 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:53,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:53,528 INFO L93 Difference]: Finished difference Result 2314 states and 3181 transitions. [2025-03-03 10:31:53,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:53,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 10:31:53,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:53,533 INFO L225 Difference]: With dead ends: 2314 [2025-03-03 10:31:53,533 INFO L226 Difference]: Without dead ends: 1527 [2025-03-03 10:31:53,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:31:53,534 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:53,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 193 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:31:53,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-03-03 10:31:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1526. [2025-03-03 10:31:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.217049180327869) internal successors, (1856), 1525 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1856 transitions. [2025-03-03 10:31:53,554 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1856 transitions. Word has length 95 [2025-03-03 10:31:53,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:53,555 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1856 transitions. [2025-03-03 10:31:53,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1856 transitions. [2025-03-03 10:31:53,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 10:31:53,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:53,558 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:31:53,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:31:53,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:53,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:53,559 INFO L85 PathProgramCache]: Analyzing trace with hash 467593655, now seen corresponding path program 1 times [2025-03-03 10:31:53,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:53,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208409456] [2025-03-03 10:31:53,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:53,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:53,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 10:31:53,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 10:31:53,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:53,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:53,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:53,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208409456] [2025-03-03 10:31:53,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208409456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:53,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:53,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:53,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880791481] [2025-03-03 10:31:53,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:53,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:53,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:53,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:53,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:53,737 INFO L87 Difference]: Start difference. First operand 1526 states and 1856 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:54,374 INFO L93 Difference]: Finished difference Result 3257 states and 4123 transitions. [2025-03-03 10:31:54,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:54,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2025-03-03 10:31:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:54,379 INFO L225 Difference]: With dead ends: 3257 [2025-03-03 10:31:54,379 INFO L226 Difference]: Without dead ends: 1917 [2025-03-03 10:31:54,381 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 10:31:54,383 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 210 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:54,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:31:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2025-03-03 10:31:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1914. [2025-03-03 10:31:54,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.2462101411395714) internal successors, (2384), 1913 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:54,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2384 transitions. [2025-03-03 10:31:54,413 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2384 transitions. Word has length 152 [2025-03-03 10:31:54,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:54,415 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2384 transitions. [2025-03-03 10:31:54,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2384 transitions. [2025-03-03 10:31:54,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 10:31:54,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:54,417 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:31:54,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:31:54,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:54,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:54,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1746209270, now seen corresponding path program 1 times [2025-03-03 10:31:54,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:54,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484688073] [2025-03-03 10:31:54,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:54,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:54,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 10:31:54,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 10:31:54,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:54,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 10:31:54,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:54,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484688073] [2025-03-03 10:31:54,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484688073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:54,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:54,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:54,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629030282] [2025-03-03 10:31:54,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:54,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:54,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:54,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:54,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:54,619 INFO L87 Difference]: Start difference. First operand 1914 states and 2384 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:55,244 INFO L93 Difference]: Finished difference Result 4389 states and 5590 transitions. [2025-03-03 10:31:55,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:55,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2025-03-03 10:31:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:55,251 INFO L225 Difference]: With dead ends: 4389 [2025-03-03 10:31:55,251 INFO L226 Difference]: Without dead ends: 2661 [2025-03-03 10:31:55,253 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 10:31:55,254 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 172 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:55,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 392 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:31:55,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2025-03-03 10:31:55,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2467. [2025-03-03 10:31:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2466 states have (on average 1.2347931873479319) internal successors, (3045), 2466 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:55,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3045 transitions. [2025-03-03 10:31:55,303 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3045 transitions. Word has length 207 [2025-03-03 10:31:55,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:55,304 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 3045 transitions. [2025-03-03 10:31:55,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:55,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3045 transitions. [2025-03-03 10:31:55,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-03 10:31:55,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:55,306 INFO L218 NwaCegarLoop]: trace histogram [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, 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 10:31:55,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:31:55,306 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:55,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:55,306 INFO L85 PathProgramCache]: Analyzing trace with hash -2073682375, now seen corresponding path program 1 times [2025-03-03 10:31:55,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:55,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325672427] [2025-03-03 10:31:55,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:55,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:55,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-03 10:31:55,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-03 10:31:55,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:55,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 10:31:55,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:55,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325672427] [2025-03-03 10:31:55,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325672427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:31:55,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479992134] [2025-03-03 10:31:55,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:55,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:31:55,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:31:55,660 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 10:31:55,661 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 10:31:55,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-03 10:31:55,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-03 10:31:55,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:55,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:55,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:31:55,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:31:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 10:31:55,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:31:55,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479992134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:55,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:31:55,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:31:55,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619309] [2025-03-03 10:31:55,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:55,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:55,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:55,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:55,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:31:55,809 INFO L87 Difference]: Start difference. First operand 2467 states and 3045 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:56,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:56,477 INFO L93 Difference]: Finished difference Result 6589 states and 8262 transitions. [2025-03-03 10:31:56,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:56,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2025-03-03 10:31:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:56,487 INFO L225 Difference]: With dead ends: 6589 [2025-03-03 10:31:56,488 INFO L226 Difference]: Without dead ends: 4124 [2025-03-03 10:31:56,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:31:56,491 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 186 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:56,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 145 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:31:56,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4124 states. [2025-03-03 10:31:56,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4124 to 4124. [2025-03-03 10:31:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4124 states, 4123 states have (on average 1.2277467863206404) internal successors, (5062), 4123 states have internal predecessors, (5062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 4124 states and 5062 transitions. [2025-03-03 10:31:56,554 INFO L78 Accepts]: Start accepts. Automaton has 4124 states and 5062 transitions. Word has length 213 [2025-03-03 10:31:56,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:56,555 INFO L471 AbstractCegarLoop]: Abstraction has 4124 states and 5062 transitions. [2025-03-03 10:31:56,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:56,555 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states and 5062 transitions. [2025-03-03 10:31:56,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-03 10:31:56,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:56,558 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:31:56,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:31:56,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 10:31:56,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:56,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:56,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1173571398, now seen corresponding path program 1 times [2025-03-03 10:31:56,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:56,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250893048] [2025-03-03 10:31:56,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:56,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:56,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-03 10:31:56,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-03 10:31:56,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:56,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-03 10:31:56,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:56,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250893048] [2025-03-03 10:31:56,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250893048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:56,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:56,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:56,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762435694] [2025-03-03 10:31:56,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:56,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:56,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:56,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:56,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:56,929 INFO L87 Difference]: Start difference. First operand 4124 states and 5062 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:57,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:57,591 INFO L93 Difference]: Finished difference Result 9544 states and 11819 transitions. [2025-03-03 10:31:57,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:57,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2025-03-03 10:31:57,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:57,606 INFO L225 Difference]: With dead ends: 9544 [2025-03-03 10:31:57,606 INFO L226 Difference]: Without dead ends: 5422 [2025-03-03 10:31:57,611 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 10:31:57,611 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 171 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:57,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 390 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:31:57,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5422 states. [2025-03-03 10:31:57,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5422 to 5413. [2025-03-03 10:31:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5413 states, 5412 states have (on average 1.2065779748706578) internal successors, (6530), 5412 states have internal predecessors, (6530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5413 states to 5413 states and 6530 transitions. [2025-03-03 10:31:57,693 INFO L78 Accepts]: Start accepts. Automaton has 5413 states and 6530 transitions. Word has length 244 [2025-03-03 10:31:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:57,693 INFO L471 AbstractCegarLoop]: Abstraction has 5413 states and 6530 transitions. [2025-03-03 10:31:57,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 5413 states and 6530 transitions. [2025-03-03 10:31:57,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-03 10:31:57,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:57,700 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:31:57,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:31:57,700 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:57,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:57,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1487624385, now seen corresponding path program 1 times [2025-03-03 10:31:57,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:57,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547901885] [2025-03-03 10:31:57,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:57,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:57,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-03 10:31:57,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-03 10:31:57,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:57,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-03-03 10:31:57,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:57,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547901885] [2025-03-03 10:31:57,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547901885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:57,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:57,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:57,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170561586] [2025-03-03 10:31:57,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:57,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:57,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:57,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:57,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:57,861 INFO L87 Difference]: Start difference. First operand 5413 states and 6530 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:58,475 INFO L93 Difference]: Finished difference Result 12295 states and 15022 transitions. [2025-03-03 10:31:58,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:58,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290 [2025-03-03 10:31:58,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:58,494 INFO L225 Difference]: With dead ends: 12295 [2025-03-03 10:31:58,494 INFO L226 Difference]: Without dead ends: 6884 [2025-03-03 10:31:58,500 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 10:31:58,500 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 199 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:58,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 151 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:31:58,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6884 states. [2025-03-03 10:31:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6884 to 4854. [2025-03-03 10:31:58,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4854 states, 4853 states have (on average 1.2248093962497424) internal successors, (5944), 4853 states have internal predecessors, (5944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4854 states to 4854 states and 5944 transitions. [2025-03-03 10:31:58,582 INFO L78 Accepts]: Start accepts. Automaton has 4854 states and 5944 transitions. Word has length 290 [2025-03-03 10:31:58,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:58,583 INFO L471 AbstractCegarLoop]: Abstraction has 4854 states and 5944 transitions. [2025-03-03 10:31:58,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 4854 states and 5944 transitions. [2025-03-03 10:31:58,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-03 10:31:58,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:58,587 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-03-03 10:31:58,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:31:58,588 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:58,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:58,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1336928323, now seen corresponding path program 1 times [2025-03-03 10:31:58,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:58,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689584359] [2025-03-03 10:31:58,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:58,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:58,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-03 10:31:58,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-03 10:31:58,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:58,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:59,019 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 113 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:59,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:59,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689584359] [2025-03-03 10:31:59,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689584359] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:31:59,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103225503] [2025-03-03 10:31:59,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:59,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:31:59,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:31:59,022 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 10:31:59,024 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 10:31:59,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-03 10:31:59,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-03 10:31:59,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:59,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:59,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 10:31:59,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:00,379 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 113 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:00,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:32:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 113 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:01,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103225503] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:32:01,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:32:01,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 10:32:01,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088959316] [2025-03-03 10:32:01,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:32:01,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 10:32:01,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:01,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 10:32:01,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:32:01,742 INFO L87 Difference]: Start difference. First operand 4854 states and 5944 transitions. Second operand has 8 states, 8 states have (on average 71.375) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:03,826 INFO L93 Difference]: Finished difference Result 14359 states and 17348 transitions. [2025-03-03 10:32:03,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 10:32:03,827 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 71.375) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 309 [2025-03-03 10:32:03,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:03,846 INFO L225 Difference]: With dead ends: 14359 [2025-03-03 10:32:03,846 INFO L226 Difference]: Without dead ends: 9507 [2025-03-03 10:32:03,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 614 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-03 10:32:03,852 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 865 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2791 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 3220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 2791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:03,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 186 Invalid, 3220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 2791 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:32:03,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9507 states. [2025-03-03 10:32:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9507 to 5035. [2025-03-03 10:32:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5035 states, 5034 states have (on average 1.2177195073500198) internal successors, (6130), 5034 states have internal predecessors, (6130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5035 states to 5035 states and 6130 transitions. [2025-03-03 10:32:03,921 INFO L78 Accepts]: Start accepts. Automaton has 5035 states and 6130 transitions. Word has length 309 [2025-03-03 10:32:03,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:03,921 INFO L471 AbstractCegarLoop]: Abstraction has 5035 states and 6130 transitions. [2025-03-03 10:32:03,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 71.375) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:03,925 INFO L276 IsEmpty]: Start isEmpty. Operand 5035 states and 6130 transitions. [2025-03-03 10:32:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-03 10:32:03,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:03,931 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-03-03 10:32:03,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 10:32:04,131 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,SelfDestructingSolverStorable8 [2025-03-03 10:32:04,132 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:04,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:04,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1540708531, now seen corresponding path program 1 times [2025-03-03 10:32:04,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:04,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931807655] [2025-03-03 10:32:04,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:04,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:04,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-03 10:32:04,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-03 10:32:04,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:04,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:04,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:04,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931807655] [2025-03-03 10:32:04,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931807655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:04,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:04,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:32:04,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892151675] [2025-03-03 10:32:04,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:04,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:04,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:04,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:04,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:04,390 INFO L87 Difference]: Start difference. First operand 5035 states and 6130 transitions. Second operand has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:05,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:05,222 INFO L93 Difference]: Finished difference Result 13948 states and 17018 transitions. [2025-03-03 10:32:05,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:05,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 330 [2025-03-03 10:32:05,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:05,234 INFO L225 Difference]: With dead ends: 13948 [2025-03-03 10:32:05,235 INFO L226 Difference]: Without dead ends: 8915 [2025-03-03 10:32:05,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:05,239 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 265 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:05,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 64 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:32:05,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8915 states. [2025-03-03 10:32:05,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8915 to 7625. [2025-03-03 10:32:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7625 states, 7624 states have (on average 1.189270724029381) internal successors, (9067), 7624 states have internal predecessors, (9067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7625 states to 7625 states and 9067 transitions. [2025-03-03 10:32:05,336 INFO L78 Accepts]: Start accepts. Automaton has 7625 states and 9067 transitions. Word has length 330 [2025-03-03 10:32:05,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:05,336 INFO L471 AbstractCegarLoop]: Abstraction has 7625 states and 9067 transitions. [2025-03-03 10:32:05,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 7625 states and 9067 transitions. [2025-03-03 10:32:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-03 10:32:05,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:05,346 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:32:05,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:32:05,347 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:05,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:05,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1795036007, now seen corresponding path program 1 times [2025-03-03 10:32:05,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:05,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124378114] [2025-03-03 10:32:05,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:05,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:05,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-03 10:32:05,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-03 10:32:05,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:05,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 10:32:05,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:05,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124378114] [2025-03-03 10:32:05,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124378114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:05,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:05,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:05,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218668959] [2025-03-03 10:32:05,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:05,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:05,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:05,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:05,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:05,542 INFO L87 Difference]: Start difference. First operand 7625 states and 9067 transitions. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:06,349 INFO L93 Difference]: Finished difference Result 20971 states and 24863 transitions. [2025-03-03 10:32:06,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:06,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 404 [2025-03-03 10:32:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:06,368 INFO L225 Difference]: With dead ends: 20971 [2025-03-03 10:32:06,369 INFO L226 Difference]: Without dead ends: 13348 [2025-03-03 10:32:06,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:06,378 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 287 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:06,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 76 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:32:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13348 states. [2025-03-03 10:32:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13348 to 13161. [2025-03-03 10:32:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13161 states, 13160 states have (on average 1.1724164133738602) internal successors, (15429), 13160 states have internal predecessors, (15429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13161 states to 13161 states and 15429 transitions. [2025-03-03 10:32:06,491 INFO L78 Accepts]: Start accepts. Automaton has 13161 states and 15429 transitions. Word has length 404 [2025-03-03 10:32:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:06,492 INFO L471 AbstractCegarLoop]: Abstraction has 13161 states and 15429 transitions. [2025-03-03 10:32:06,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand 13161 states and 15429 transitions. [2025-03-03 10:32:06,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-03 10:32:06,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:06,503 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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 10:32:06,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:32:06,504 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:06,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:06,504 INFO L85 PathProgramCache]: Analyzing trace with hash 275000182, now seen corresponding path program 1 times [2025-03-03 10:32:06,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:06,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739392611] [2025-03-03 10:32:06,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:06,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:06,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-03 10:32:06,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-03 10:32:06,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:06,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:06,808 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 10:32:06,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:06,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739392611] [2025-03-03 10:32:06,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739392611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:06,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:06,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:32:06,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960394927] [2025-03-03 10:32:06,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:06,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:06,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:06,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:06,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:06,810 INFO L87 Difference]: Start difference. First operand 13161 states and 15429 transitions. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:07,661 INFO L93 Difference]: Finished difference Result 28531 states and 33339 transitions. [2025-03-03 10:32:07,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:07,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 404 [2025-03-03 10:32:07,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:07,683 INFO L225 Difference]: With dead ends: 28531 [2025-03-03 10:32:07,683 INFO L226 Difference]: Without dead ends: 15372 [2025-03-03 10:32:07,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:07,692 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 279 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:07,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 60 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:32:07,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15372 states. [2025-03-03 10:32:07,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15372 to 13161. [2025-03-03 10:32:07,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13161 states, 13160 states have (on average 1.1724164133738602) internal successors, (15429), 13160 states have internal predecessors, (15429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13161 states to 13161 states and 15429 transitions. [2025-03-03 10:32:07,803 INFO L78 Accepts]: Start accepts. Automaton has 13161 states and 15429 transitions. Word has length 404 [2025-03-03 10:32:07,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:07,803 INFO L471 AbstractCegarLoop]: Abstraction has 13161 states and 15429 transitions. [2025-03-03 10:32:07,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:07,803 INFO L276 IsEmpty]: Start isEmpty. Operand 13161 states and 15429 transitions. [2025-03-03 10:32:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-03-03 10:32:07,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:07,817 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 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 10:32:07,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:32:07,817 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:07,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:07,818 INFO L85 PathProgramCache]: Analyzing trace with hash 2091748266, now seen corresponding path program 1 times [2025-03-03 10:32:07,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:07,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830122564] [2025-03-03 10:32:07,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:07,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:07,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-03 10:32:07,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-03 10:32:07,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:07,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:08,097 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 10:32:08,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:08,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830122564] [2025-03-03 10:32:08,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830122564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:08,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:08,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:08,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361933225] [2025-03-03 10:32:08,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:08,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:08,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:08,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:08,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:08,099 INFO L87 Difference]: Start difference. First operand 13161 states and 15429 transitions. Second operand has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:08,603 INFO L93 Difference]: Finished difference Result 26523 states and 31079 transitions. [2025-03-03 10:32:08,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:08,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 449 [2025-03-03 10:32:08,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:08,620 INFO L225 Difference]: With dead ends: 26523 [2025-03-03 10:32:08,621 INFO L226 Difference]: Without dead ends: 13364 [2025-03-03 10:32:08,633 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 10:32:08,633 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 62 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:08,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 330 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:08,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13364 states. [2025-03-03 10:32:08,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13364 to 12609. [2025-03-03 10:32:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12609 states, 12608 states have (on average 1.1452252538071066) internal successors, (14439), 12608 states have internal predecessors, (14439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12609 states to 12609 states and 14439 transitions. [2025-03-03 10:32:08,746 INFO L78 Accepts]: Start accepts. Automaton has 12609 states and 14439 transitions. Word has length 449 [2025-03-03 10:32:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:08,747 INFO L471 AbstractCegarLoop]: Abstraction has 12609 states and 14439 transitions. [2025-03-03 10:32:08,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 12609 states and 14439 transitions. [2025-03-03 10:32:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-03 10:32:08,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:08,756 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:08,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:32:08,756 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:08,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash 409536963, now seen corresponding path program 1 times [2025-03-03 10:32:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:08,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387604108] [2025-03-03 10:32:08,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:08,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:08,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-03 10:32:08,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-03 10:32:08,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:08,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-03 10:32:08,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:08,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387604108] [2025-03-03 10:32:08,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387604108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:08,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:08,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:32:08,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713043682] [2025-03-03 10:32:08,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:08,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:08,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:08,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:08,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:08,923 INFO L87 Difference]: Start difference. First operand 12609 states and 14439 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:09,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:09,246 INFO L93 Difference]: Finished difference Result 24646 states and 28183 transitions. [2025-03-03 10:32:09,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:09,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 461 [2025-03-03 10:32:09,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:09,261 INFO L225 Difference]: With dead ends: 24646 [2025-03-03 10:32:09,261 INFO L226 Difference]: Without dead ends: 12039 [2025-03-03 10:32:09,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:32:09,269 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:09,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 37 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:32:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12039 states. [2025-03-03 10:32:09,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12039 to 12035. [2025-03-03 10:32:09,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12035 states, 12034 states have (on average 1.1411002160545123) internal successors, (13732), 12034 states have internal predecessors, (13732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12035 states to 12035 states and 13732 transitions. [2025-03-03 10:32:09,364 INFO L78 Accepts]: Start accepts. Automaton has 12035 states and 13732 transitions. Word has length 461 [2025-03-03 10:32:09,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:09,364 INFO L471 AbstractCegarLoop]: Abstraction has 12035 states and 13732 transitions. [2025-03-03 10:32:09,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 12035 states and 13732 transitions. [2025-03-03 10:32:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-03 10:32:09,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:09,373 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 1, 1, 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 10:32:09,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:32:09,373 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:09,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:09,374 INFO L85 PathProgramCache]: Analyzing trace with hash 211258075, now seen corresponding path program 1 times [2025-03-03 10:32:09,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:09,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590875861] [2025-03-03 10:32:09,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:09,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:09,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-03 10:32:09,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-03 10:32:09,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:09,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:09,545 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 10:32:09,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:09,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590875861] [2025-03-03 10:32:09,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590875861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:09,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:09,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:09,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992266902] [2025-03-03 10:32:09,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:09,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:09,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:09,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:09,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:09,547 INFO L87 Difference]: Start difference. First operand 12035 states and 13732 transitions. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:09,945 INFO L93 Difference]: Finished difference Result 22389 states and 25413 transitions. [2025-03-03 10:32:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:09,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 477 [2025-03-03 10:32:09,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:09,957 INFO L225 Difference]: With dead ends: 22389 [2025-03-03 10:32:09,957 INFO L226 Difference]: Without dead ends: 10356 [2025-03-03 10:32:09,963 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 10:32:09,964 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 80 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:09,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 123 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:09,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10356 states. [2025-03-03 10:32:10,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10356 to 9620. [2025-03-03 10:32:10,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9620 states, 9619 states have (on average 1.1143570017673354) internal successors, (10719), 9619 states have internal predecessors, (10719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9620 states to 9620 states and 10719 transitions. [2025-03-03 10:32:10,036 INFO L78 Accepts]: Start accepts. Automaton has 9620 states and 10719 transitions. Word has length 477 [2025-03-03 10:32:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:10,036 INFO L471 AbstractCegarLoop]: Abstraction has 9620 states and 10719 transitions. [2025-03-03 10:32:10,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:10,037 INFO L276 IsEmpty]: Start isEmpty. Operand 9620 states and 10719 transitions. [2025-03-03 10:32:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-03-03 10:32:10,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:10,047 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:32:10,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:32:10,047 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:10,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:10,048 INFO L85 PathProgramCache]: Analyzing trace with hash -540510530, now seen corresponding path program 1 times [2025-03-03 10:32:10,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:10,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34204608] [2025-03-03 10:32:10,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:10,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:10,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-03 10:32:10,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-03 10:32:10,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:10,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 942 proven. 0 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2025-03-03 10:32:10,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:10,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34204608] [2025-03-03 10:32:10,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34204608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:10,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:10,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:10,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84477438] [2025-03-03 10:32:10,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:10,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:10,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:10,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:10,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:10,305 INFO L87 Difference]: Start difference. First operand 9620 states and 10719 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:10,788 INFO L93 Difference]: Finished difference Result 20893 states and 23289 transitions. [2025-03-03 10:32:10,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:10,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 733 [2025-03-03 10:32:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:10,796 INFO L225 Difference]: With dead ends: 20893 [2025-03-03 10:32:10,796 INFO L226 Difference]: Without dead ends: 10170 [2025-03-03 10:32:10,800 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 10:32:10,801 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 194 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:10,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 340 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:10,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10170 states. [2025-03-03 10:32:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10170 to 10170. [2025-03-03 10:32:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10170 states, 10169 states have (on average 1.0946995771462287) internal successors, (11132), 10169 states have internal predecessors, (11132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10170 states to 10170 states and 11132 transitions. [2025-03-03 10:32:10,909 INFO L78 Accepts]: Start accepts. Automaton has 10170 states and 11132 transitions. Word has length 733 [2025-03-03 10:32:10,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:10,909 INFO L471 AbstractCegarLoop]: Abstraction has 10170 states and 11132 transitions. [2025-03-03 10:32:10,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:10,910 INFO L276 IsEmpty]: Start isEmpty. Operand 10170 states and 11132 transitions. [2025-03-03 10:32:10,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 824 [2025-03-03 10:32:10,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:10,926 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2025-03-03 10:32:10,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:32:10,927 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:10,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:10,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1537341879, now seen corresponding path program 1 times [2025-03-03 10:32:10,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:10,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024772906] [2025-03-03 10:32:10,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:10,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:11,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 823 statements into 1 equivalence classes. [2025-03-03 10:32:11,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 823 of 823 statements. [2025-03-03 10:32:11,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:11,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:11,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1919 backedges. 1393 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2025-03-03 10:32:11,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:11,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024772906] [2025-03-03 10:32:11,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024772906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:11,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:11,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:11,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241828161] [2025-03-03 10:32:11,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:11,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:11,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:11,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:11,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:11,237 INFO L87 Difference]: Start difference. First operand 10170 states and 11132 transitions. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:11,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:11,711 INFO L93 Difference]: Finished difference Result 21439 states and 23424 transitions. [2025-03-03 10:32:11,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:11,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 823 [2025-03-03 10:32:11,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:11,712 INFO L225 Difference]: With dead ends: 21439 [2025-03-03 10:32:11,712 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:32:11,717 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 10:32:11,717 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 53 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:11,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 320 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:11,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:32:11,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:32:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:32:11,718 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 823 [2025-03-03 10:32:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:11,718 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:32:11,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:11,718 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:32:11,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:32:11,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:32:11,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:32:11,723 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:11,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:32:13,558 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:32:13,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:32:13 BoogieIcfgContainer [2025-03-03 10:32:13,580 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:32:13,581 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:32:13,581 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:32:13,581 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:32:13,582 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:31:50" (3/4) ... [2025-03-03 10:32:13,583 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:32:13,605 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:32:13,606 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:32:13,607 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:32:13,607 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:32:13,724 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:32:13,724 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:32:13,724 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:32:13,725 INFO L158 Benchmark]: Toolchain (without parser) took 25143.39ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 108.9MB in the beginning and 249.7MB in the end (delta: -140.7MB). Peak memory consumption was 407.3MB. Max. memory is 16.1GB. [2025-03-03 10:32:13,725 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 201.3MB. Free memory was 131.1MB in the beginning and 130.8MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:32:13,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.58ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 66.1MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 10:32:13,725 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.87ms. Allocated memory is still 142.6MB. Free memory was 66.1MB in the beginning and 49.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 10:32:13,726 INFO L158 Benchmark]: Boogie Preprocessor took 121.61ms. Allocated memory is still 142.6MB. Free memory was 49.2MB in the beginning and 88.1MB in the end (delta: -38.9MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2025-03-03 10:32:13,726 INFO L158 Benchmark]: IcfgBuilder took 1326.32ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 40.7MB in the end (delta: 46.7MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2025-03-03 10:32:13,726 INFO L158 Benchmark]: TraceAbstraction took 23061.55ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 39.8MB in the beginning and 266.2MB in the end (delta: -226.4MB). Peak memory consumption was 392.6MB. Max. memory is 16.1GB. [2025-03-03 10:32:13,729 INFO L158 Benchmark]: Witness Printer took 143.24ms. Allocated memory is still 687.9MB. Free memory was 266.2MB in the beginning and 249.7MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 10:32:13,730 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.64ms. Allocated memory is still 201.3MB. Free memory was 131.1MB in the beginning and 130.8MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.58ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 66.1MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.87ms. Allocated memory is still 142.6MB. Free memory was 66.1MB in the beginning and 49.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 121.61ms. Allocated memory is still 142.6MB. Free memory was 49.2MB in the beginning and 88.1MB in the end (delta: -38.9MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1326.32ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 40.7MB in the end (delta: 46.7MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. * TraceAbstraction took 23061.55ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 39.8MB in the beginning and 266.2MB in the end (delta: -226.4MB). Peak memory consumption was 392.6MB. Max. memory is 16.1GB. * Witness Printer took 143.24ms. Allocated memory is still 687.9MB. Free memory was 266.2MB in the beginning and 249.7MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 91]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.2s, OverallIterations: 17, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3666 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3666 mSDsluCounter, 3473 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 436 mSDsCounter, 2273 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12797 IncrementalHoareTripleChecker+Invalid, 15070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2273 mSolverCounterUnsat, 3037 mSDtfsCounter, 12797 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 886 GetRequests, 851 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13161occurred in iteration=11, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 11903 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 6231 NumberOfCodeBlocks, 6231 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 6520 ConstructedInterpolants, 0 QuantifiedInterpolants, 22058 SizeOfPredicates, 8 NumberOfNonLiveVariables, 741 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 7013/7192 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Location Invariant Derived location invariant: ((((((((((((((((((((((a25 <= 10) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) || (((((a25 == 12) && (((long long) a29 + 22) <= 0)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((((a25 == 12) && (a4 == 0)) && (a29 <= 599998)) && (a8 == 15))) || ((((a25 == 13) && (a29 <= 245)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 13) && (a4 == 0)) && (((long long) a29 + 22) <= 0)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((((a25 == 13) && (307 <= a23)) || ((a25 == 13) && (a3 == 1))) && (a29 <= 599998)) && (a4 == 1)) && (a8 == 15))) || (((((a25 == 11) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 <= 10) && (a3 == 1)) && (a23 <= 138)) && (a4 == 1)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((a25 <= 10) && (a29 <= 599998)) && (a4 == 1)) && (a8 == 15))) || (((((a4 == 0) && (a25 == 11)) && (a29 <= 599998)) && (a23 <= 312)) && (a8 == 15))) || ((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a25 <= 10)) && (a8 == 15))) || (((((a25 == 13) && (a4 == 0)) && (((long long) a29 + 22) <= 0)) && (((long long) a23 + 599772) <= 0)) && (a8 == 15))) || ((((((long long) a29 + 21) <= 0) && (a25 == 11)) && (a4 == 1)) && (a8 == 15))) || (((((((long long) a29 + 21) <= 0) && (a25 == 12)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a4 == 0) && (a25 <= 10)) && (a29 <= 245)) && (a23 <= 138)) && (a8 == 15))) || ((((((a25 == 12) && (307 <= a23)) && (a29 <= 599998)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a29 <= 599998)) && (a8 == 15))) || (((((a25 == 11) && (a29 <= 599998)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:32:13,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE