./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/Problem03_label45.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 e46cda06cd6f3e72cb5a00e680e37793de7d3fd440c55f6638f7eefc5d4b52af --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:01:56,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:01:56,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:01:56,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:01:56,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:01:56,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:01:56,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:01:56,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:01:56,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:01:56,460 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:01:56,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:01:56,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:01:56,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:01:56,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:01:56,461 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:01:56,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:01:56,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:01:56,462 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:01:56,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:01:56,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:01:56,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:01:56,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:01:56,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:01:56,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:01:56,462 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:01:56,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:01:56,462 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:01:56,462 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:01:56,462 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:01:56,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:01:56,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:01:56,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:01:56,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:01:56,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:01:56,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:01:56,463 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:01:56,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:01:56,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:01:56,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:01:56,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:01:56,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:01:56,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:01:56,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:01:56,463 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 -> e46cda06cd6f3e72cb5a00e680e37793de7d3fd440c55f6638f7eefc5d4b52af [2025-03-08 01:01:56,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:01:56,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:01:56,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:01:56,697 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:01:56,697 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:01:56,698 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label45.c [2025-03-08 01:01:57,808 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bfade268/2b33941a91fe48798b91b3784036dd17/FLAG3b666f8dd [2025-03-08 01:01:58,203 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:01:58,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label45.c [2025-03-08 01:01:58,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bfade268/2b33941a91fe48798b91b3784036dd17/FLAG3b666f8dd [2025-03-08 01:01:58,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bfade268/2b33941a91fe48798b91b3784036dd17 [2025-03-08 01:01:58,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:01:58,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:01:58,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:01:58,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:01:58,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:01:58,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:01:58" (1/1) ... [2025-03-08 01:01:58,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2208d006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:58, skipping insertion in model container [2025-03-08 01:01:58,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:01:58" (1/1) ... [2025-03-08 01:01:58,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:01:58,634 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/Problem03_label45.c[53653,53666] [2025-03-08 01:01:58,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:01:58,675 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:01:58,798 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/Problem03_label45.c[53653,53666] [2025-03-08 01:01:58,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:01:58,832 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:01:58,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:58 WrapperNode [2025-03-08 01:01:58,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:01:58,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:01:58,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:01:58,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:01:58,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:58" (1/1) ... [2025-03-08 01:01:58,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:58" (1/1) ... [2025-03-08 01:01:58,956 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-08 01:01:58,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:01:58,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:01:58,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:01:58,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:01:58,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:58" (1/1) ... [2025-03-08 01:01:58,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:58" (1/1) ... [2025-03-08 01:01:58,977 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:58" (1/1) ... [2025-03-08 01:01:59,012 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-08 01:01:59,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:58" (1/1) ... [2025-03-08 01:01:59,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:58" (1/1) ... [2025-03-08 01:01:59,053 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:58" (1/1) ... [2025-03-08 01:01:59,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:58" (1/1) ... [2025-03-08 01:01:59,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:58" (1/1) ... [2025-03-08 01:01:59,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:58" (1/1) ... [2025-03-08 01:01:59,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:01:59,083 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:01:59,083 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:01:59,083 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:01:59,085 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:58" (1/1) ... [2025-03-08 01:01:59,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:01:59,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:01:59,109 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-08 01:01:59,114 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-08 01:01:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:01:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:01:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:01:59,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:01:59,185 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:01:59,186 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:02:00,683 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-08 01:02:00,683 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:02:00,698 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:02:00,699 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:02:00,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:02:00 BoogieIcfgContainer [2025-03-08 01:02:00,699 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:02:00,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:02:00,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:02:00,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:02:00,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:01:58" (1/3) ... [2025-03-08 01:02:00,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aca49d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:02:00, skipping insertion in model container [2025-03-08 01:02:00,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:58" (2/3) ... [2025-03-08 01:02:00,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aca49d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:02:00, skipping insertion in model container [2025-03-08 01:02:00,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:02:00" (3/3) ... [2025-03-08 01:02:00,711 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label45.c [2025-03-08 01:02:00,722 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:02:00,725 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label45.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:02:00,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:02:00,784 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;@62e741da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:02:00,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:02:00,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 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-08 01:02:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 01:02:00,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:00,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:02:00,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:00,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:00,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1230407214, now seen corresponding path program 1 times [2025-03-08 01:02:00,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:00,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145232546] [2025-03-08 01:02:00,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:00,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:00,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 01:02:01,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 01:02:01,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:01,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:01,434 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-08 01:02:01,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:01,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145232546] [2025-03-08 01:02:01,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145232546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:01,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:01,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:01,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831472751] [2025-03-08 01:02:01,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:01,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:01,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:01,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:01,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:01,454 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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-08 01:02:02,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:02,334 INFO L93 Difference]: Finished difference Result 829 states and 1475 transitions. [2025-03-08 01:02:02,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:02,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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 144 [2025-03-08 01:02:02,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:02,344 INFO L225 Difference]: With dead ends: 829 [2025-03-08 01:02:02,344 INFO L226 Difference]: Without dead ends: 463 [2025-03-08 01:02:02,346 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-08 01:02:02,348 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 147 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:02,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 128 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:02:02,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-08 01:02:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2025-03-08 01:02:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.6183035714285714) internal successors, (725), 448 states have internal predecessors, (725), 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-08 01:02:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2025-03-08 01:02:02,397 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 144 [2025-03-08 01:02:02,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:02,398 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2025-03-08 01:02:02,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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-08 01:02:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2025-03-08 01:02:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 01:02:02,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:02,400 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:02:02,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:02:02,400 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:02,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:02,401 INFO L85 PathProgramCache]: Analyzing trace with hash 636106172, now seen corresponding path program 1 times [2025-03-08 01:02:02,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:02,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140070485] [2025-03-08 01:02:02,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:02,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:02,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 01:02:02,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 01:02:02,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:02,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:02:02,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:02,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140070485] [2025-03-08 01:02:02,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140070485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:02,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:02,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:02,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836718467] [2025-03-08 01:02:02,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:02,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:02,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:02,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:02,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:02,682 INFO L87 Difference]: Start difference. First operand 449 states and 725 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:02,901 INFO L93 Difference]: Finished difference Result 1342 states and 2170 transitions. [2025-03-08 01:02:02,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:02,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-03-08 01:02:02,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:02,906 INFO L225 Difference]: With dead ends: 1342 [2025-03-08 01:02:02,906 INFO L226 Difference]: Without dead ends: 895 [2025-03-08 01:02:02,907 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-08 01:02:02,909 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 366 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:02,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 596 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 01:02:02,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-08 01:02:02,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 893. [2025-03-08 01:02:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.6143497757847534) internal successors, (1440), 892 states have internal predecessors, (1440), 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-08 01:02:02,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1440 transitions. [2025-03-08 01:02:02,942 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1440 transitions. Word has length 149 [2025-03-08 01:02:02,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:02,942 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1440 transitions. [2025-03-08 01:02:02,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1440 transitions. [2025-03-08 01:02:02,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 01:02:02,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:02,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:02:02,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:02:02,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:02,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:02,949 INFO L85 PathProgramCache]: Analyzing trace with hash -602196585, now seen corresponding path program 1 times [2025-03-08 01:02:02,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:02,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336441079] [2025-03-08 01:02:02,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:02,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:02,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 01:02:03,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 01:02:03,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:03,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:03,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:02:03,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:03,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336441079] [2025-03-08 01:02:03,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336441079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:03,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:03,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:02:03,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871420437] [2025-03-08 01:02:03,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:03,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:03,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:03,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:03,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:03,121 INFO L87 Difference]: Start difference. First operand 893 states and 1440 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-08 01:02:03,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:03,732 INFO L93 Difference]: Finished difference Result 2623 states and 4239 transitions. [2025-03-08 01:02:03,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:03,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 151 [2025-03-08 01:02:03,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:03,742 INFO L225 Difference]: With dead ends: 2623 [2025-03-08 01:02:03,742 INFO L226 Difference]: Without dead ends: 1732 [2025-03-08 01:02:03,743 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-08 01:02:03,745 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 119 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:03,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 134 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:02:03,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2025-03-08 01:02:03,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1730. [2025-03-08 01:02:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1729 states have (on average 1.512434933487565) internal successors, (2615), 1729 states have internal predecessors, (2615), 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-08 01:02:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2615 transitions. [2025-03-08 01:02:03,791 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2615 transitions. Word has length 151 [2025-03-08 01:02:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:03,792 INFO L471 AbstractCegarLoop]: Abstraction has 1730 states and 2615 transitions. [2025-03-08 01:02:03,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-08 01:02:03,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2615 transitions. [2025-03-08 01:02:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 01:02:03,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:03,795 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:02:03,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:02:03,796 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:03,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:03,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1185310233, now seen corresponding path program 1 times [2025-03-08 01:02:03,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:03,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356778629] [2025-03-08 01:02:03,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:03,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:03,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 01:02:03,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 01:02:03,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:03,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:02:03,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:03,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356778629] [2025-03-08 01:02:03,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356778629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:03,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:03,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:03,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902849164] [2025-03-08 01:02:03,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:03,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:03,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:03,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:03,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:03,908 INFO L87 Difference]: Start difference. First operand 1730 states and 2615 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 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-08 01:02:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:04,205 INFO L93 Difference]: Finished difference Result 5158 states and 7807 transitions. [2025-03-08 01:02:04,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:04,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 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 158 [2025-03-08 01:02:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:04,215 INFO L225 Difference]: With dead ends: 5158 [2025-03-08 01:02:04,215 INFO L226 Difference]: Without dead ends: 3430 [2025-03-08 01:02:04,218 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-08 01:02:04,218 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 349 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:04,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 513 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:02:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2025-03-08 01:02:04,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 3426. [2025-03-08 01:02:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3426 states, 3425 states have (on average 1.5062773722627738) internal successors, (5159), 3425 states have internal predecessors, (5159), 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-08 01:02:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3426 states to 3426 states and 5159 transitions. [2025-03-08 01:02:04,306 INFO L78 Accepts]: Start accepts. Automaton has 3426 states and 5159 transitions. Word has length 158 [2025-03-08 01:02:04,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:04,306 INFO L471 AbstractCegarLoop]: Abstraction has 3426 states and 5159 transitions. [2025-03-08 01:02:04,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 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-08 01:02:04,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3426 states and 5159 transitions. [2025-03-08 01:02:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 01:02:04,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:04,313 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:02:04,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:02:04,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:04,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:04,315 INFO L85 PathProgramCache]: Analyzing trace with hash -779231733, now seen corresponding path program 1 times [2025-03-08 01:02:04,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:04,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981883662] [2025-03-08 01:02:04,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:04,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:04,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 01:02:04,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 01:02:04,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:04,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 01:02:04,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:04,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981883662] [2025-03-08 01:02:04,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981883662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:04,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:04,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:04,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092069983] [2025-03-08 01:02:04,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:04,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:04,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:04,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:04,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:04,534 INFO L87 Difference]: Start difference. First operand 3426 states and 5159 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 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-08 01:02:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:05,216 INFO L93 Difference]: Finished difference Result 8507 states and 12761 transitions. [2025-03-08 01:02:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:05,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 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 159 [2025-03-08 01:02:05,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:05,233 INFO L225 Difference]: With dead ends: 8507 [2025-03-08 01:02:05,233 INFO L226 Difference]: Without dead ends: 5083 [2025-03-08 01:02:05,237 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-08 01:02:05,240 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 234 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:05,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 114 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:02:05,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5083 states. [2025-03-08 01:02:05,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5083 to 5079. [2025-03-08 01:02:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5079 states, 5078 states have (on average 1.4714454509649468) internal successors, (7472), 5078 states have internal predecessors, (7472), 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-08 01:02:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5079 states to 5079 states and 7472 transitions. [2025-03-08 01:02:05,336 INFO L78 Accepts]: Start accepts. Automaton has 5079 states and 7472 transitions. Word has length 159 [2025-03-08 01:02:05,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:05,336 INFO L471 AbstractCegarLoop]: Abstraction has 5079 states and 7472 transitions. [2025-03-08 01:02:05,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 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-08 01:02:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 5079 states and 7472 transitions. [2025-03-08 01:02:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 01:02:05,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:05,343 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:02:05,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:02:05,343 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:05,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:05,344 INFO L85 PathProgramCache]: Analyzing trace with hash 508460966, now seen corresponding path program 1 times [2025-03-08 01:02:05,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:05,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712503439] [2025-03-08 01:02:05,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:05,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:05,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 01:02:05,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 01:02:05,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:05,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 01:02:05,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:05,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712503439] [2025-03-08 01:02:05,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712503439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:05,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:05,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:02:05,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580111618] [2025-03-08 01:02:05,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:05,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:05,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:05,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:05,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:05,456 INFO L87 Difference]: Start difference. First operand 5079 states and 7472 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-08 01:02:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:05,682 INFO L93 Difference]: Finished difference Result 15141 states and 22296 transitions. [2025-03-08 01:02:05,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:05,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 166 [2025-03-08 01:02:05,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:05,708 INFO L225 Difference]: With dead ends: 15141 [2025-03-08 01:02:05,708 INFO L226 Difference]: Without dead ends: 10064 [2025-03-08 01:02:05,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:05,718 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 359 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:05,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 585 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 01:02:05,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10064 states. [2025-03-08 01:02:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10064 to 10058. [2025-03-08 01:02:05,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10058 states, 10057 states have (on average 1.4721089788207218) internal successors, (14805), 10057 states have internal predecessors, (14805), 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-08 01:02:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10058 states to 10058 states and 14805 transitions. [2025-03-08 01:02:05,887 INFO L78 Accepts]: Start accepts. Automaton has 10058 states and 14805 transitions. Word has length 166 [2025-03-08 01:02:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:05,888 INFO L471 AbstractCegarLoop]: Abstraction has 10058 states and 14805 transitions. [2025-03-08 01:02:05,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-08 01:02:05,888 INFO L276 IsEmpty]: Start isEmpty. Operand 10058 states and 14805 transitions. [2025-03-08 01:02:05,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 01:02:05,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:05,897 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:02:05,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:02:05,897 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:05,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:05,898 INFO L85 PathProgramCache]: Analyzing trace with hash -956233100, now seen corresponding path program 1 times [2025-03-08 01:02:05,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:05,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761242967] [2025-03-08 01:02:05,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:05,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:05,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 01:02:05,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 01:02:05,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:05,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:06,667 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:02:06,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:06,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761242967] [2025-03-08 01:02:06,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761242967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:06,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869073624] [2025-03-08 01:02:06,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:06,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:06,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:06,670 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-08 01:02:06,671 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-08 01:02:06,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 01:02:06,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 01:02:06,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:06,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:06,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:02:06,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:02:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:02:06,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:02:06,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869073624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:06,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:02:06,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 01:02:06,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469891166] [2025-03-08 01:02:06,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:06,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:06,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:06,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:06,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:02:06,940 INFO L87 Difference]: Start difference. First operand 10058 states and 14805 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-08 01:02:07,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:07,702 INFO L93 Difference]: Finished difference Result 29874 states and 44020 transitions. [2025-03-08 01:02:07,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:07,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 182 [2025-03-08 01:02:07,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:07,747 INFO L225 Difference]: With dead ends: 29874 [2025-03-08 01:02:07,747 INFO L226 Difference]: Without dead ends: 19818 [2025-03-08 01:02:07,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:02:07,766 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 96 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:07,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 417 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:02:07,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19818 states. [2025-03-08 01:02:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19818 to 19802. [2025-03-08 01:02:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19802 states, 19801 states have (on average 1.3016009292459976) internal successors, (25773), 19801 states have internal predecessors, (25773), 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-08 01:02:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19802 states to 19802 states and 25773 transitions. [2025-03-08 01:02:08,096 INFO L78 Accepts]: Start accepts. Automaton has 19802 states and 25773 transitions. Word has length 182 [2025-03-08 01:02:08,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:08,096 INFO L471 AbstractCegarLoop]: Abstraction has 19802 states and 25773 transitions. [2025-03-08 01:02:08,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-08 01:02:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 19802 states and 25773 transitions. [2025-03-08 01:02:08,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 01:02:08,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:08,107 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:02:08,115 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-08 01:02:08,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:08,308 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:08,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:08,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2022931868, now seen corresponding path program 1 times [2025-03-08 01:02:08,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:08,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801180490] [2025-03-08 01:02:08,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:08,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:08,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 01:02:08,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 01:02:08,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:08,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 01:02:08,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:08,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801180490] [2025-03-08 01:02:08,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801180490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:08,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:08,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:08,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245349332] [2025-03-08 01:02:08,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:08,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:08,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:08,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:08,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:08,483 INFO L87 Difference]: Start difference. First operand 19802 states and 25773 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 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-08 01:02:09,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:09,209 INFO L93 Difference]: Finished difference Result 59146 states and 76981 transitions. [2025-03-08 01:02:09,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:09,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 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 182 [2025-03-08 01:02:09,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:09,287 INFO L225 Difference]: With dead ends: 59146 [2025-03-08 01:02:09,287 INFO L226 Difference]: Without dead ends: 39346 [2025-03-08 01:02:09,313 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-08 01:02:09,314 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 241 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:09,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 163 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:02:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39346 states. [2025-03-08 01:02:09,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39346 to 39328. [2025-03-08 01:02:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39328 states, 39327 states have (on average 1.2542273755943754) internal successors, (49325), 39327 states have internal predecessors, (49325), 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-08 01:02:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39328 states to 39328 states and 49325 transitions. [2025-03-08 01:02:09,882 INFO L78 Accepts]: Start accepts. Automaton has 39328 states and 49325 transitions. Word has length 182 [2025-03-08 01:02:09,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:09,882 INFO L471 AbstractCegarLoop]: Abstraction has 39328 states and 49325 transitions. [2025-03-08 01:02:09,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 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-08 01:02:09,882 INFO L276 IsEmpty]: Start isEmpty. Operand 39328 states and 49325 transitions. [2025-03-08 01:02:09,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 01:02:09,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:09,898 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:02:09,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:02:09,899 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:09,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:09,899 INFO L85 PathProgramCache]: Analyzing trace with hash 28547384, now seen corresponding path program 1 times [2025-03-08 01:02:09,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:09,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273088164] [2025-03-08 01:02:09,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:09,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:09,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 01:02:09,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 01:02:09,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:09,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:02:10,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:10,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273088164] [2025-03-08 01:02:10,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273088164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:10,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357651066] [2025-03-08 01:02:10,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:10,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:10,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:10,250 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-08 01:02:10,252 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-08 01:02:10,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 01:02:10,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 01:02:10,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:10,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:10,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:02:10,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:02:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:02:10,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:02:10,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357651066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:10,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:02:10,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 01:02:10,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52279942] [2025-03-08 01:02:10,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:10,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:10,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:10,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:10,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:10,503 INFO L87 Difference]: Start difference. First operand 39328 states and 49325 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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-08 01:02:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:11,382 INFO L93 Difference]: Finished difference Result 111264 states and 140108 transitions. [2025-03-08 01:02:11,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:11,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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 192 [2025-03-08 01:02:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:11,506 INFO L225 Difference]: With dead ends: 111264 [2025-03-08 01:02:11,506 INFO L226 Difference]: Without dead ends: 71938 [2025-03-08 01:02:11,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:11,550 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 101 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:11,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 187 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:02:11,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71938 states. [2025-03-08 01:02:12,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71938 to 59437. [2025-03-08 01:02:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59437 states, 59436 states have (on average 1.2910189110976513) internal successors, (76733), 59436 states have internal predecessors, (76733), 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-08 01:02:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59437 states to 59437 states and 76733 transitions. [2025-03-08 01:02:12,536 INFO L78 Accepts]: Start accepts. Automaton has 59437 states and 76733 transitions. Word has length 192 [2025-03-08 01:02:12,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:12,538 INFO L471 AbstractCegarLoop]: Abstraction has 59437 states and 76733 transitions. [2025-03-08 01:02:12,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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-08 01:02:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 59437 states and 76733 transitions. [2025-03-08 01:02:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 01:02:12,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:12,573 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:02:12,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 01:02:12,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 01:02:12,777 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:12,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:12,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1468629622, now seen corresponding path program 1 times [2025-03-08 01:02:12,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:12,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741176725] [2025-03-08 01:02:12,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:12,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:12,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 01:02:12,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 01:02:12,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:12,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 01:02:12,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:12,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741176725] [2025-03-08 01:02:12,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741176725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:12,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:12,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:12,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292426001] [2025-03-08 01:02:12,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:12,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:12,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:12,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:12,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:12,968 INFO L87 Difference]: Start difference. First operand 59437 states and 76733 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 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-08 01:02:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:14,107 INFO L93 Difference]: Finished difference Result 150134 states and 196388 transitions. [2025-03-08 01:02:14,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:14,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 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 211 [2025-03-08 01:02:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:14,242 INFO L225 Difference]: With dead ends: 150134 [2025-03-08 01:02:14,242 INFO L226 Difference]: Without dead ends: 90699 [2025-03-08 01:02:14,295 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-08 01:02:14,295 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 178 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:14,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 201 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:02:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90699 states. [2025-03-08 01:02:15,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90699 to 90699. [2025-03-08 01:02:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90699 states, 90698 states have (on average 1.2254294471763434) internal successors, (111144), 90698 states have internal predecessors, (111144), 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-08 01:02:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90699 states to 90699 states and 111144 transitions. [2025-03-08 01:02:15,355 INFO L78 Accepts]: Start accepts. Automaton has 90699 states and 111144 transitions. Word has length 211 [2025-03-08 01:02:15,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:15,356 INFO L471 AbstractCegarLoop]: Abstraction has 90699 states and 111144 transitions. [2025-03-08 01:02:15,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 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-08 01:02:15,356 INFO L276 IsEmpty]: Start isEmpty. Operand 90699 states and 111144 transitions. [2025-03-08 01:02:15,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 01:02:15,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:15,383 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:02:15,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 01:02:15,383 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:15,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:15,384 INFO L85 PathProgramCache]: Analyzing trace with hash 763042315, now seen corresponding path program 1 times [2025-03-08 01:02:15,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:15,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053907811] [2025-03-08 01:02:15,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:15,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:15,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 01:02:15,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 01:02:15,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:15,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-08 01:02:16,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:16,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053907811] [2025-03-08 01:02:16,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053907811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:16,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984885042] [2025-03-08 01:02:16,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:16,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:16,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:16,474 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-08 01:02:16,476 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-08 01:02:16,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 01:02:16,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 01:02:16,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:16,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:16,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 01:02:16,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:02:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-08 01:02:16,682 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:02:16,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984885042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:16,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:02:16,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-08 01:02:16,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882586154] [2025-03-08 01:02:16,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:16,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:16,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:16,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:16,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:02:16,685 INFO L87 Difference]: Start difference. First operand 90699 states and 111144 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 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-08 01:02:17,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:17,423 INFO L93 Difference]: Finished difference Result 171679 states and 209708 transitions. [2025-03-08 01:02:17,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:17,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 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 225 [2025-03-08 01:02:17,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:17,529 INFO L225 Difference]: With dead ends: 171679 [2025-03-08 01:02:17,529 INFO L226 Difference]: Without dead ends: 80982 [2025-03-08 01:02:17,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:02:17,598 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 308 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:17,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:02:17,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80982 states. [2025-03-08 01:02:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80982 to 80982. [2025-03-08 01:02:18,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80982 states, 80981 states have (on average 1.2048875662192366) internal successors, (97573), 80981 states have internal predecessors, (97573), 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-08 01:02:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80982 states to 80982 states and 97573 transitions. [2025-03-08 01:02:18,641 INFO L78 Accepts]: Start accepts. Automaton has 80982 states and 97573 transitions. Word has length 225 [2025-03-08 01:02:18,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:18,642 INFO L471 AbstractCegarLoop]: Abstraction has 80982 states and 97573 transitions. [2025-03-08 01:02:18,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 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-08 01:02:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 80982 states and 97573 transitions. [2025-03-08 01:02:18,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-08 01:02:18,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:18,660 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:02:18,667 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-08 01:02:18,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:18,860 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:18,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:18,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1821072091, now seen corresponding path program 1 times [2025-03-08 01:02:18,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:18,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027818465] [2025-03-08 01:02:18,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:18,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:18,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-08 01:02:18,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-08 01:02:18,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:18,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:02:19,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:19,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027818465] [2025-03-08 01:02:19,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027818465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:19,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:19,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:02:19,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333456020] [2025-03-08 01:02:19,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:19,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:19,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:19,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:19,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:19,220 INFO L87 Difference]: Start difference. First operand 80982 states and 97573 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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-08 01:02:20,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:20,283 INFO L93 Difference]: Finished difference Result 197549 states and 237852 transitions. [2025-03-08 01:02:20,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:20,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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 263 [2025-03-08 01:02:20,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:20,463 INFO L225 Difference]: With dead ends: 197549 [2025-03-08 01:02:20,463 INFO L226 Difference]: Without dead ends: 116569 [2025-03-08 01:02:20,527 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-08 01:02:20,527 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 220 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:20,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 326 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:02:20,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116569 states. [2025-03-08 01:02:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116569 to 116547. [2025-03-08 01:02:22,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116547 states, 116546 states have (on average 1.1775264702349286) internal successors, (137236), 116546 states have internal predecessors, (137236), 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-08 01:02:22,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116547 states to 116547 states and 137236 transitions. [2025-03-08 01:02:22,249 INFO L78 Accepts]: Start accepts. Automaton has 116547 states and 137236 transitions. Word has length 263 [2025-03-08 01:02:22,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:22,249 INFO L471 AbstractCegarLoop]: Abstraction has 116547 states and 137236 transitions. [2025-03-08 01:02:22,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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-08 01:02:22,250 INFO L276 IsEmpty]: Start isEmpty. Operand 116547 states and 137236 transitions. [2025-03-08 01:02:22,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-08 01:02:22,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:22,272 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:02:22,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 01:02:22,272 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:22,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:22,273 INFO L85 PathProgramCache]: Analyzing trace with hash 539936939, now seen corresponding path program 1 times [2025-03-08 01:02:22,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:22,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983346541] [2025-03-08 01:02:22,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:22,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:22,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-08 01:02:22,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-08 01:02:22,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:22,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 01:02:22,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:22,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983346541] [2025-03-08 01:02:22,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983346541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:22,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:22,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:02:22,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878575627] [2025-03-08 01:02:22,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:22,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:02:22,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:22,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:02:22,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:02:22,897 INFO L87 Difference]: Start difference. First operand 116547 states and 137236 transitions. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 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-08 01:02:24,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:24,365 INFO L93 Difference]: Finished difference Result 262397 states and 309159 transitions. [2025-03-08 01:02:24,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:02:24,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 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 269 [2025-03-08 01:02:24,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:24,563 INFO L225 Difference]: With dead ends: 262397 [2025-03-08 01:02:24,563 INFO L226 Difference]: Without dead ends: 145852 [2025-03-08 01:02:24,687 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-08 01:02:24,688 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 471 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:24,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 82 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 01:02:24,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145852 states. [2025-03-08 01:02:26,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145852 to 144561. [2025-03-08 01:02:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144561 states, 144560 states have (on average 1.1499792473713337) internal successors, (166241), 144560 states have internal predecessors, (166241), 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-08 01:02:27,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144561 states to 144561 states and 166241 transitions. [2025-03-08 01:02:27,062 INFO L78 Accepts]: Start accepts. Automaton has 144561 states and 166241 transitions. Word has length 269 [2025-03-08 01:02:27,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:27,062 INFO L471 AbstractCegarLoop]: Abstraction has 144561 states and 166241 transitions. [2025-03-08 01:02:27,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 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-08 01:02:27,063 INFO L276 IsEmpty]: Start isEmpty. Operand 144561 states and 166241 transitions. [2025-03-08 01:02:27,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-08 01:02:27,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:27,100 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:02:27,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 01:02:27,100 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:27,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:27,101 INFO L85 PathProgramCache]: Analyzing trace with hash 210482825, now seen corresponding path program 1 times [2025-03-08 01:02:27,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:27,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694070666] [2025-03-08 01:02:27,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:27,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:27,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 01:02:27,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 01:02:27,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:27,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 97 proven. 6 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-08 01:02:27,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:27,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694070666] [2025-03-08 01:02:27,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694070666] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:27,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121357344] [2025-03-08 01:02:27,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:27,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:27,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:27,685 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:02:27,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 01:02:27,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 01:02:27,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 01:02:27,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:27,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:27,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 01:02:27,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:02:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 01:02:27,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:02:27,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121357344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:27,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:02:27,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 01:02:27,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343204865] [2025-03-08 01:02:27,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:27,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:27,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:27,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:27,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:27,848 INFO L87 Difference]: Start difference. First operand 144561 states and 166241 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-08 01:02:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:28,974 INFO L93 Difference]: Finished difference Result 264601 states and 304342 transitions. [2025-03-08 01:02:28,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:28,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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 275 [2025-03-08 01:02:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:29,140 INFO L225 Difference]: With dead ends: 264601 [2025-03-08 01:02:29,140 INFO L226 Difference]: Without dead ends: 120042 [2025-03-08 01:02:29,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:29,209 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 210 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:29,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 353 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:02:29,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120042 states. [2025-03-08 01:02:30,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120042 to 119986. [2025-03-08 01:02:30,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119986 states, 119985 states have (on average 1.1348918614826853) internal successors, (136170), 119985 states have internal predecessors, (136170), 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-08 01:02:30,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119986 states to 119986 states and 136170 transitions. [2025-03-08 01:02:30,977 INFO L78 Accepts]: Start accepts. Automaton has 119986 states and 136170 transitions. Word has length 275 [2025-03-08 01:02:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:30,977 INFO L471 AbstractCegarLoop]: Abstraction has 119986 states and 136170 transitions. [2025-03-08 01:02:30,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-08 01:02:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 119986 states and 136170 transitions. [2025-03-08 01:02:31,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-08 01:02:31,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:31,010 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:02:31,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 01:02:31,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:31,211 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:31,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:31,211 INFO L85 PathProgramCache]: Analyzing trace with hash 81150719, now seen corresponding path program 1 times [2025-03-08 01:02:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:31,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831575584] [2025-03-08 01:02:31,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:31,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:31,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-08 01:02:31,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-08 01:02:31,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:31,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:31,438 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:02:31,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:31,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831575584] [2025-03-08 01:02:31,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831575584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:31,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:31,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:02:31,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456555960] [2025-03-08 01:02:31,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:31,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:31,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:31,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:31,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:31,441 INFO L87 Difference]: Start difference. First operand 119986 states and 136170 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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-08 01:02:32,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:32,568 INFO L93 Difference]: Finished difference Result 229817 states and 260305 transitions. [2025-03-08 01:02:32,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:32,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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 291 [2025-03-08 01:02:32,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:32,713 INFO L225 Difference]: With dead ends: 229817 [2025-03-08 01:02:32,713 INFO L226 Difference]: Without dead ends: 109833 [2025-03-08 01:02:32,799 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-08 01:02:32,799 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 107 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:32,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 306 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:02:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109833 states. [2025-03-08 01:02:34,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109833 to 108599. [2025-03-08 01:02:34,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108599 states, 108598 states have (on average 1.1061621760990072) internal successors, (120127), 108598 states have internal predecessors, (120127), 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-08 01:02:34,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108599 states to 108599 states and 120127 transitions. [2025-03-08 01:02:34,453 INFO L78 Accepts]: Start accepts. Automaton has 108599 states and 120127 transitions. Word has length 291 [2025-03-08 01:02:34,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:34,454 INFO L471 AbstractCegarLoop]: Abstraction has 108599 states and 120127 transitions. [2025-03-08 01:02:34,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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-08 01:02:34,454 INFO L276 IsEmpty]: Start isEmpty. Operand 108599 states and 120127 transitions. [2025-03-08 01:02:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-03-08 01:02:34,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:34,510 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 01:02:34,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 01:02:34,510 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:34,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:34,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1554728713, now seen corresponding path program 1 times [2025-03-08 01:02:34,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:34,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251199666] [2025-03-08 01:02:34,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:34,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:34,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-03-08 01:02:34,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-03-08 01:02:34,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:34,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:35,001 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-03-08 01:02:35,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:35,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251199666] [2025-03-08 01:02:35,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251199666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:35,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:35,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:02:35,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723768840] [2025-03-08 01:02:35,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:35,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:35,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:35,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:35,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:35,003 INFO L87 Difference]: Start difference. First operand 108599 states and 120127 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 2 states have internal predecessors, (270), 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-08 01:02:36,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:36,526 INFO L93 Difference]: Finished difference Result 319892 states and 353830 transitions. [2025-03-08 01:02:36,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:36,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 2 states have internal predecessors, (270), 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-08 01:02:36,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:36,831 INFO L225 Difference]: With dead ends: 319892 [2025-03-08 01:02:36,831 INFO L226 Difference]: Without dead ends: 211295 [2025-03-08 01:02:36,879 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-08 01:02:36,880 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 211 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:36,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 529 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 01:02:37,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211295 states. [2025-03-08 01:02:39,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211295 to 211291. [2025-03-08 01:02:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211291 states, 211290 states have (on average 1.1058876425765536) internal successors, (233663), 211290 states have internal predecessors, (233663), 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-08 01:02:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211291 states to 211291 states and 233663 transitions. [2025-03-08 01:02:39,872 INFO L78 Accepts]: Start accepts. Automaton has 211291 states and 233663 transitions. Word has length 393 [2025-03-08 01:02:39,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:39,872 INFO L471 AbstractCegarLoop]: Abstraction has 211291 states and 233663 transitions. [2025-03-08 01:02:39,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 2 states have internal predecessors, (270), 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-08 01:02:39,872 INFO L276 IsEmpty]: Start isEmpty. Operand 211291 states and 233663 transitions. [2025-03-08 01:02:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-08 01:02:39,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:39,943 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2025-03-08 01:02:39,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 01:02:39,943 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:39,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:39,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1714675383, now seen corresponding path program 1 times [2025-03-08 01:02:39,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:39,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340322258] [2025-03-08 01:02:39,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:39,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:40,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-08 01:02:40,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-08 01:02:40,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:40,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-03-08 01:02:40,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:40,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340322258] [2025-03-08 01:02:40,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340322258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:40,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:40,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:02:40,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004191637] [2025-03-08 01:02:40,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:40,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:40,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:40,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:40,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:40,659 INFO L87 Difference]: Start difference. First operand 211291 states and 233663 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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-08 01:02:42,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:42,442 INFO L93 Difference]: Finished difference Result 434034 states and 480024 transitions. [2025-03-08 01:02:42,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:42,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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 414 [2025-03-08 01:02:42,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:42,784 INFO L225 Difference]: With dead ends: 434034 [2025-03-08 01:02:42,784 INFO L226 Difference]: Without dead ends: 222745 [2025-03-08 01:02:42,861 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-08 01:02:42,861 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 87 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:42,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 330 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:02:43,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222745 states. [2025-03-08 01:02:45,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222745 to 151347. [2025-03-08 01:02:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151347 states, 151346 states have (on average 1.1024870165052265) internal successors, (166857), 151346 states have internal predecessors, (166857), 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-08 01:02:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151347 states to 151347 states and 166857 transitions. [2025-03-08 01:02:45,487 INFO L78 Accepts]: Start accepts. Automaton has 151347 states and 166857 transitions. Word has length 414 [2025-03-08 01:02:45,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:45,487 INFO L471 AbstractCegarLoop]: Abstraction has 151347 states and 166857 transitions. [2025-03-08 01:02:45,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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-08 01:02:45,487 INFO L276 IsEmpty]: Start isEmpty. Operand 151347 states and 166857 transitions. [2025-03-08 01:02:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-08 01:02:45,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:45,533 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:02:45,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 01:02:45,534 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:45,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:45,534 INFO L85 PathProgramCache]: Analyzing trace with hash 429256359, now seen corresponding path program 1 times [2025-03-08 01:02:45,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:45,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285564889] [2025-03-08 01:02:45,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:45,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:45,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-08 01:02:45,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-08 01:02:45,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:45,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat