./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label56.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label56.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 77c0c06cf345be89a7bfdea692ab0197740d9f5ad98baaf39e02029ee2fea03a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:52:36,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:52:36,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:52:36,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:52:36,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:52:36,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:52:36,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:52:36,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:52:36,681 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:52:36,681 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:52:36,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:52:36,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:52:36,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:52:36,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:52:36,683 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:52:36,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:52:36,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:52:36,683 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:52:36,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:52:36,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:52:36,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:52:36,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:52:36,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:52:36,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:52:36,683 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:52:36,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:52:36,683 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:52:36,683 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:52:36,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:52:36,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:52:36,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:52:36,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:52:36,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:52:36,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:52:36,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:52:36,684 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:52:36,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:52:36,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:52:36,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:52:36,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:52:36,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:52:36,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:52:36,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:52:36,684 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 -> 77c0c06cf345be89a7bfdea692ab0197740d9f5ad98baaf39e02029ee2fea03a [2025-03-16 14:52:36,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:52:36,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:52:36,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:52:36,919 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:52:36,919 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:52:36,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label56.c [2025-03-16 14:52:38,114 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a02e9be0c/804271252bcf4008a85c6351996f98aa/FLAGd4f9a8dd2 [2025-03-16 14:52:38,479 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:52:38,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label56.c [2025-03-16 14:52:38,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a02e9be0c/804271252bcf4008a85c6351996f98aa/FLAGd4f9a8dd2 [2025-03-16 14:52:38,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a02e9be0c/804271252bcf4008a85c6351996f98aa [2025-03-16 14:52:38,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:52:38,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:52:38,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:52:38,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:52:38,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:52:38,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:52:38" (1/1) ... [2025-03-16 14:52:38,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f809624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:38, skipping insertion in model container [2025-03-16 14:52:38,711 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:52:38" (1/1) ... [2025-03-16 14:52:38,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:52:38,878 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_label56.c[5994,6007] [2025-03-16 14:52:39,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:52:39,095 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:52:39,108 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_label56.c[5994,6007] [2025-03-16 14:52:39,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:52:39,222 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:52:39,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:39 WrapperNode [2025-03-16 14:52:39,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:52:39,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:52:39,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:52:39,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:52:39,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:39" (1/1) ... [2025-03-16 14:52:39,246 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:39" (1/1) ... [2025-03-16 14:52:39,308 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-16 14:52:39,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:52:39,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:52:39,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:52:39,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:52:39,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:39" (1/1) ... [2025-03-16 14:52:39,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:39" (1/1) ... [2025-03-16 14:52:39,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:39" (1/1) ... [2025-03-16 14:52:39,382 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:52:39,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:39" (1/1) ... [2025-03-16 14:52:39,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:39" (1/1) ... [2025-03-16 14:52:39,420 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:39" (1/1) ... [2025-03-16 14:52:39,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:39" (1/1) ... [2025-03-16 14:52:39,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:39" (1/1) ... [2025-03-16 14:52:39,438 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:39" (1/1) ... [2025-03-16 14:52:39,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:52:39,452 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:52:39,453 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:52:39,453 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:52:39,453 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:39" (1/1) ... [2025-03-16 14:52:39,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:52:39,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:39,515 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:52:39,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:52:39,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:52:39,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:52:39,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:52:39,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:52:39,585 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:52:39,587 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:52:40,658 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-16 14:52:40,658 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:52:40,673 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:52:40,675 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:52:40,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:52:40 BoogieIcfgContainer [2025-03-16 14:52:40,676 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:52:40,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:52:40,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:52:40,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:52:40,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:52:38" (1/3) ... [2025-03-16 14:52:40,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a005cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:52:40, skipping insertion in model container [2025-03-16 14:52:40,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:39" (2/3) ... [2025-03-16 14:52:40,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a005cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:52:40, skipping insertion in model container [2025-03-16 14:52:40,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:52:40" (3/3) ... [2025-03-16 14:52:40,683 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label56.c [2025-03-16 14:52:40,695 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:52:40,696 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label56.c that has 1 procedures, 222 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:52:40,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:52:40,754 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;@4c07c4a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:52:40,755 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:52:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 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-16 14:52:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 14:52:40,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:40,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:40,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:40,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:40,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1507601350, now seen corresponding path program 1 times [2025-03-16 14:52:40,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:40,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308528116] [2025-03-16 14:52:40,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:40,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:40,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 14:52:40,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 14:52:40,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:40,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:40,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:40,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308528116] [2025-03-16 14:52:40,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308528116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:40,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:40,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:40,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978002510] [2025-03-16 14:52:40,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:40,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:52:40,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:40,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:52:40,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:52:40,929 INFO L87 Difference]: Start difference. First operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 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 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-16 14:52:40,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:40,964 INFO L93 Difference]: Finished difference Result 443 states and 839 transitions. [2025-03-16 14:52:40,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:52:40,966 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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 40 [2025-03-16 14:52:40,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:40,972 INFO L225 Difference]: With dead ends: 443 [2025-03-16 14:52:40,972 INFO L226 Difference]: Without dead ends: 219 [2025-03-16 14:52:40,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:52:40,976 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:40,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:52:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-16 14:52:41,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-16 14:52:41,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 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-16 14:52:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2025-03-16 14:52:41,015 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 40 [2025-03-16 14:52:41,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:41,015 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2025-03-16 14:52:41,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-16 14:52:41,016 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2025-03-16 14:52:41,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 14:52:41,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:41,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:41,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:52:41,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:41,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:41,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1400703959, now seen corresponding path program 1 times [2025-03-16 14:52:41,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:41,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653813591] [2025-03-16 14:52:41,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:41,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:41,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 14:52:41,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 14:52:41,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:41,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:41,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:41,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:41,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653813591] [2025-03-16 14:52:41,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653813591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:41,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:41,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:41,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143765749] [2025-03-16 14:52:41,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:41,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:41,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:41,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:41,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:41,207 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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-16 14:52:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:41,955 INFO L93 Difference]: Finished difference Result 639 states and 1042 transitions. [2025-03-16 14:52:41,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:41,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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 40 [2025-03-16 14:52:41,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:41,957 INFO L225 Difference]: With dead ends: 639 [2025-03-16 14:52:41,957 INFO L226 Difference]: Without dead ends: 421 [2025-03-16 14:52:41,958 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-16 14:52:41,959 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 171 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 122 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.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:41,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 122 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:52:41,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-16 14:52:41,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 411. [2025-03-16 14:52:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.524390243902439) internal successors, (625), 410 states have internal predecessors, (625), 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-16 14:52:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 625 transitions. [2025-03-16 14:52:41,979 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 625 transitions. Word has length 40 [2025-03-16 14:52:41,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:41,979 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 625 transitions. [2025-03-16 14:52:41,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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-16 14:52:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 625 transitions. [2025-03-16 14:52:41,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 14:52:41,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:41,981 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:41,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:52:41,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:41,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:41,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1157868669, now seen corresponding path program 1 times [2025-03-16 14:52:41,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:41,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035575648] [2025-03-16 14:52:41,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:41,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:42,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 14:52:42,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 14:52:42,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:42,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:42,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:42,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035575648] [2025-03-16 14:52:42,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035575648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:42,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:42,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:42,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054385299] [2025-03-16 14:52:42,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:42,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:42,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:42,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:42,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:42,198 INFO L87 Difference]: Start difference. First operand 411 states and 625 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-16 14:52:42,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:42,841 INFO L93 Difference]: Finished difference Result 1198 states and 1828 transitions. [2025-03-16 14:52:42,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:42,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 106 [2025-03-16 14:52:42,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:42,848 INFO L225 Difference]: With dead ends: 1198 [2025-03-16 14:52:42,848 INFO L226 Difference]: Without dead ends: 788 [2025-03-16 14:52:42,849 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-16 14:52:42,850 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 156 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:42,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 175 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:42,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-03-16 14:52:42,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2025-03-16 14:52:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.3748411689961881) internal successors, (1082), 787 states have internal predecessors, (1082), 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-16 14:52:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1082 transitions. [2025-03-16 14:52:42,889 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1082 transitions. Word has length 106 [2025-03-16 14:52:42,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:42,890 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1082 transitions. [2025-03-16 14:52:42,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-16 14:52:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1082 transitions. [2025-03-16 14:52:42,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 14:52:42,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:42,893 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:42,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:52:42,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:42,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:42,895 INFO L85 PathProgramCache]: Analyzing trace with hash -652075193, now seen corresponding path program 1 times [2025-03-16 14:52:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:42,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742807782] [2025-03-16 14:52:42,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:42,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:42,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 14:52:42,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 14:52:42,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:42,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:43,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:43,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742807782] [2025-03-16 14:52:43,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742807782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:43,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:43,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:43,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546758508] [2025-03-16 14:52:43,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:43,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:43,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:43,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:43,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:43,166 INFO L87 Difference]: Start difference. First operand 788 states and 1082 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-16 14:52:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:43,866 INFO L93 Difference]: Finished difference Result 2313 states and 3180 transitions. [2025-03-16 14:52:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:43,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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 110 [2025-03-16 14:52:43,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:43,873 INFO L225 Difference]: With dead ends: 2313 [2025-03-16 14:52:43,873 INFO L226 Difference]: Without dead ends: 1526 [2025-03-16 14:52:43,875 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-16 14:52:43,877 INFO L435 NwaCegarLoop]: 168 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, 192 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.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:43,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 192 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:52:43,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2025-03-16 14:52:43,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1525. [2025-03-16 14:52:43,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 1.2171916010498687) internal successors, (1855), 1524 states have internal predecessors, (1855), 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-16 14:52:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1855 transitions. [2025-03-16 14:52:43,936 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1855 transitions. Word has length 110 [2025-03-16 14:52:43,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:43,937 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 1855 transitions. [2025-03-16 14:52:43,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-16 14:52:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1855 transitions. [2025-03-16 14:52:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-16 14:52:43,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:43,942 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:43,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:52:43,942 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:43,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:43,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1477740270, now seen corresponding path program 1 times [2025-03-16 14:52:43,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:43,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152167795] [2025-03-16 14:52:43,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:43,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:43,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 14:52:43,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 14:52:43,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:43,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:44,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:44,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152167795] [2025-03-16 14:52:44,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152167795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:44,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:44,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:44,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017394302] [2025-03-16 14:52:44,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:44,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:44,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:44,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:44,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:44,184 INFO L87 Difference]: Start difference. First operand 1525 states and 1855 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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-16 14:52:44,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:44,821 INFO L93 Difference]: Finished difference Result 3613 states and 4468 transitions. [2025-03-16 14:52:44,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:44,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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 167 [2025-03-16 14:52:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:44,829 INFO L225 Difference]: With dead ends: 3613 [2025-03-16 14:52:44,829 INFO L226 Difference]: Without dead ends: 2273 [2025-03-16 14:52:44,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:44,831 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 164 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:44,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 334 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:44,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2025-03-16 14:52:44,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 1896. [2025-03-16 14:52:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1895 states have (on average 1.2158311345646438) internal successors, (2304), 1895 states have internal predecessors, (2304), 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-16 14:52:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2304 transitions. [2025-03-16 14:52:44,863 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2304 transitions. Word has length 167 [2025-03-16 14:52:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:44,864 INFO L471 AbstractCegarLoop]: Abstraction has 1896 states and 2304 transitions. [2025-03-16 14:52:44,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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-16 14:52:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2304 transitions. [2025-03-16 14:52:44,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-16 14:52:44,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:44,869 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:44,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:52:44,869 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:44,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:44,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1523741494, now seen corresponding path program 1 times [2025-03-16 14:52:44,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:44,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10759335] [2025-03-16 14:52:44,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:44,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:44,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-16 14:52:44,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-16 14:52:44,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:44,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-16 14:52:45,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:45,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10759335] [2025-03-16 14:52:45,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10759335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:45,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:45,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:45,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304274956] [2025-03-16 14:52:45,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:45,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:45,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:45,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:45,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:45,142 INFO L87 Difference]: Start difference. First operand 1896 states and 2304 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-16 14:52:45,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:45,842 INFO L93 Difference]: Finished difference Result 4528 states and 5603 transitions. [2025-03-16 14:52:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:45,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 222 [2025-03-16 14:52:45,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:45,851 INFO L225 Difference]: With dead ends: 4528 [2025-03-16 14:52:45,851 INFO L226 Difference]: Without dead ends: 2448 [2025-03-16 14:52:45,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:45,854 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 181 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:45,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 322 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:52:45,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2025-03-16 14:52:45,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2448. [2025-03-16 14:52:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2448 states, 2447 states have (on average 1.2337556191254597) internal successors, (3019), 2447 states have internal predecessors, (3019), 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-16 14:52:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 3019 transitions. [2025-03-16 14:52:45,900 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 3019 transitions. Word has length 222 [2025-03-16 14:52:45,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:45,900 INFO L471 AbstractCegarLoop]: Abstraction has 2448 states and 3019 transitions. [2025-03-16 14:52:45,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-16 14:52:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 3019 transitions. [2025-03-16 14:52:45,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-16 14:52:45,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:45,907 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:45,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:52:45,907 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:45,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:45,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1700223853, now seen corresponding path program 1 times [2025-03-16 14:52:45,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:45,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148197147] [2025-03-16 14:52:45,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:45,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:45,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-16 14:52:45,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-16 14:52:45,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:45,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-16 14:52:46,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:46,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148197147] [2025-03-16 14:52:46,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148197147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:46,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:46,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:46,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058532727] [2025-03-16 14:52:46,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:46,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:46,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:46,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:46,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:46,158 INFO L87 Difference]: Start difference. First operand 2448 states and 3019 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-16 14:52:46,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:46,809 INFO L93 Difference]: Finished difference Result 5635 states and 7039 transitions. [2025-03-16 14:52:46,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:46,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 249 [2025-03-16 14:52:46,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:46,819 INFO L225 Difference]: With dead ends: 5635 [2025-03-16 14:52:46,819 INFO L226 Difference]: Without dead ends: 3188 [2025-03-16 14:52:46,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:46,822 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 156 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:46,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 380 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:46,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2025-03-16 14:52:46,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3183. [2025-03-16 14:52:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3183 states, 3182 states have (on average 1.2146448774355751) internal successors, (3865), 3182 states have internal predecessors, (3865), 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-16 14:52:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 3865 transitions. [2025-03-16 14:52:46,871 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 3865 transitions. Word has length 249 [2025-03-16 14:52:46,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:46,871 INFO L471 AbstractCegarLoop]: Abstraction has 3183 states and 3865 transitions. [2025-03-16 14:52:46,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-16 14:52:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 3865 transitions. [2025-03-16 14:52:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-16 14:52:46,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:46,875 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:46,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:52:46,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:46,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:46,875 INFO L85 PathProgramCache]: Analyzing trace with hash 924365754, now seen corresponding path program 1 times [2025-03-16 14:52:46,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:46,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775697207] [2025-03-16 14:52:46,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:46,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:46,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-16 14:52:46,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-16 14:52:46,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:46,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:47,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:47,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775697207] [2025-03-16 14:52:47,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775697207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:47,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:47,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:47,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963777821] [2025-03-16 14:52:47,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:47,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:47,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:47,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:47,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:47,222 INFO L87 Difference]: Start difference. First operand 3183 states and 3865 transitions. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 3 states have internal predecessors, (271), 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-16 14:52:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:48,311 INFO L93 Difference]: Finished difference Result 10427 states and 12956 transitions. [2025-03-16 14:52:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:48,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 3 states have internal predecessors, (271), 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 271 [2025-03-16 14:52:48,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:48,335 INFO L225 Difference]: With dead ends: 10427 [2025-03-16 14:52:48,336 INFO L226 Difference]: Without dead ends: 7244 [2025-03-16 14:52:48,339 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-16 14:52:48,340 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 223 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:48,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 123 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 14:52:48,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7244 states. [2025-03-16 14:52:48,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7244 to 7239. [2025-03-16 14:52:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7239 states, 7238 states have (on average 1.2113843603205305) internal successors, (8768), 7238 states have internal predecessors, (8768), 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-16 14:52:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7239 states to 7239 states and 8768 transitions. [2025-03-16 14:52:48,502 INFO L78 Accepts]: Start accepts. Automaton has 7239 states and 8768 transitions. Word has length 271 [2025-03-16 14:52:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:48,504 INFO L471 AbstractCegarLoop]: Abstraction has 7239 states and 8768 transitions. [2025-03-16 14:52:48,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 3 states have internal predecessors, (271), 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-16 14:52:48,504 INFO L276 IsEmpty]: Start isEmpty. Operand 7239 states and 8768 transitions. [2025-03-16 14:52:48,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-03-16 14:52:48,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:48,516 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:48,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:52:48,516 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:48,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:48,517 INFO L85 PathProgramCache]: Analyzing trace with hash 493217226, now seen corresponding path program 1 times [2025-03-16 14:52:48,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:48,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355760814] [2025-03-16 14:52:48,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:48,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:48,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-03-16 14:52:48,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-03-16 14:52:48,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:48,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:48,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:48,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355760814] [2025-03-16 14:52:48,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355760814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:48,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:48,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:48,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906960891] [2025-03-16 14:52:48,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:48,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:48,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:48,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:48,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:48,774 INFO L87 Difference]: Start difference. First operand 7239 states and 8768 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-16 14:52:49,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:49,418 INFO L93 Difference]: Finished difference Result 16895 states and 20631 transitions. [2025-03-16 14:52:49,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:49,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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 314 [2025-03-16 14:52:49,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:49,449 INFO L225 Difference]: With dead ends: 16895 [2025-03-16 14:52:49,450 INFO L226 Difference]: Without dead ends: 10026 [2025-03-16 14:52:49,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:49,459 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 85 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:49,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 367 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:49,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10026 states. [2025-03-16 14:52:49,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10026 to 10023. [2025-03-16 14:52:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10023 states, 10022 states have (on average 1.2144282578327679) internal successors, (12171), 10022 states have internal predecessors, (12171), 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-16 14:52:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10023 states to 10023 states and 12171 transitions. [2025-03-16 14:52:49,658 INFO L78 Accepts]: Start accepts. Automaton has 10023 states and 12171 transitions. Word has length 314 [2025-03-16 14:52:49,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:49,659 INFO L471 AbstractCegarLoop]: Abstraction has 10023 states and 12171 transitions. [2025-03-16 14:52:49,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-16 14:52:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 10023 states and 12171 transitions. [2025-03-16 14:52:49,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-16 14:52:49,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:49,668 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:49,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:52:49,668 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:49,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:49,669 INFO L85 PathProgramCache]: Analyzing trace with hash 356611370, now seen corresponding path program 1 times [2025-03-16 14:52:49,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:49,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887781664] [2025-03-16 14:52:49,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:49,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:49,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-16 14:52:49,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-16 14:52:49,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:49,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:49,967 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-03-16 14:52:49,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:49,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887781664] [2025-03-16 14:52:49,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887781664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:49,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:49,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:49,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337605] [2025-03-16 14:52:49,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:49,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:49,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:49,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:49,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:49,973 INFO L87 Difference]: Start difference. First operand 10023 states and 12171 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-16 14:52:50,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:50,670 INFO L93 Difference]: Finished difference Result 23731 states and 29193 transitions. [2025-03-16 14:52:50,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:50,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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 322 [2025-03-16 14:52:50,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:50,693 INFO L225 Difference]: With dead ends: 23731 [2025-03-16 14:52:50,693 INFO L226 Difference]: Without dead ends: 14078 [2025-03-16 14:52:50,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:50,705 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 192 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:50,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 98 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:50,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14078 states. [2025-03-16 14:52:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14078 to 14072. [2025-03-16 14:52:50,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14072 states, 14071 states have (on average 1.2237225499253785) internal successors, (17219), 14071 states have internal predecessors, (17219), 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-16 14:52:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14072 states to 14072 states and 17219 transitions. [2025-03-16 14:52:50,928 INFO L78 Accepts]: Start accepts. Automaton has 14072 states and 17219 transitions. Word has length 322 [2025-03-16 14:52:50,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:50,929 INFO L471 AbstractCegarLoop]: Abstraction has 14072 states and 17219 transitions. [2025-03-16 14:52:50,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-16 14:52:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 14072 states and 17219 transitions. [2025-03-16 14:52:50,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-16 14:52:50,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:50,938 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:50,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:52:50,939 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:50,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:50,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1105603952, now seen corresponding path program 1 times [2025-03-16 14:52:50,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:50,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201206476] [2025-03-16 14:52:50,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:50,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:50,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-16 14:52:51,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-16 14:52:51,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:51,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-16 14:52:51,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:51,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201206476] [2025-03-16 14:52:51,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201206476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:51,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:51,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:51,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335284901] [2025-03-16 14:52:51,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:51,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:51,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:51,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:51,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:51,228 INFO L87 Difference]: Start difference. First operand 14072 states and 17219 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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-16 14:52:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:51,915 INFO L93 Difference]: Finished difference Result 29805 states and 36747 transitions. [2025-03-16 14:52:51,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:51,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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 328 [2025-03-16 14:52:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:51,938 INFO L225 Difference]: With dead ends: 29805 [2025-03-16 14:52:51,938 INFO L226 Difference]: Without dead ends: 16103 [2025-03-16 14:52:51,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:51,950 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 181 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:51,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 158 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16103 states. [2025-03-16 14:52:52,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16103 to 14072. [2025-03-16 14:52:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14072 states, 14071 states have (on average 1.2237225499253785) internal successors, (17219), 14071 states have internal predecessors, (17219), 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-16 14:52:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14072 states to 14072 states and 17219 transitions. [2025-03-16 14:52:52,150 INFO L78 Accepts]: Start accepts. Automaton has 14072 states and 17219 transitions. Word has length 328 [2025-03-16 14:52:52,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:52,151 INFO L471 AbstractCegarLoop]: Abstraction has 14072 states and 17219 transitions. [2025-03-16 14:52:52,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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-16 14:52:52,151 INFO L276 IsEmpty]: Start isEmpty. Operand 14072 states and 17219 transitions. [2025-03-16 14:52:52,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-16 14:52:52,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:52,160 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, 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, 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] [2025-03-16 14:52:52,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:52:52,160 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:52,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:52,160 INFO L85 PathProgramCache]: Analyzing trace with hash 354866512, now seen corresponding path program 1 times [2025-03-16 14:52:52,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:52,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431759664] [2025-03-16 14:52:52,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:52,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:52,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-16 14:52:52,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-16 14:52:52,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:52,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-16 14:52:52,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:52,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431759664] [2025-03-16 14:52:52,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431759664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:52,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:52,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:52,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471045877] [2025-03-16 14:52:52,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:52,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:52,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:52,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:52,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:52,407 INFO L87 Difference]: Start difference. First operand 14072 states and 17219 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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-16 14:52:53,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:53,062 INFO L93 Difference]: Finished difference Result 30739 states and 37767 transitions. [2025-03-16 14:52:53,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:53,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 338 [2025-03-16 14:52:53,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:53,086 INFO L225 Difference]: With dead ends: 30739 [2025-03-16 14:52:53,086 INFO L226 Difference]: Without dead ends: 17037 [2025-03-16 14:52:53,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:53,100 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 139 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:53,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 112 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:53,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17037 states. [2025-03-16 14:52:53,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17037 to 17033. [2025-03-16 14:52:53,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17033 states, 17032 states have (on average 1.216416157820573) internal successors, (20718), 17032 states have internal predecessors, (20718), 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-16 14:52:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17033 states to 17033 states and 20718 transitions. [2025-03-16 14:52:53,340 INFO L78 Accepts]: Start accepts. Automaton has 17033 states and 20718 transitions. Word has length 338 [2025-03-16 14:52:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:53,340 INFO L471 AbstractCegarLoop]: Abstraction has 17033 states and 20718 transitions. [2025-03-16 14:52:53,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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-16 14:52:53,341 INFO L276 IsEmpty]: Start isEmpty. Operand 17033 states and 20718 transitions. [2025-03-16 14:52:53,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-16 14:52:53,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:53,353 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, 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, 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] [2025-03-16 14:52:53,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:52:53,353 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:53,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:53,354 INFO L85 PathProgramCache]: Analyzing trace with hash -812719649, now seen corresponding path program 1 times [2025-03-16 14:52:53,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:53,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28796075] [2025-03-16 14:52:53,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:53,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:53,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-16 14:52:53,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-16 14:52:53,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:53,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-16 14:52:53,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:53,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28796075] [2025-03-16 14:52:53,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28796075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:53,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:53,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:53,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241260865] [2025-03-16 14:52:53,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:53,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:53,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:53,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:53,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:53,528 INFO L87 Difference]: Start difference. First operand 17033 states and 20718 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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-16 14:52:54,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:54,141 INFO L93 Difference]: Finished difference Result 31640 states and 38567 transitions. [2025-03-16 14:52:54,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:54,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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 344 [2025-03-16 14:52:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:54,161 INFO L225 Difference]: With dead ends: 31640 [2025-03-16 14:52:54,161 INFO L226 Difference]: Without dead ends: 14977 [2025-03-16 14:52:54,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:54,174 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 136 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:54,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 144 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:52:54,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14977 states. [2025-03-16 14:52:54,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14977 to 12570. [2025-03-16 14:52:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12570 states, 12569 states have (on average 1.1497334712387621) internal successors, (14451), 12569 states have internal predecessors, (14451), 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-16 14:52:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12570 states to 12570 states and 14451 transitions. [2025-03-16 14:52:54,315 INFO L78 Accepts]: Start accepts. Automaton has 12570 states and 14451 transitions. Word has length 344 [2025-03-16 14:52:54,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:54,316 INFO L471 AbstractCegarLoop]: Abstraction has 12570 states and 14451 transitions. [2025-03-16 14:52:54,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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-16 14:52:54,316 INFO L276 IsEmpty]: Start isEmpty. Operand 12570 states and 14451 transitions. [2025-03-16 14:52:54,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-16 14:52:54,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:54,322 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, 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, 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] [2025-03-16 14:52:54,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:52:54,322 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:54,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:54,322 INFO L85 PathProgramCache]: Analyzing trace with hash -769721079, now seen corresponding path program 1 times [2025-03-16 14:52:54,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:54,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924141605] [2025-03-16 14:52:54,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:54,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:54,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-16 14:52:54,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-16 14:52:54,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:54,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:54,806 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:54,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:54,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924141605] [2025-03-16 14:52:54,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924141605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:54,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:54,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:52:54,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130932113] [2025-03-16 14:52:54,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:54,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:54,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:54,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:54,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:54,809 INFO L87 Difference]: Start difference. First operand 12570 states and 14451 transitions. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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-16 14:52:55,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:55,765 INFO L93 Difference]: Finished difference Result 28462 states and 32716 transitions. [2025-03-16 14:52:55,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:55,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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 348 [2025-03-16 14:52:55,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:55,784 INFO L225 Difference]: With dead ends: 28462 [2025-03-16 14:52:55,784 INFO L226 Difference]: Without dead ends: 16261 [2025-03-16 14:52:55,794 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-16 14:52:55,795 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 260 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:55,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 86 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 14:52:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16261 states. [2025-03-16 14:52:55,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16261 to 13862. [2025-03-16 14:52:55,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13862 states, 13861 states have (on average 1.1390953033691653) internal successors, (15789), 13861 states have internal predecessors, (15789), 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-16 14:52:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13862 states to 13862 states and 15789 transitions. [2025-03-16 14:52:55,937 INFO L78 Accepts]: Start accepts. Automaton has 13862 states and 15789 transitions. Word has length 348 [2025-03-16 14:52:55,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:55,937 INFO L471 AbstractCegarLoop]: Abstraction has 13862 states and 15789 transitions. [2025-03-16 14:52:55,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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-16 14:52:55,938 INFO L276 IsEmpty]: Start isEmpty. Operand 13862 states and 15789 transitions. [2025-03-16 14:52:55,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-16 14:52:55,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:55,944 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, 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, 2, 2, 2, 2, 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-16 14:52:55,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:52:55,945 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:55,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:55,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1916553619, now seen corresponding path program 1 times [2025-03-16 14:52:55,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:55,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265994105] [2025-03-16 14:52:55,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:55,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:55,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-16 14:52:55,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-16 14:52:55,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:55,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:56,271 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-16 14:52:56,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:56,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265994105] [2025-03-16 14:52:56,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265994105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:56,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:56,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:56,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868750748] [2025-03-16 14:52:56,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:56,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:56,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:56,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:56,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:56,273 INFO L87 Difference]: Start difference. First operand 13862 states and 15789 transitions. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 3 states have internal predecessors, (353), 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-16 14:52:56,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:56,900 INFO L93 Difference]: Finished difference Result 29383 states and 33432 transitions. [2025-03-16 14:52:56,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:56,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 3 states have internal predecessors, (353), 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 391 [2025-03-16 14:52:56,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:56,914 INFO L225 Difference]: With dead ends: 29383 [2025-03-16 14:52:56,914 INFO L226 Difference]: Without dead ends: 15154 [2025-03-16 14:52:56,922 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-16 14:52:56,922 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 207 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:56,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 164 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:56,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15154 states. [2025-03-16 14:52:57,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15154 to 14966. [2025-03-16 14:52:57,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14966 states, 14965 states have (on average 1.1247577681256264) internal successors, (16832), 14965 states have internal predecessors, (16832), 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-16 14:52:57,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14966 states to 14966 states and 16832 transitions. [2025-03-16 14:52:57,041 INFO L78 Accepts]: Start accepts. Automaton has 14966 states and 16832 transitions. Word has length 391 [2025-03-16 14:52:57,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:57,041 INFO L471 AbstractCegarLoop]: Abstraction has 14966 states and 16832 transitions. [2025-03-16 14:52:57,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 3 states have internal predecessors, (353), 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-16 14:52:57,042 INFO L276 IsEmpty]: Start isEmpty. Operand 14966 states and 16832 transitions. [2025-03-16 14:52:57,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-03-16 14:52:57,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:57,049 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:57,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:52:57,049 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:57,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:57,049 INFO L85 PathProgramCache]: Analyzing trace with hash -577888582, now seen corresponding path program 1 times [2025-03-16 14:52:57,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:57,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800185167] [2025-03-16 14:52:57,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:57,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:57,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-03-16 14:52:57,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-03-16 14:52:57,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:57,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-16 14:52:57,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:57,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800185167] [2025-03-16 14:52:57,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800185167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:57,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:57,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625871667] [2025-03-16 14:52:57,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:57,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:57,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:57,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:57,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:57,267 INFO L87 Difference]: Start difference. First operand 14966 states and 16832 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-16 14:52:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:57,782 INFO L93 Difference]: Finished difference Result 31402 states and 35335 transitions. [2025-03-16 14:52:57,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:57,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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 393 [2025-03-16 14:52:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:57,804 INFO L225 Difference]: With dead ends: 31402 [2025-03-16 14:52:57,804 INFO L226 Difference]: Without dead ends: 16805 [2025-03-16 14:52:57,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:57,818 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 177 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:57,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 139 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:52:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16805 states. [2025-03-16 14:52:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16805 to 10545. [2025-03-16 14:52:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10545 states, 10544 states have (on average 1.1315440060698028) internal successors, (11931), 10544 states have internal predecessors, (11931), 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-16 14:52:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10545 states to 10545 states and 11931 transitions. [2025-03-16 14:52:57,983 INFO L78 Accepts]: Start accepts. Automaton has 10545 states and 11931 transitions. Word has length 393 [2025-03-16 14:52:57,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:57,984 INFO L471 AbstractCegarLoop]: Abstraction has 10545 states and 11931 transitions. [2025-03-16 14:52:57,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-16 14:52:57,984 INFO L276 IsEmpty]: Start isEmpty. Operand 10545 states and 11931 transitions. [2025-03-16 14:52:57,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-03-16 14:52:57,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:57,993 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:57,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:52:57,993 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:57,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:57,994 INFO L85 PathProgramCache]: Analyzing trace with hash -374875892, now seen corresponding path program 1 times [2025-03-16 14:52:57,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:57,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896132798] [2025-03-16 14:52:57,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:57,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:58,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-16 14:52:58,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-16 14:52:58,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:58,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:58,285 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-16 14:52:58,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:58,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896132798] [2025-03-16 14:52:58,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896132798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:58,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:58,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:58,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930679755] [2025-03-16 14:52:58,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:58,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:58,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:58,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:58,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:58,288 INFO L87 Difference]: Start difference. First operand 10545 states and 11931 transitions. Second operand has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 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-16 14:52:59,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:59,073 INFO L93 Difference]: Finished difference Result 27364 states and 30899 transitions. [2025-03-16 14:52:59,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:59,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 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 412 [2025-03-16 14:52:59,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:59,089 INFO L225 Difference]: With dead ends: 27364 [2025-03-16 14:52:59,090 INFO L226 Difference]: Without dead ends: 17188 [2025-03-16 14:52:59,098 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-16 14:52:59,098 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 207 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:59,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 80 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:52:59,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17188 states. [2025-03-16 14:52:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17188 to 17003. [2025-03-16 14:52:59,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17003 states, 17002 states have (on average 1.122926714504176) internal successors, (19092), 17002 states have internal predecessors, (19092), 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-16 14:52:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17003 states to 17003 states and 19092 transitions. [2025-03-16 14:52:59,293 INFO L78 Accepts]: Start accepts. Automaton has 17003 states and 19092 transitions. Word has length 412 [2025-03-16 14:52:59,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:59,295 INFO L471 AbstractCegarLoop]: Abstraction has 17003 states and 19092 transitions. [2025-03-16 14:52:59,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 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-16 14:52:59,296 INFO L276 IsEmpty]: Start isEmpty. Operand 17003 states and 19092 transitions. [2025-03-16 14:52:59,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-03-16 14:52:59,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:59,310 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:59,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:52:59,310 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:59,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:59,310 INFO L85 PathProgramCache]: Analyzing trace with hash -633673546, now seen corresponding path program 1 times [2025-03-16 14:52:59,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:59,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948045349] [2025-03-16 14:52:59,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:59,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:59,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-16 14:52:59,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-16 14:52:59,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:59,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 456 proven. 34 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-03-16 14:52:59,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:59,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948045349] [2025-03-16 14:52:59,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948045349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:52:59,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815773673] [2025-03-16 14:52:59,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:59,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:59,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:59,807 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-16 14:52:59,808 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-16 14:52:59,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-16 14:52:59,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-16 14:52:59,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:59,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:59,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:52:59,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:53:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 490 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-03-16 14:53:00,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:53:00,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815773673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:00,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:53:00,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 14:53:00,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805422414] [2025-03-16 14:53:00,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:00,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:00,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:00,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:00,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:53:00,121 INFO L87 Difference]: Start difference. First operand 17003 states and 19092 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-16 14:53:00,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:00,662 INFO L93 Difference]: Finished difference Result 34202 states and 38478 transitions. [2025-03-16 14:53:00,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:00,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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 509 [2025-03-16 14:53:00,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:00,678 INFO L225 Difference]: With dead ends: 34202 [2025-03-16 14:53:00,678 INFO L226 Difference]: Without dead ends: 17568 [2025-03-16 14:53:00,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:53:00,689 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 86 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:00,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 74 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:53:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17568 states. [2025-03-16 14:53:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17568 to 17555. [2025-03-16 14:53:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17555 states, 17554 states have (on average 1.1219095362880256) internal successors, (19694), 17554 states have internal predecessors, (19694), 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-16 14:53:00,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17555 states to 17555 states and 19694 transitions. [2025-03-16 14:53:00,822 INFO L78 Accepts]: Start accepts. Automaton has 17555 states and 19694 transitions. Word has length 509 [2025-03-16 14:53:00,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:00,822 INFO L471 AbstractCegarLoop]: Abstraction has 17555 states and 19694 transitions. [2025-03-16 14:53:00,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-16 14:53:00,822 INFO L276 IsEmpty]: Start isEmpty. Operand 17555 states and 19694 transitions. [2025-03-16 14:53:00,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2025-03-16 14:53:00,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:00,833 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:00,840 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-16 14:53:01,037 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,SelfDestructingSolverStorable17 [2025-03-16 14:53:01,037 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:01,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:01,037 INFO L85 PathProgramCache]: Analyzing trace with hash -892528051, now seen corresponding path program 1 times [2025-03-16 14:53:01,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:01,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620971431] [2025-03-16 14:53:01,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:01,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:01,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes. [2025-03-16 14:53:01,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements. [2025-03-16 14:53:01,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:01,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-16 14:53:01,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:01,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620971431] [2025-03-16 14:53:01,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620971431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:01,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:01,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:01,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560675034] [2025-03-16 14:53:01,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:01,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:53:01,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:01,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:53:01,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:53:01,338 INFO L87 Difference]: Start difference. First operand 17555 states and 19694 transitions. Second operand has 4 states, 4 states have (on average 98.0) internal successors, (392), 3 states have internal predecessors, (392), 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-16 14:53:02,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:02,167 INFO L93 Difference]: Finished difference Result 41389 states and 46475 transitions. [2025-03-16 14:53:02,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:53:02,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 3 states have internal predecessors, (392), 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 510 [2025-03-16 14:53:02,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:02,193 INFO L225 Difference]: With dead ends: 41389 [2025-03-16 14:53:02,194 INFO L226 Difference]: Without dead ends: 23835 [2025-03-16 14:53:02,206 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-16 14:53:02,207 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 233 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:02,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 77 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:53:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23835 states. [2025-03-16 14:53:02,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23835 to 17929. [2025-03-16 14:53:02,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17929 states, 17928 states have (on average 1.1238844265952699) internal successors, (20149), 17928 states have internal predecessors, (20149), 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-16 14:53:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17929 states to 17929 states and 20149 transitions. [2025-03-16 14:53:02,418 INFO L78 Accepts]: Start accepts. Automaton has 17929 states and 20149 transitions. Word has length 510 [2025-03-16 14:53:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:02,419 INFO L471 AbstractCegarLoop]: Abstraction has 17929 states and 20149 transitions. [2025-03-16 14:53:02,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 3 states have internal predecessors, (392), 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-16 14:53:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 17929 states and 20149 transitions. [2025-03-16 14:53:02,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-03-16 14:53:02,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:02,431 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:02,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 14:53:02,431 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:02,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:02,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1417491585, now seen corresponding path program 1 times [2025-03-16 14:53:02,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:02,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876984912] [2025-03-16 14:53:02,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:02,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:02,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-16 14:53:02,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-16 14:53:02,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:02,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:02,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 877 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 14:53:02,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:02,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876984912] [2025-03-16 14:53:02,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876984912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:02,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:02,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:02,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072623318] [2025-03-16 14:53:02,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:02,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:02,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:02,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:02,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:02,778 INFO L87 Difference]: Start difference. First operand 17929 states and 20149 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-16 14:53:03,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:03,253 INFO L93 Difference]: Finished difference Result 37340 states and 41931 transitions. [2025-03-16 14:53:03,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:03,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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 606 [2025-03-16 14:53:03,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:03,270 INFO L225 Difference]: With dead ends: 37340 [2025-03-16 14:53:03,271 INFO L226 Difference]: Without dead ends: 19780 [2025-03-16 14:53:03,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:03,281 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 137 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:03,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 126 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:53:03,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19780 states. [2025-03-16 14:53:03,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19780 to 17745. [2025-03-16 14:53:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17745 states, 17744 states have (on average 1.123929215509468) internal successors, (19943), 17744 states have internal predecessors, (19943), 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-16 14:53:03,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17745 states to 17745 states and 19943 transitions. [2025-03-16 14:53:03,512 INFO L78 Accepts]: Start accepts. Automaton has 17745 states and 19943 transitions. Word has length 606 [2025-03-16 14:53:03,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:03,513 INFO L471 AbstractCegarLoop]: Abstraction has 17745 states and 19943 transitions. [2025-03-16 14:53:03,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-16 14:53:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 17745 states and 19943 transitions. [2025-03-16 14:53:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2025-03-16 14:53:03,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:03,531 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, 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:03,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 14:53:03,531 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:03,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:03,532 INFO L85 PathProgramCache]: Analyzing trace with hash -249372487, now seen corresponding path program 1 times [2025-03-16 14:53:03,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:03,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877129581] [2025-03-16 14:53:03,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:03,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:03,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 634 statements into 1 equivalence classes. [2025-03-16 14:53:03,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 634 of 634 statements. [2025-03-16 14:53:03,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:03,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:03,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 693 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2025-03-16 14:53:03,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:03,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877129581] [2025-03-16 14:53:03,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877129581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:03,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:03,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:03,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022002521] [2025-03-16 14:53:03,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:03,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:03,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:03,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:03,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:03,794 INFO L87 Difference]: Start difference. First operand 17745 states and 19943 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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-16 14:53:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:04,273 INFO L93 Difference]: Finished difference Result 36960 states and 41583 transitions. [2025-03-16 14:53:04,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:04,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 634 [2025-03-16 14:53:04,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:04,290 INFO L225 Difference]: With dead ends: 36960 [2025-03-16 14:53:04,290 INFO L226 Difference]: Without dead ends: 19584 [2025-03-16 14:53:04,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:04,301 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 65 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:04,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 345 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:53:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19584 states. [2025-03-16 14:53:04,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19584 to 16258. [2025-03-16 14:53:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16258 states, 16257 states have (on average 1.1198253060220213) internal successors, (18205), 16257 states have internal predecessors, (18205), 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-16 14:53:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16258 states to 16258 states and 18205 transitions. [2025-03-16 14:53:04,435 INFO L78 Accepts]: Start accepts. Automaton has 16258 states and 18205 transitions. Word has length 634 [2025-03-16 14:53:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:04,435 INFO L471 AbstractCegarLoop]: Abstraction has 16258 states and 18205 transitions. [2025-03-16 14:53:04,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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-16 14:53:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 16258 states and 18205 transitions. [2025-03-16 14:53:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-03-16 14:53:04,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:04,448 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:04,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 14:53:04,448 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:04,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:04,448 INFO L85 PathProgramCache]: Analyzing trace with hash 891279394, now seen corresponding path program 1 times [2025-03-16 14:53:04,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:04,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746560652] [2025-03-16 14:53:04,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:04,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:04,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-03-16 14:53:04,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-03-16 14:53:04,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:04,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 837 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-03-16 14:53:05,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:05,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746560652] [2025-03-16 14:53:05,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746560652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:05,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:05,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 14:53:05,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315279379] [2025-03-16 14:53:05,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:05,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 14:53:05,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:05,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 14:53:05,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:53:05,387 INFO L87 Difference]: Start difference. First operand 16258 states and 18205 transitions. Second operand has 7 states, 7 states have (on average 58.857142857142854) internal successors, (412), 6 states have internal predecessors, (412), 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-16 14:53:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:06,636 INFO L93 Difference]: Finished difference Result 38968 states and 43537 transitions. [2025-03-16 14:53:06,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 14:53:06,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 58.857142857142854) internal successors, (412), 6 states have internal predecessors, (412), 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 661 [2025-03-16 14:53:06,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:06,654 INFO L225 Difference]: With dead ends: 38968 [2025-03-16 14:53:06,654 INFO L226 Difference]: Without dead ends: 23079 [2025-03-16 14:53:06,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:53:06,661 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 214 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:06,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 210 Invalid, 2334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2304 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 14:53:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23079 states. [2025-03-16 14:53:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23079 to 23071. [2025-03-16 14:53:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23071 states, 23070 states have (on average 1.1136540962288686) internal successors, (25692), 23070 states have internal predecessors, (25692), 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-16 14:53:06,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23071 states to 23071 states and 25692 transitions. [2025-03-16 14:53:06,842 INFO L78 Accepts]: Start accepts. Automaton has 23071 states and 25692 transitions. Word has length 661 [2025-03-16 14:53:06,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:06,842 INFO L471 AbstractCegarLoop]: Abstraction has 23071 states and 25692 transitions. [2025-03-16 14:53:06,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 58.857142857142854) internal successors, (412), 6 states have internal predecessors, (412), 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-16 14:53:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 23071 states and 25692 transitions. [2025-03-16 14:53:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2025-03-16 14:53:06,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:06,856 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, 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, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:06,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 14:53:06,857 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:06,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:06,857 INFO L85 PathProgramCache]: Analyzing trace with hash -699125844, now seen corresponding path program 1 times [2025-03-16 14:53:06,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:06,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116414720] [2025-03-16 14:53:06,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:06,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:06,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-03-16 14:53:06,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-03-16 14:53:06,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:06,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 1119 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2025-03-16 14:53:07,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:07,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116414720] [2025-03-16 14:53:07,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116414720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:07,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:07,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:07,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078111936] [2025-03-16 14:53:07,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:07,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:07,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:07,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:07,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:07,246 INFO L87 Difference]: Start difference. First operand 23071 states and 25692 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-16 14:53:07,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:07,885 INFO L93 Difference]: Finished difference Result 48164 states and 53642 transitions. [2025-03-16 14:53:07,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:07,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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 669 [2025-03-16 14:53:07,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:07,918 INFO L225 Difference]: With dead ends: 48164 [2025-03-16 14:53:07,919 INFO L226 Difference]: Without dead ends: 25462 [2025-03-16 14:53:07,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:07,933 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 123 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:07,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 316 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:53:07,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25462 states. [2025-03-16 14:53:08,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25462 to 15705. [2025-03-16 14:53:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15705 states, 15704 states have (on average 1.1134742740703005) internal successors, (17486), 15704 states have internal predecessors, (17486), 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-16 14:53:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15705 states to 15705 states and 17486 transitions. [2025-03-16 14:53:08,104 INFO L78 Accepts]: Start accepts. Automaton has 15705 states and 17486 transitions. Word has length 669 [2025-03-16 14:53:08,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:08,104 INFO L471 AbstractCegarLoop]: Abstraction has 15705 states and 17486 transitions. [2025-03-16 14:53:08,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-16 14:53:08,104 INFO L276 IsEmpty]: Start isEmpty. Operand 15705 states and 17486 transitions. [2025-03-16 14:53:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2025-03-16 14:53:08,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:08,114 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:08,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 14:53:08,114 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:08,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:08,115 INFO L85 PathProgramCache]: Analyzing trace with hash -15543863, now seen corresponding path program 1 times [2025-03-16 14:53:08,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:08,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539381039] [2025-03-16 14:53:08,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:08,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:08,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-03-16 14:53:08,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-03-16 14:53:08,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:08,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 859 proven. 8 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-03-16 14:53:09,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:09,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539381039] [2025-03-16 14:53:09,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539381039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:53:09,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078872408] [2025-03-16 14:53:09,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:09,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:53:09,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:53:09,052 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-16 14:53:09,053 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-16 14:53:09,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-03-16 14:53:09,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-03-16 14:53:09,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:09,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:09,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 14:53:09,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:53:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 746 proven. 121 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-03-16 14:53:10,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:53:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 746 proven. 121 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-03-16 14:53:12,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078872408] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:53:12,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:53:12,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2025-03-16 14:53:12,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100507177] [2025-03-16 14:53:12,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:53:12,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 14:53:12,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:12,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 14:53:12,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:53:12,451 INFO L87 Difference]: Start difference. First operand 15705 states and 17486 transitions. Second operand has 11 states, 11 states have (on average 89.81818181818181) internal successors, (988), 10 states have internal predecessors, (988), 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-16 14:53:15,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:15,423 INFO L93 Difference]: Finished difference Result 38046 states and 42116 transitions. [2025-03-16 14:53:15,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 14:53:15,424 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 89.81818181818181) internal successors, (988), 10 states have internal predecessors, (988), 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 671 [2025-03-16 14:53:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:15,442 INFO L225 Difference]: With dead ends: 38046 [2025-03-16 14:53:15,442 INFO L226 Difference]: Without dead ends: 22523 [2025-03-16 14:53:15,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1364 GetRequests, 1339 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2025-03-16 14:53:15,453 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 1371 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 3944 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 4502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 558 IncrementalHoareTripleChecker+Valid, 3944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:15,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 163 Invalid, 4502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [558 Valid, 3944 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 14:53:15,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22523 states. [2025-03-16 14:53:15,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22523 to 14043. [2025-03-16 14:53:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14043 states, 14042 states have (on average 1.0786212790200826) internal successors, (15146), 14042 states have internal predecessors, (15146), 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-16 14:53:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14043 states to 14043 states and 15146 transitions. [2025-03-16 14:53:15,598 INFO L78 Accepts]: Start accepts. Automaton has 14043 states and 15146 transitions. Word has length 671 [2025-03-16 14:53:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:15,598 INFO L471 AbstractCegarLoop]: Abstraction has 14043 states and 15146 transitions. [2025-03-16 14:53:15,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.81818181818181) internal successors, (988), 10 states have internal predecessors, (988), 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-16 14:53:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 14043 states and 15146 transitions. [2025-03-16 14:53:15,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2025-03-16 14:53:15,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:15,606 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:15,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 14:53:15,806 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,SelfDestructingSolverStorable23 [2025-03-16 14:53:15,806 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:15,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:15,807 INFO L85 PathProgramCache]: Analyzing trace with hash -448112448, now seen corresponding path program 1 times [2025-03-16 14:53:15,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:15,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797651429] [2025-03-16 14:53:15,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:15,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:15,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 686 statements into 1 equivalence classes. [2025-03-16 14:53:15,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 686 of 686 statements. [2025-03-16 14:53:15,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:15,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:16,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 1039 proven. 64 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-03-16 14:53:16,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:16,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797651429] [2025-03-16 14:53:16,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797651429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:53:16,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655516939] [2025-03-16 14:53:16,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:16,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:53:16,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:53:16,335 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:53:16,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:53:16,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 686 statements into 1 equivalence classes. [2025-03-16 14:53:16,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 686 of 686 statements. [2025-03-16 14:53:16,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:16,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:16,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:53:16,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:53:16,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 1103 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-03-16 14:53:16,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:53:16,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655516939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:16,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:53:16,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:53:16,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124900730] [2025-03-16 14:53:16,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:16,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:16,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:16,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:16,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:53:16,620 INFO L87 Difference]: Start difference. First operand 14043 states and 15146 transitions. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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-16 14:53:17,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:17,107 INFO L93 Difference]: Finished difference Result 28464 states and 30699 transitions. [2025-03-16 14:53:17,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:17,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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 686 [2025-03-16 14:53:17,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:17,120 INFO L225 Difference]: With dead ends: 28464 [2025-03-16 14:53:17,120 INFO L226 Difference]: Without dead ends: 14790 [2025-03-16 14:53:17,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 685 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-16 14:53:17,129 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 78 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:17,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 336 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:53:17,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14790 states. [2025-03-16 14:53:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14790 to 13859. [2025-03-16 14:53:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13859 states, 13858 states have (on average 1.0772117188627508) internal successors, (14928), 13858 states have internal predecessors, (14928), 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-16 14:53:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13859 states to 13859 states and 14928 transitions. [2025-03-16 14:53:17,256 INFO L78 Accepts]: Start accepts. Automaton has 13859 states and 14928 transitions. Word has length 686 [2025-03-16 14:53:17,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:17,257 INFO L471 AbstractCegarLoop]: Abstraction has 13859 states and 14928 transitions. [2025-03-16 14:53:17,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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-16 14:53:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 13859 states and 14928 transitions. [2025-03-16 14:53:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-03-16 14:53:17,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:17,266 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, 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, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:17,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:53:17,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:53:17,467 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:17,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:17,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1167691270, now seen corresponding path program 1 times [2025-03-16 14:53:17,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:17,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10203074] [2025-03-16 14:53:17,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:17,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:17,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-16 14:53:17,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-16 14:53:17,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:17,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1607 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-03-16 14:53:17,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:17,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10203074] [2025-03-16 14:53:17,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10203074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:17,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:17,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:17,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156906930] [2025-03-16 14:53:17,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:17,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:17,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:17,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:17,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:17,905 INFO L87 Difference]: Start difference. First operand 13859 states and 14928 transitions. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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-16 14:53:18,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:18,394 INFO L93 Difference]: Finished difference Result 29018 states and 31263 transitions. [2025-03-16 14:53:18,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:18,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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 693 [2025-03-16 14:53:18,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:18,407 INFO L225 Difference]: With dead ends: 29018 [2025-03-16 14:53:18,407 INFO L226 Difference]: Without dead ends: 15528 [2025-03-16 14:53:18,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:18,416 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 133 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:18,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 106 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:53:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15528 states. [2025-03-16 14:53:18,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15528 to 13859. [2025-03-16 14:53:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13859 states, 13858 states have (on average 1.0772117188627508) internal successors, (14928), 13858 states have internal predecessors, (14928), 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-16 14:53:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13859 states to 13859 states and 14928 transitions. [2025-03-16 14:53:18,522 INFO L78 Accepts]: Start accepts. Automaton has 13859 states and 14928 transitions. Word has length 693 [2025-03-16 14:53:18,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:18,523 INFO L471 AbstractCegarLoop]: Abstraction has 13859 states and 14928 transitions. [2025-03-16 14:53:18,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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-16 14:53:18,523 INFO L276 IsEmpty]: Start isEmpty. Operand 13859 states and 14928 transitions. [2025-03-16 14:53:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-03-16 14:53:18,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:18,531 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, 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, 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:18,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 14:53:18,531 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:18,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:18,532 INFO L85 PathProgramCache]: Analyzing trace with hash 716570307, now seen corresponding path program 1 times [2025-03-16 14:53:18,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:18,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582629983] [2025-03-16 14:53:18,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:18,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:18,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-03-16 14:53:18,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-03-16 14:53:18,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:18,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1767 backedges. 1355 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-03-16 14:53:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582629983] [2025-03-16 14:53:19,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582629983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:19,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:19,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:53:19,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421110183] [2025-03-16 14:53:19,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:19,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:53:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:19,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:53:19,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:53:19,230 INFO L87 Difference]: Start difference. First operand 13859 states and 14928 transitions. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 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-16 14:53:19,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:19,932 INFO L93 Difference]: Finished difference Result 30867 states and 33238 transitions. [2025-03-16 14:53:19,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:53:19,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 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 729 [2025-03-16 14:53:19,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:19,950 INFO L225 Difference]: With dead ends: 30867 [2025-03-16 14:53:19,950 INFO L226 Difference]: Without dead ends: 17193 [2025-03-16 14:53:19,960 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-16 14:53:19,960 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 186 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:19,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 143 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:53:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2025-03-16 14:53:20,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 15706. [2025-03-16 14:53:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15706 states, 15705 states have (on average 1.0725246736708054) internal successors, (16844), 15705 states have internal predecessors, (16844), 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-16 14:53:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15706 states to 15706 states and 16844 transitions. [2025-03-16 14:53:20,124 INFO L78 Accepts]: Start accepts. Automaton has 15706 states and 16844 transitions. Word has length 729 [2025-03-16 14:53:20,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:20,124 INFO L471 AbstractCegarLoop]: Abstraction has 15706 states and 16844 transitions. [2025-03-16 14:53:20,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 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-16 14:53:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 15706 states and 16844 transitions. [2025-03-16 14:53:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2025-03-16 14:53:20,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:20,134 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:20,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 14:53:20,134 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:20,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:20,135 INFO L85 PathProgramCache]: Analyzing trace with hash 505367092, now seen corresponding path program 1 times [2025-03-16 14:53:20,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:20,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121024062] [2025-03-16 14:53:20,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:20,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:20,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 749 statements into 1 equivalence classes. [2025-03-16 14:53:20,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 749 of 749 statements. [2025-03-16 14:53:20,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:20,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:20,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 1292 proven. 0 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2025-03-16 14:53:20,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:20,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121024062] [2025-03-16 14:53:20,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121024062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:20,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:20,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:20,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808177529] [2025-03-16 14:53:20,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:20,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:20,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:20,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:20,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:20,528 INFO L87 Difference]: Start difference. First operand 15706 states and 16844 transitions. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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-16 14:53:21,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:21,058 INFO L93 Difference]: Finished difference Result 30487 states and 32697 transitions. [2025-03-16 14:53:21,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:21,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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 749 [2025-03-16 14:53:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:21,074 INFO L225 Difference]: With dead ends: 30487 [2025-03-16 14:53:21,074 INFO L226 Difference]: Without dead ends: 15150 [2025-03-16 14:53:21,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:21,084 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 70 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:21,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 270 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:53:21,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15150 states. [2025-03-16 14:53:21,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15150 to 13122. [2025-03-16 14:53:21,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13122 states, 13121 states have (on average 1.0671442725402027) internal successors, (14002), 13121 states have internal predecessors, (14002), 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-16 14:53:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13122 states to 13122 states and 14002 transitions. [2025-03-16 14:53:21,212 INFO L78 Accepts]: Start accepts. Automaton has 13122 states and 14002 transitions. Word has length 749 [2025-03-16 14:53:21,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:21,213 INFO L471 AbstractCegarLoop]: Abstraction has 13122 states and 14002 transitions. [2025-03-16 14:53:21,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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-16 14:53:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 13122 states and 14002 transitions. [2025-03-16 14:53:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2025-03-16 14:53:21,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:21,221 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2025-03-16 14:53:21,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 14:53:21,221 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:21,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:21,222 INFO L85 PathProgramCache]: Analyzing trace with hash 196431467, now seen corresponding path program 1 times [2025-03-16 14:53:21,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:21,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572530217] [2025-03-16 14:53:21,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:21,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:21,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 810 statements into 1 equivalence classes. [2025-03-16 14:53:21,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 810 of 810 statements. [2025-03-16 14:53:21,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:21,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1864 backedges. 1298 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2025-03-16 14:53:21,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:21,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572530217] [2025-03-16 14:53:21,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572530217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:21,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:21,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:21,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139633311] [2025-03-16 14:53:21,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:21,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:21,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:21,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:21,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:21,566 INFO L87 Difference]: Start difference. First operand 13122 states and 14002 transitions. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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-16 14:53:22,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:22,012 INFO L93 Difference]: Finished difference Result 26427 states and 28219 transitions. [2025-03-16 14:53:22,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:22,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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 810 [2025-03-16 14:53:22,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:22,026 INFO L225 Difference]: With dead ends: 26427 [2025-03-16 14:53:22,026 INFO L226 Difference]: Without dead ends: 13858 [2025-03-16 14:53:22,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:22,034 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 108 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:22,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 350 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:53:22,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13858 states. [2025-03-16 14:53:22,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13858 to 13490. [2025-03-16 14:53:22,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13490 states, 13489 states have (on average 1.066127956112388) internal successors, (14381), 13489 states have internal predecessors, (14381), 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-16 14:53:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13490 states to 13490 states and 14381 transitions. [2025-03-16 14:53:22,172 INFO L78 Accepts]: Start accepts. Automaton has 13490 states and 14381 transitions. Word has length 810 [2025-03-16 14:53:22,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:22,173 INFO L471 AbstractCegarLoop]: Abstraction has 13490 states and 14381 transitions. [2025-03-16 14:53:22,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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-16 14:53:22,173 INFO L276 IsEmpty]: Start isEmpty. Operand 13490 states and 14381 transitions. [2025-03-16 14:53:22,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2025-03-16 14:53:22,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:22,181 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:22,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 14:53:22,182 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:22,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:22,182 INFO L85 PathProgramCache]: Analyzing trace with hash 516702398, now seen corresponding path program 1 times [2025-03-16 14:53:22,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:22,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555582697] [2025-03-16 14:53:22,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:22,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:22,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes. [2025-03-16 14:53:22,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 839 of 839 statements. [2025-03-16 14:53:22,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:22,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 1585 proven. 0 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2025-03-16 14:53:22,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:22,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555582697] [2025-03-16 14:53:22,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555582697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:22,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:22,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:22,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260172467] [2025-03-16 14:53:22,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:22,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:22,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:22,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:22,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:22,467 INFO L87 Difference]: Start difference. First operand 13490 states and 14381 transitions. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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-16 14:53:22,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:22,928 INFO L93 Difference]: Finished difference Result 27350 states and 29175 transitions. [2025-03-16 14:53:22,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:22,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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 839 [2025-03-16 14:53:22,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:22,941 INFO L225 Difference]: With dead ends: 27350 [2025-03-16 14:53:22,941 INFO L226 Difference]: Without dead ends: 14229 [2025-03-16 14:53:22,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:22,949 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 115 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:22,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 328 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:53:22,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14229 states. [2025-03-16 14:53:23,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14229 to 13306. [2025-03-16 14:53:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13306 states, 13305 states have (on average 1.064261555806088) internal successors, (14160), 13305 states have internal predecessors, (14160), 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-16 14:53:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13306 states to 13306 states and 14160 transitions. [2025-03-16 14:53:23,060 INFO L78 Accepts]: Start accepts. Automaton has 13306 states and 14160 transitions. Word has length 839 [2025-03-16 14:53:23,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:23,061 INFO L471 AbstractCegarLoop]: Abstraction has 13306 states and 14160 transitions. [2025-03-16 14:53:23,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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-16 14:53:23,061 INFO L276 IsEmpty]: Start isEmpty. Operand 13306 states and 14160 transitions. [2025-03-16 14:53:23,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 865 [2025-03-16 14:53:23,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:23,070 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:23,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 14:53:23,070 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:23,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:23,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1359271924, now seen corresponding path program 1 times [2025-03-16 14:53:23,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:23,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213483845] [2025-03-16 14:53:23,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:23,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:23,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 864 statements into 1 equivalence classes. [2025-03-16 14:53:23,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 864 of 864 statements. [2025-03-16 14:53:23,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:23,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2529 backedges. 2006 proven. 0 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2025-03-16 14:53:23,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:23,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213483845] [2025-03-16 14:53:23,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213483845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:23,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:23,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:53:23,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735693484] [2025-03-16 14:53:23,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:23,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:53:23,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:23,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:53:23,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:53:23,726 INFO L87 Difference]: Start difference. First operand 13306 states and 14160 transitions. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 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-16 14:53:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:24,444 INFO L93 Difference]: Finished difference Result 29567 states and 31536 transitions. [2025-03-16 14:53:24,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:53:24,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 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 864 [2025-03-16 14:53:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:24,459 INFO L225 Difference]: With dead ends: 29567 [2025-03-16 14:53:24,459 INFO L226 Difference]: Without dead ends: 16814 [2025-03-16 14:53:24,466 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-16 14:53:24,467 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 190 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:24,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 89 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:53:24,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16814 states. [2025-03-16 14:53:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16814 to 15522. [2025-03-16 14:53:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15522 states, 15521 states have (on average 1.0671348495586626) internal successors, (16563), 15521 states have internal predecessors, (16563), 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-16 14:53:24,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15522 states to 15522 states and 16563 transitions. [2025-03-16 14:53:24,612 INFO L78 Accepts]: Start accepts. Automaton has 15522 states and 16563 transitions. Word has length 864 [2025-03-16 14:53:24,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:24,612 INFO L471 AbstractCegarLoop]: Abstraction has 15522 states and 16563 transitions. [2025-03-16 14:53:24,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 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-16 14:53:24,612 INFO L276 IsEmpty]: Start isEmpty. Operand 15522 states and 16563 transitions. [2025-03-16 14:53:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2025-03-16 14:53:24,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:24,621 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:24,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 14:53:24,621 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:24,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:24,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1281486138, now seen corresponding path program 1 times [2025-03-16 14:53:24,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:24,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350979498] [2025-03-16 14:53:24,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:24,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:24,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 871 statements into 1 equivalence classes. [2025-03-16 14:53:24,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 871 of 871 statements. [2025-03-16 14:53:24,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:24,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:25,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 1524 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-03-16 14:53:25,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:25,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350979498] [2025-03-16 14:53:25,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350979498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:25,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:25,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:53:25,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766525387] [2025-03-16 14:53:25,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:25,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:53:25,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:25,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:53:25,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:53:25,278 INFO L87 Difference]: Start difference. First operand 15522 states and 16563 transitions. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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-16 14:53:25,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:25,895 INFO L93 Difference]: Finished difference Result 25498 states and 27131 transitions. [2025-03-16 14:53:25,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:53:25,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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 871 [2025-03-16 14:53:25,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:25,897 INFO L225 Difference]: With dead ends: 25498 [2025-03-16 14:53:25,897 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:53:25,904 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-16 14:53:25,905 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 229 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:25,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 41 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:53:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:53:25,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:53:25,906 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-16 14:53:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:53:25,907 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 871 [2025-03-16 14:53:25,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:25,907 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:53:25,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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-16 14:53:25,907 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:53:25,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:53:25,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:53:25,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 14:53:25,912 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:25,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:53:34,111 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 724 DAG size of output: 983 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-16 14:53:37,059 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:53:37,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:53:37 BoogieIcfgContainer [2025-03-16 14:53:37,085 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:53:37,086 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:53:37,086 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:53:37,086 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:53:37,087 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:52:40" (3/4) ... [2025-03-16 14:53:37,089 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:53:37,111 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:53:37,111 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:53:37,112 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:53:37,113 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:53:37,247 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:53:37,247 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:53:37,247 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:53:37,250 INFO L158 Benchmark]: Toolchain (without parser) took 58541.38ms. Allocated memory was 167.8MB in the beginning and 696.3MB in the end (delta: 528.5MB). Free memory was 126.6MB in the beginning and 249.0MB in the end (delta: -122.4MB). Peak memory consumption was 404.6MB. Max. memory is 16.1GB. [2025-03-16 14:53:37,250 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:53:37,250 INFO L158 Benchmark]: CACSL2BoogieTranslator took 517.37ms. Allocated memory is still 167.8MB. Free memory was 126.6MB in the beginning and 83.3MB in the end (delta: 43.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 14:53:37,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.74ms. Allocated memory is still 167.8MB. Free memory was 83.3MB in the beginning and 66.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:53:37,250 INFO L158 Benchmark]: Boogie Preprocessor took 140.96ms. Allocated memory is still 167.8MB. Free memory was 66.5MB in the beginning and 42.9MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:53:37,250 INFO L158 Benchmark]: IcfgBuilder took 1223.80ms. Allocated memory is still 167.8MB. Free memory was 42.9MB in the beginning and 111.1MB in the end (delta: -68.2MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2025-03-16 14:53:37,250 INFO L158 Benchmark]: TraceAbstraction took 56407.91ms. Allocated memory was 167.8MB in the beginning and 696.3MB in the end (delta: 528.5MB). Free memory was 111.1MB in the beginning and 265.8MB in the end (delta: -154.7MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-03-16 14:53:37,250 INFO L158 Benchmark]: Witness Printer took 161.23ms. Allocated memory is still 696.3MB. Free memory was 265.8MB in the beginning and 249.0MB in the end (delta: 16.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:53:37,251 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.22ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 517.37ms. Allocated memory is still 167.8MB. Free memory was 126.6MB in the beginning and 83.3MB in the end (delta: 43.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.74ms. Allocated memory is still 167.8MB. Free memory was 83.3MB in the beginning and 66.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 140.96ms. Allocated memory is still 167.8MB. Free memory was 66.5MB in the beginning and 42.9MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1223.80ms. Allocated memory is still 167.8MB. Free memory was 42.9MB in the beginning and 111.1MB in the end (delta: -68.2MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * TraceAbstraction took 56407.91ms. Allocated memory was 167.8MB in the beginning and 696.3MB in the end (delta: 528.5MB). Free memory was 111.1MB in the beginning and 265.8MB in the end (delta: -154.7MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 161.23ms. Allocated memory is still 696.3MB. Free memory was 265.8MB in the beginning and 249.0MB in the end (delta: 16.8MB). Peak memory consumption was 8.4MB. 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: 139]: 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, 222 locations, 420 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.2s, OverallIterations: 32, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 23.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6092 SdHoareTripleChecker+Valid, 20.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6092 mSDsluCounter, 6328 SdHoareTripleChecker+Invalid, 16.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 950 mSDsCounter, 3461 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25415 IncrementalHoareTripleChecker+Invalid, 28876 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3461 mSolverCounterUnsat, 5378 mSDtfsCounter, 25415 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2660 GetRequests, 2584 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23071occurred in iteration=22, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 52104 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 16762 NumberOfCodeBlocks, 16762 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 17397 ConstructedInterpolants, 0 QuantifiedInterpolants, 52303 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2407 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 36 InterpolantComputations, 31 PerfectInterpolantSequences, 31781/32129 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: (((((((((((((((((((((((a29 <= 275) && (a25 == 12)) && (a4 == 0)) && (246 <= a29)) || ((((a29 <= 275) && (141 <= a29)) && (a4 == 1)) && (a25 <= 9))) || ((((((long long) a23 + 55) <= 0) && (a4 == 0)) && (((long long) 28470 + a29) <= 0)) && (a25 <= 9))) || (((a23 <= 138) && (a4 == 1)) && (130 <= a29))) || ((((((a25 == 13) && (a4 == 1)) && (a23 <= 312)) && (0 <= ((long long) a29 + 28553))) && (0 <= ((long long) a23 + 42))) && (a29 <= 130))) || (((((a23 <= 600000) && (307 <= a23)) && (a4 == 1)) && (246 <= a29)) && ((a25 != 12) || (a29 < 278)))) || (((((((long long) a23 + 55) <= 0) && (a4 == 0)) && ((140 < a29) || (a25 != 9))) && (a29 <= 220)) && (0 <= ((long long) a29 + 28553)))) || (((((((long long) a23 + 55) <= 0) && (a29 <= 275)) && (a25 == 12)) && (a4 == 0)) && (0 <= ((long long) a29 + 28553)))) || ((((((long long) a23 + 55) <= 0) && (a25 == 12)) && (a4 == 0)) && (((long long) a29 + 580291) <= 0))) || (((a23 <= 600000) && (a4 == 1)) && (a25 == 10))) || ((((a29 <= 275) && (141 <= a29)) && (a4 == 1)) && (a25 == 10))) || ((((a25 == 13) && (a23 <= 600000)) && (307 <= a23)) && (a4 == 1))) || (((a4 == 1) && (a25 <= 9)) && (a29 <= 130))) || (((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 275)) && (a4 == 0)) && (246 <= a29))) || ((((a25 == 13) && (a29 <= 240)) && (141 <= a29)) && (a4 == 1))) || ((((a25 == 12) && ((a23 < 307) || (a29 < 278))) && (a4 == 1)) && (a23 <= 312))) || (((a4 == 1) && (a23 <= 312)) && (a25 <= 9))) || ((((260 <= a29) && (((long long) a23 + 43) <= 0)) && (a4 == 0)) && (a25 <= 9))) || ((((a23 <= 600000) && (141 <= a29)) && (a29 <= 220)) && (a4 == 1))) || ((a23 <= 600000) && ((((a25 == 13) && (141 <= a29)) && (a4 == 1)) || (((a29 <= 275) && (a4 == 1)) && (246 <= a29))))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:53:37,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE