./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.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/bitvector/s3_srvr_1a.BV.c.cil.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 a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:53:18,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:53:18,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:53:18,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:53:18,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:53:18,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:53:18,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:53:18,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:53:18,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:53:18,329 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:53:18,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:53:18,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:53:18,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:53:18,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:53:18,330 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:53:18,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:53:18,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:53:18,330 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:53:18,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:53:18,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:53:18,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:53:18,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:53:18,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:53:18,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:53:18,335 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:53:18,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:53:18,335 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:53:18,335 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:53:18,335 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:53:18,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:53:18,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:53:18,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:53:18,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:53:18,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:53:18,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:53:18,335 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:53:18,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:53:18,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:53:18,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:53:18,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:53:18,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:53:18,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:53:18,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:53:18,335 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 -> a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f [2025-03-08 00:53:18,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:53:18,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:53:18,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:53:18,602 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:53:18,602 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:53:18,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2025-03-08 00:53:19,828 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94e31ffe7/15c7d0423f8a437a9d6615818785a335/FLAGea750d439 [2025-03-08 00:53:20,054 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:53:20,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2025-03-08 00:53:20,068 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94e31ffe7/15c7d0423f8a437a9d6615818785a335/FLAGea750d439 [2025-03-08 00:53:20,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94e31ffe7/15c7d0423f8a437a9d6615818785a335 [2025-03-08 00:53:20,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:53:20,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:53:20,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:53:20,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:53:20,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:53:20,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:53:20" (1/1) ... [2025-03-08 00:53:20,388 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99c01a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:20, skipping insertion in model container [2025-03-08 00:53:20,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:53:20" (1/1) ... [2025-03-08 00:53:20,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:53:20,583 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/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2025-03-08 00:53:20,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:53:20,599 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:53:20,645 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/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2025-03-08 00:53:20,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:53:20,659 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:53:20,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:20 WrapperNode [2025-03-08 00:53:20,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:53:20,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:53:20,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:53:20,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:53:20,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:20" (1/1) ... [2025-03-08 00:53:20,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:20" (1/1) ... [2025-03-08 00:53:20,702 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 641 [2025-03-08 00:53:20,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:53:20,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:53:20,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:53:20,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:53:20,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:20" (1/1) ... [2025-03-08 00:53:20,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:20" (1/1) ... [2025-03-08 00:53:20,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:20" (1/1) ... [2025-03-08 00:53:20,738 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 00:53:20,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:20" (1/1) ... [2025-03-08 00:53:20,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:20" (1/1) ... [2025-03-08 00:53:20,751 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:20" (1/1) ... [2025-03-08 00:53:20,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:20" (1/1) ... [2025-03-08 00:53:20,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:20" (1/1) ... [2025-03-08 00:53:20,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:20" (1/1) ... [2025-03-08 00:53:20,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:53:20,760 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:53:20,761 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:53:20,761 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:53:20,761 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:20" (1/1) ... [2025-03-08 00:53:20,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:53:20,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:20,804 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 00:53:20,810 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 00:53:20,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:53:20,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:53:20,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:53:20,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:53:20,894 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:53:20,895 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:53:21,367 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L219: assume false; [2025-03-08 00:53:21,369 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L219: assume !false; [2025-03-08 00:53:21,395 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-08 00:53:21,395 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:53:21,423 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:53:21,423 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:53:21,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:21 BoogieIcfgContainer [2025-03-08 00:53:21,423 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:53:21,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:53:21,425 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:53:21,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:53:21,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:53:20" (1/3) ... [2025-03-08 00:53:21,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542647a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:53:21, skipping insertion in model container [2025-03-08 00:53:21,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:20" (2/3) ... [2025-03-08 00:53:21,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542647a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:53:21, skipping insertion in model container [2025-03-08 00:53:21,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:21" (3/3) ... [2025-03-08 00:53:21,430 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2025-03-08 00:53:21,441 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:53:21,442 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_srvr_1a.BV.c.cil.c that has 1 procedures, 169 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 00:53:21,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:53:21,503 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;@2c0cdc1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:53:21,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:53:21,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 167 states have (on average 1.718562874251497) internal successors, (287), 168 states have internal predecessors, (287), 0 states have call successors, (0), 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 00:53:21,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:53:21,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:21,516 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] [2025-03-08 00:53:21,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:21,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:21,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2044672607, now seen corresponding path program 1 times [2025-03-08 00:53:21,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:21,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772031210] [2025-03-08 00:53:21,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:21,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:21,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 00:53:21,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:53:21,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:21,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:21,835 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 00:53:21,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:21,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772031210] [2025-03-08 00:53:21,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772031210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:21,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:21,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:21,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395287841] [2025-03-08 00:53:21,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:21,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:21,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:21,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:21,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:21,854 INFO L87 Difference]: Start difference. First operand has 169 states, 167 states have (on average 1.718562874251497) internal successors, (287), 168 states have internal predecessors, (287), 0 states have call successors, (0), 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 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 00:53:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:22,064 INFO L93 Difference]: Finished difference Result 370 states and 638 transitions. [2025-03-08 00:53:22,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:22,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-08 00:53:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:22,074 INFO L225 Difference]: With dead ends: 370 [2025-03-08 00:53:22,074 INFO L226 Difference]: Without dead ends: 196 [2025-03-08 00:53:22,077 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 00:53:22,079 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 58 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:22,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 340 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:53:22,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-08 00:53:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-03-08 00:53:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.6512820512820512) internal successors, (322), 195 states have internal predecessors, (322), 0 states have call successors, (0), 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 00:53:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 322 transitions. [2025-03-08 00:53:22,124 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 322 transitions. Word has length 44 [2025-03-08 00:53:22,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:22,124 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 322 transitions. [2025-03-08 00:53:22,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 00:53:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 322 transitions. [2025-03-08 00:53:22,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 00:53:22,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:22,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:22,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:53:22,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:22,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:22,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1047557553, now seen corresponding path program 1 times [2025-03-08 00:53:22,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:22,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396939691] [2025-03-08 00:53:22,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:22,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:22,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 00:53:22,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:53:22,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:22,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:22,258 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 00:53:22,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:22,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396939691] [2025-03-08 00:53:22,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396939691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:22,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:22,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:22,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942588640] [2025-03-08 00:53:22,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:22,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:22,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:22,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:22,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:22,260 INFO L87 Difference]: Start difference. First operand 196 states and 322 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 00:53:22,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:22,469 INFO L93 Difference]: Finished difference Result 420 states and 702 transitions. [2025-03-08 00:53:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:22,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-08 00:53:22,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:22,471 INFO L225 Difference]: With dead ends: 420 [2025-03-08 00:53:22,471 INFO L226 Difference]: Without dead ends: 236 [2025-03-08 00:53:22,472 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 00:53:22,473 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 47 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:22,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 269 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:53:22,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-08 00:53:22,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-03-08 00:53:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.6936170212765957) internal successors, (398), 235 states have internal predecessors, (398), 0 states have call successors, (0), 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 00:53:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 398 transitions. [2025-03-08 00:53:22,487 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 398 transitions. Word has length 45 [2025-03-08 00:53:22,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:22,487 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 398 transitions. [2025-03-08 00:53:22,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 00:53:22,488 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 398 transitions. [2025-03-08 00:53:22,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 00:53:22,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:22,491 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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 00:53:22,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:53:22,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:22,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2009527219, now seen corresponding path program 1 times [2025-03-08 00:53:22,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:22,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147202074] [2025-03-08 00:53:22,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:22,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:22,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 00:53:22,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 00:53:22,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:22,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:53:22,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:22,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147202074] [2025-03-08 00:53:22,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147202074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:22,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:22,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:22,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642806540] [2025-03-08 00:53:22,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:22,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:22,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:22,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:22,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:22,610 INFO L87 Difference]: Start difference. First operand 236 states and 398 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 00:53:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:22,729 INFO L93 Difference]: Finished difference Result 475 states and 805 transitions. [2025-03-08 00:53:22,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:22,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 72 [2025-03-08 00:53:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:22,731 INFO L225 Difference]: With dead ends: 475 [2025-03-08 00:53:22,731 INFO L226 Difference]: Without dead ends: 253 [2025-03-08 00:53:22,732 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 00:53:22,732 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 26 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:22,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 355 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-08 00:53:22,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-03-08 00:53:22,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.6666666666666667) internal successors, (420), 252 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 420 transitions. [2025-03-08 00:53:22,760 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 420 transitions. Word has length 72 [2025-03-08 00:53:22,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:22,761 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 420 transitions. [2025-03-08 00:53:22,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 00:53:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 420 transitions. [2025-03-08 00:53:22,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 00:53:22,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:22,764 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:22,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:53:22,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:22,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:22,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1038391665, now seen corresponding path program 1 times [2025-03-08 00:53:22,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:22,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284792749] [2025-03-08 00:53:22,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:22,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:22,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 00:53:22,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 00:53:22,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:22,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:53:22,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:22,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284792749] [2025-03-08 00:53:22,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284792749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:22,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:22,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:22,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597113445] [2025-03-08 00:53:22,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:22,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:22,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:22,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:22,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:22,813 INFO L87 Difference]: Start difference. First operand 253 states and 420 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 00:53:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:22,945 INFO L93 Difference]: Finished difference Result 512 states and 855 transitions. [2025-03-08 00:53:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:22,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 87 [2025-03-08 00:53:22,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:22,947 INFO L225 Difference]: With dead ends: 512 [2025-03-08 00:53:22,948 INFO L226 Difference]: Without dead ends: 273 [2025-03-08 00:53:22,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:22,951 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 9 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:22,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 367 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:22,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-08 00:53:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-03-08 00:53:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 1.6360294117647058) internal successors, (445), 272 states have internal predecessors, (445), 0 states have call successors, (0), 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 00:53:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 445 transitions. [2025-03-08 00:53:22,960 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 445 transitions. Word has length 87 [2025-03-08 00:53:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:22,960 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 445 transitions. [2025-03-08 00:53:22,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 00:53:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 445 transitions. [2025-03-08 00:53:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 00:53:22,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:22,961 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:22,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:53:22,961 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:22,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:22,961 INFO L85 PathProgramCache]: Analyzing trace with hash -788185491, now seen corresponding path program 1 times [2025-03-08 00:53:22,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:22,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504319474] [2025-03-08 00:53:22,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:22,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:22,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 00:53:22,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 00:53:22,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:22,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:53:23,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:23,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504319474] [2025-03-08 00:53:23,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504319474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:23,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:23,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:23,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586489748] [2025-03-08 00:53:23,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:23,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:23,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:23,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:23,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:23,054 INFO L87 Difference]: Start difference. First operand 273 states and 445 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 00:53:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:23,206 INFO L93 Difference]: Finished difference Result 582 states and 957 transitions. [2025-03-08 00:53:23,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:23,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 107 [2025-03-08 00:53:23,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:23,209 INFO L225 Difference]: With dead ends: 582 [2025-03-08 00:53:23,209 INFO L226 Difference]: Without dead ends: 323 [2025-03-08 00:53:23,209 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 00:53:23,210 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 35 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:23,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 355 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:23,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-08 00:53:23,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 313. [2025-03-08 00:53:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.4935897435897436) internal successors, (466), 312 states have internal predecessors, (466), 0 states have call successors, (0), 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 00:53:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 466 transitions. [2025-03-08 00:53:23,223 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 466 transitions. Word has length 107 [2025-03-08 00:53:23,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:23,224 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 466 transitions. [2025-03-08 00:53:23,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 00:53:23,224 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 466 transitions. [2025-03-08 00:53:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 00:53:23,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:23,225 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:23,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 00:53:23,225 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:23,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:23,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1034498578, now seen corresponding path program 1 times [2025-03-08 00:53:23,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:23,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82011911] [2025-03-08 00:53:23,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:23,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:23,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 00:53:23,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 00:53:23,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:23,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:53:23,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:23,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82011911] [2025-03-08 00:53:23,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82011911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:23,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:23,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:23,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89429424] [2025-03-08 00:53:23,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:23,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:23,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:23,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:23,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:23,269 INFO L87 Difference]: Start difference. First operand 313 states and 466 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 00:53:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:23,368 INFO L93 Difference]: Finished difference Result 634 states and 951 transitions. [2025-03-08 00:53:23,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:23,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 107 [2025-03-08 00:53:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:23,369 INFO L225 Difference]: With dead ends: 634 [2025-03-08 00:53:23,369 INFO L226 Difference]: Without dead ends: 335 [2025-03-08 00:53:23,370 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 00:53:23,370 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 9 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:23,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 383 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:23,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-08 00:53:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2025-03-08 00:53:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.4760479041916168) internal successors, (493), 334 states have internal predecessors, (493), 0 states have call successors, (0), 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 00:53:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 493 transitions. [2025-03-08 00:53:23,378 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 493 transitions. Word has length 107 [2025-03-08 00:53:23,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:23,378 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 493 transitions. [2025-03-08 00:53:23,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 00:53:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 493 transitions. [2025-03-08 00:53:23,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 00:53:23,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:23,380 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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 00:53:23,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 00:53:23,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:23,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:23,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1874822396, now seen corresponding path program 1 times [2025-03-08 00:53:23,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:23,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933756502] [2025-03-08 00:53:23,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:23,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:23,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 00:53:23,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 00:53:23,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:23,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:53:23,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:23,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933756502] [2025-03-08 00:53:23,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933756502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:23,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:23,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:23,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587798102] [2025-03-08 00:53:23,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:23,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:23,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:23,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:23,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:23,458 INFO L87 Difference]: Start difference. First operand 335 states and 493 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 00:53:23,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:23,499 INFO L93 Difference]: Finished difference Result 932 states and 1381 transitions. [2025-03-08 00:53:23,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:23,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 118 [2025-03-08 00:53:23,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:23,501 INFO L225 Difference]: With dead ends: 932 [2025-03-08 00:53:23,501 INFO L226 Difference]: Without dead ends: 611 [2025-03-08 00:53:23,502 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 00:53:23,502 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 173 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:23,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 489 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:23,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-08 00:53:23,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2025-03-08 00:53:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 610 states have (on average 1.481967213114754) internal successors, (904), 610 states have internal predecessors, (904), 0 states have call successors, (0), 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 00:53:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 904 transitions. [2025-03-08 00:53:23,515 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 904 transitions. Word has length 118 [2025-03-08 00:53:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:23,515 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 904 transitions. [2025-03-08 00:53:23,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 00:53:23,516 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 904 transitions. [2025-03-08 00:53:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 00:53:23,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:23,517 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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 00:53:23,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:53:23,517 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:23,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:23,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1998895643, now seen corresponding path program 1 times [2025-03-08 00:53:23,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:23,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312314669] [2025-03-08 00:53:23,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:23,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:23,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 00:53:23,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 00:53:23,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:23,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 00:53:23,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:23,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312314669] [2025-03-08 00:53:23,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312314669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:23,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:23,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:23,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40571715] [2025-03-08 00:53:23,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:23,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:23,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:23,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:23,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:23,588 INFO L87 Difference]: Start difference. First operand 611 states and 904 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:23,642 INFO L93 Difference]: Finished difference Result 1523 states and 2251 transitions. [2025-03-08 00:53:23,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:23,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-03-08 00:53:23,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:23,645 INFO L225 Difference]: With dead ends: 1523 [2025-03-08 00:53:23,645 INFO L226 Difference]: Without dead ends: 926 [2025-03-08 00:53:23,646 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 00:53:23,646 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 171 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:23,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 641 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:23,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-03-08 00:53:23,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2025-03-08 00:53:23,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 925 states have (on average 1.4735135135135136) internal successors, (1363), 925 states have internal predecessors, (1363), 0 states have call successors, (0), 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 00:53:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1363 transitions. [2025-03-08 00:53:23,663 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1363 transitions. Word has length 118 [2025-03-08 00:53:23,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:23,663 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1363 transitions. [2025-03-08 00:53:23,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:23,663 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1363 transitions. [2025-03-08 00:53:23,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 00:53:23,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:23,665 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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 00:53:23,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 00:53:23,665 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:23,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:23,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1091443421, now seen corresponding path program 1 times [2025-03-08 00:53:23,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:23,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91802320] [2025-03-08 00:53:23,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:23,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:23,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 00:53:23,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 00:53:23,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:23,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 00:53:23,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:23,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91802320] [2025-03-08 00:53:23,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91802320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:23,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:23,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:23,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194986749] [2025-03-08 00:53:23,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:23,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:23,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:23,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:23,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:23,702 INFO L87 Difference]: Start difference. First operand 926 states and 1363 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 00:53:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:23,741 INFO L93 Difference]: Finished difference Result 1861 states and 2733 transitions. [2025-03-08 00:53:23,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:23,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 118 [2025-03-08 00:53:23,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:23,744 INFO L225 Difference]: With dead ends: 1861 [2025-03-08 00:53:23,744 INFO L226 Difference]: Without dead ends: 949 [2025-03-08 00:53:23,745 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 00:53:23,745 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 10 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:23,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 463 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:23,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2025-03-08 00:53:23,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 949. [2025-03-08 00:53:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 948 states have (on average 1.4672995780590716) internal successors, (1391), 948 states have internal predecessors, (1391), 0 states have call successors, (0), 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 00:53:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1391 transitions. [2025-03-08 00:53:23,768 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1391 transitions. Word has length 118 [2025-03-08 00:53:23,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:23,768 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1391 transitions. [2025-03-08 00:53:23,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 00:53:23,768 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1391 transitions. [2025-03-08 00:53:23,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 00:53:23,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:23,769 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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 00:53:23,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 00:53:23,770 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:23,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:23,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2004788610, now seen corresponding path program 1 times [2025-03-08 00:53:23,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:23,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79453185] [2025-03-08 00:53:23,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:23,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:23,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 00:53:23,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 00:53:23,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:23,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-08 00:53:23,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:23,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79453185] [2025-03-08 00:53:23,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79453185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:23,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:23,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:23,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097817719] [2025-03-08 00:53:23,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:23,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:23,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:23,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:23,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:23,819 INFO L87 Difference]: Start difference. First operand 949 states and 1391 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 00:53:23,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:23,857 INFO L93 Difference]: Finished difference Result 1896 states and 2773 transitions. [2025-03-08 00:53:23,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:23,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 118 [2025-03-08 00:53:23,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:23,860 INFO L225 Difference]: With dead ends: 1896 [2025-03-08 00:53:23,860 INFO L226 Difference]: Without dead ends: 961 [2025-03-08 00:53:23,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 00:53:23,862 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 15 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:23,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 436 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2025-03-08 00:53:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 961. [2025-03-08 00:53:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 960 states have (on average 1.4614583333333333) internal successors, (1403), 960 states have internal predecessors, (1403), 0 states have call successors, (0), 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 00:53:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1403 transitions. [2025-03-08 00:53:23,880 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1403 transitions. Word has length 118 [2025-03-08 00:53:23,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:23,880 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1403 transitions. [2025-03-08 00:53:23,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 00:53:23,880 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1403 transitions. [2025-03-08 00:53:23,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-08 00:53:23,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:23,882 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:23,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 00:53:23,882 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:23,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:23,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1416692543, now seen corresponding path program 1 times [2025-03-08 00:53:23,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:23,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540072766] [2025-03-08 00:53:23,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:23,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:23,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 00:53:23,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 00:53:23,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:23,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-08 00:53:23,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:23,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540072766] [2025-03-08 00:53:23,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540072766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:23,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:23,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:23,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749020828] [2025-03-08 00:53:23,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:23,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:23,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:23,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:23,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:23,953 INFO L87 Difference]: Start difference. First operand 961 states and 1403 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 00:53:24,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:24,086 INFO L93 Difference]: Finished difference Result 1920 states and 2805 transitions. [2025-03-08 00:53:24,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:24,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 195 [2025-03-08 00:53:24,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:24,091 INFO L225 Difference]: With dead ends: 1920 [2025-03-08 00:53:24,092 INFO L226 Difference]: Without dead ends: 985 [2025-03-08 00:53:24,093 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 00:53:24,093 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 77 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:24,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 283 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:24,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-03-08 00:53:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 985. [2025-03-08 00:53:24,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 984 states have (on average 1.431910569105691) internal successors, (1409), 984 states have internal predecessors, (1409), 0 states have call successors, (0), 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 00:53:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1409 transitions. [2025-03-08 00:53:24,111 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1409 transitions. Word has length 195 [2025-03-08 00:53:24,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:24,111 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1409 transitions. [2025-03-08 00:53:24,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 00:53:24,111 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1409 transitions. [2025-03-08 00:53:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 00:53:24,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:24,114 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:24,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 00:53:24,114 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:24,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:24,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1453222759, now seen corresponding path program 1 times [2025-03-08 00:53:24,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:24,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494960921] [2025-03-08 00:53:24,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:24,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:24,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 00:53:24,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 00:53:24,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:24,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-08 00:53:24,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:24,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494960921] [2025-03-08 00:53:24,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494960921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:24,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:24,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:24,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069723785] [2025-03-08 00:53:24,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:24,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:24,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:24,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:24,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:24,192 INFO L87 Difference]: Start difference. First operand 985 states and 1409 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:24,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:24,311 INFO L93 Difference]: Finished difference Result 2034 states and 2946 transitions. [2025-03-08 00:53:24,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:24,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2025-03-08 00:53:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:24,315 INFO L225 Difference]: With dead ends: 2034 [2025-03-08 00:53:24,315 INFO L226 Difference]: Without dead ends: 1075 [2025-03-08 00:53:24,316 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 00:53:24,317 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 10 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:24,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 380 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:24,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2025-03-08 00:53:24,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1075. [2025-03-08 00:53:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1074 states have (on average 1.409683426443203) internal successors, (1514), 1074 states have internal predecessors, (1514), 0 states have call successors, (0), 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 00:53:24,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1514 transitions. [2025-03-08 00:53:24,337 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1514 transitions. Word has length 225 [2025-03-08 00:53:24,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:24,337 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1514 transitions. [2025-03-08 00:53:24,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1514 transitions. [2025-03-08 00:53:24,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-08 00:53:24,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:24,340 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-08 00:53:24,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 00:53:24,341 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:24,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:24,341 INFO L85 PathProgramCache]: Analyzing trace with hash -886109765, now seen corresponding path program 2 times [2025-03-08 00:53:24,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:24,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230363981] [2025-03-08 00:53:24,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:53:24,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:24,353 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 253 statements into 2 equivalence classes. [2025-03-08 00:53:24,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 253 of 253 statements. [2025-03-08 00:53:24,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:53:24,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2025-03-08 00:53:24,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:24,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230363981] [2025-03-08 00:53:24,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230363981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:24,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:24,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:24,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726700869] [2025-03-08 00:53:24,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:24,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:24,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:24,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:24,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:24,429 INFO L87 Difference]: Start difference. First operand 1075 states and 1514 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 00:53:24,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:24,562 INFO L93 Difference]: Finished difference Result 2244 states and 3213 transitions. [2025-03-08 00:53:24,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:24,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 253 [2025-03-08 00:53:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:24,566 INFO L225 Difference]: With dead ends: 2244 [2025-03-08 00:53:24,566 INFO L226 Difference]: Without dead ends: 1070 [2025-03-08 00:53:24,567 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 00:53:24,567 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 19 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:24,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 383 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:24,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2025-03-08 00:53:24,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1070. [2025-03-08 00:53:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 1069 states have (on average 1.4041159962581853) internal successors, (1501), 1069 states have internal predecessors, (1501), 0 states have call successors, (0), 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 00:53:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1501 transitions. [2025-03-08 00:53:24,602 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1501 transitions. Word has length 253 [2025-03-08 00:53:24,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:24,602 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1501 transitions. [2025-03-08 00:53:24,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 00:53:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1501 transitions. [2025-03-08 00:53:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-08 00:53:24,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:24,605 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:24,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 00:53:24,605 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:24,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:24,606 INFO L85 PathProgramCache]: Analyzing trace with hash -424830763, now seen corresponding path program 1 times [2025-03-08 00:53:24,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:24,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758095159] [2025-03-08 00:53:24,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:24,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:24,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-08 00:53:24,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-08 00:53:24,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:24,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2025-03-08 00:53:24,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:24,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758095159] [2025-03-08 00:53:24,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758095159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:24,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:24,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:24,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606643083] [2025-03-08 00:53:24,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:24,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:24,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:24,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:24,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:24,712 INFO L87 Difference]: Start difference. First operand 1070 states and 1501 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 00:53:24,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:24,765 INFO L93 Difference]: Finished difference Result 3046 states and 4303 transitions. [2025-03-08 00:53:24,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:24,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 264 [2025-03-08 00:53:24,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:24,770 INFO L225 Difference]: With dead ends: 3046 [2025-03-08 00:53:24,770 INFO L226 Difference]: Without dead ends: 1358 [2025-03-08 00:53:24,772 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 00:53:24,773 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 157 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:24,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 623 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:24,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2025-03-08 00:53:24,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1354. [2025-03-08 00:53:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1353 states have (on average 1.409460458240946) internal successors, (1907), 1353 states have internal predecessors, (1907), 0 states have call successors, (0), 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 00:53:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1907 transitions. [2025-03-08 00:53:24,803 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1907 transitions. Word has length 264 [2025-03-08 00:53:24,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:24,803 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1907 transitions. [2025-03-08 00:53:24,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 00:53:24,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1907 transitions. [2025-03-08 00:53:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-08 00:53:24,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:24,807 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:24,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 00:53:24,808 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:24,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:24,808 INFO L85 PathProgramCache]: Analyzing trace with hash -547936915, now seen corresponding path program 1 times [2025-03-08 00:53:24,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:24,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987084758] [2025-03-08 00:53:24,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:24,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:24,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-08 00:53:24,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-08 00:53:24,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:24,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2025-03-08 00:53:24,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:24,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987084758] [2025-03-08 00:53:24,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987084758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:24,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:24,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:24,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814061382] [2025-03-08 00:53:24,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:24,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:24,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:24,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:24,884 INFO L87 Difference]: Start difference. First operand 1354 states and 1907 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 00:53:25,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:25,010 INFO L93 Difference]: Finished difference Result 2778 states and 3944 transitions. [2025-03-08 00:53:25,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:25,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 284 [2025-03-08 00:53:25,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:25,016 INFO L225 Difference]: With dead ends: 2778 [2025-03-08 00:53:25,016 INFO L226 Difference]: Without dead ends: 1450 [2025-03-08 00:53:25,019 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 00:53:25,019 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 9 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:25,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 377 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:25,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2025-03-08 00:53:25,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2025-03-08 00:53:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1449 states have (on average 1.396135265700483) internal successors, (2023), 1449 states have internal predecessors, (2023), 0 states have call successors, (0), 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 00:53:25,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 2023 transitions. [2025-03-08 00:53:25,054 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 2023 transitions. Word has length 284 [2025-03-08 00:53:25,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:25,055 INFO L471 AbstractCegarLoop]: Abstraction has 1450 states and 2023 transitions. [2025-03-08 00:53:25,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 00:53:25,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2023 transitions. [2025-03-08 00:53:25,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-08 00:53:25,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:25,059 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:25,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 00:53:25,059 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:25,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:25,060 INFO L85 PathProgramCache]: Analyzing trace with hash 803159801, now seen corresponding path program 1 times [2025-03-08 00:53:25,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:25,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487695240] [2025-03-08 00:53:25,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:25,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:25,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-08 00:53:25,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-08 00:53:25,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:25,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:25,150 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2025-03-08 00:53:25,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:25,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487695240] [2025-03-08 00:53:25,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487695240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:25,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:25,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:25,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100916259] [2025-03-08 00:53:25,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:25,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:25,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:25,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:25,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:25,152 INFO L87 Difference]: Start difference. First operand 1450 states and 2023 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 00:53:25,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:25,277 INFO L93 Difference]: Finished difference Result 2978 states and 4192 transitions. [2025-03-08 00:53:25,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:25,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 310 [2025-03-08 00:53:25,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:25,281 INFO L225 Difference]: With dead ends: 2978 [2025-03-08 00:53:25,281 INFO L226 Difference]: Without dead ends: 1554 [2025-03-08 00:53:25,283 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 00:53:25,283 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 9 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:25,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 377 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-03-08 00:53:25,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1554. [2025-03-08 00:53:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1553 states have (on average 1.3824855119124275) internal successors, (2147), 1553 states have internal predecessors, (2147), 0 states have call successors, (0), 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 00:53:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2147 transitions. [2025-03-08 00:53:25,317 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2147 transitions. Word has length 310 [2025-03-08 00:53:25,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:25,318 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2147 transitions. [2025-03-08 00:53:25,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 00:53:25,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2147 transitions. [2025-03-08 00:53:25,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-08 00:53:25,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:25,322 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2025-03-08 00:53:25,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 00:53:25,322 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:25,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:25,323 INFO L85 PathProgramCache]: Analyzing trace with hash -976789605, now seen corresponding path program 1 times [2025-03-08 00:53:25,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:25,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517316307] [2025-03-08 00:53:25,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:25,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:25,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-08 00:53:25,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-08 00:53:25,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:25,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 607 proven. 0 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2025-03-08 00:53:25,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:25,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517316307] [2025-03-08 00:53:25,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517316307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:25,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:25,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:25,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456539001] [2025-03-08 00:53:25,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:25,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:25,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:25,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:25,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:25,414 INFO L87 Difference]: Start difference. First operand 1554 states and 2147 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 00:53:25,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:25,545 INFO L93 Difference]: Finished difference Result 3194 states and 4456 transitions. [2025-03-08 00:53:25,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:25,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 332 [2025-03-08 00:53:25,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:25,551 INFO L225 Difference]: With dead ends: 3194 [2025-03-08 00:53:25,551 INFO L226 Difference]: Without dead ends: 1666 [2025-03-08 00:53:25,553 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 00:53:25,553 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 9 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:25,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 377 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:25,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2025-03-08 00:53:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2025-03-08 00:53:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1665 states have (on average 1.3687687687687689) internal successors, (2279), 1665 states have internal predecessors, (2279), 0 states have call successors, (0), 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 00:53:25,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2279 transitions. [2025-03-08 00:53:25,584 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2279 transitions. Word has length 332 [2025-03-08 00:53:25,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:25,584 INFO L471 AbstractCegarLoop]: Abstraction has 1666 states and 2279 transitions. [2025-03-08 00:53:25,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 00:53:25,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2279 transitions. [2025-03-08 00:53:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-08 00:53:25,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:25,588 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:25,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 00:53:25,588 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:25,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:25,588 INFO L85 PathProgramCache]: Analyzing trace with hash 101831156, now seen corresponding path program 1 times [2025-03-08 00:53:25,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:25,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680537901] [2025-03-08 00:53:25,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:25,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:25,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-08 00:53:25,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-08 00:53:25,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:25,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 861 proven. 25 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-08 00:53:25,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:25,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680537901] [2025-03-08 00:53:25,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680537901] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:25,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148430705] [2025-03-08 00:53:25,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:25,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:25,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:25,758 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 00:53:25,760 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 00:53:25,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-08 00:53:25,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-08 00:53:25,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:25,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:25,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:53:25,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 861 proven. 25 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-08 00:53:25,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 861 proven. 25 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-08 00:53:26,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148430705] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:26,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:53:26,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-08 00:53:26,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325907290] [2025-03-08 00:53:26,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:26,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:53:26,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:26,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:53:26,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:53:26,081 INFO L87 Difference]: Start difference. First operand 1666 states and 2279 transitions. Second operand has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 0 states have call successors, (0), 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 00:53:26,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:26,474 INFO L93 Difference]: Finished difference Result 4045 states and 5608 transitions. [2025-03-08 00:53:26,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:53:26,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 0 states have call successors, (0), 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 365 [2025-03-08 00:53:26,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:26,481 INFO L225 Difference]: With dead ends: 4045 [2025-03-08 00:53:26,481 INFO L226 Difference]: Without dead ends: 2296 [2025-03-08 00:53:26,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 740 GetRequests, 732 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:53:26,484 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 522 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:26,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 940 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:53:26,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2025-03-08 00:53:26,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1687. [2025-03-08 00:53:26,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1686 states have (on average 1.356465005931198) internal successors, (2287), 1686 states have internal predecessors, (2287), 0 states have call successors, (0), 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 00:53:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2287 transitions. [2025-03-08 00:53:26,522 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2287 transitions. Word has length 365 [2025-03-08 00:53:26,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:26,522 INFO L471 AbstractCegarLoop]: Abstraction has 1687 states and 2287 transitions. [2025-03-08 00:53:26,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 0 states have call successors, (0), 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 00:53:26,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2287 transitions. [2025-03-08 00:53:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-08 00:53:26,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:26,527 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:26,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:53:26,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 00:53:26,731 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:26,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:26,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1595618255, now seen corresponding path program 1 times [2025-03-08 00:53:26,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:26,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733042363] [2025-03-08 00:53:26,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:26,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:26,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-08 00:53:26,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-08 00:53:26,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:26,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2234 backedges. 1261 proven. 0 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2025-03-08 00:53:26,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:26,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733042363] [2025-03-08 00:53:26,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733042363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:26,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:26,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:26,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372893743] [2025-03-08 00:53:26,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:26,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:26,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:26,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:26,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:26,840 INFO L87 Difference]: Start difference. First operand 1687 states and 2287 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 00:53:26,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:26,968 INFO L93 Difference]: Finished difference Result 3513 states and 4835 transitions. [2025-03-08 00:53:26,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:26,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 462 [2025-03-08 00:53:26,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:26,974 INFO L225 Difference]: With dead ends: 3513 [2025-03-08 00:53:26,974 INFO L226 Difference]: Without dead ends: 1852 [2025-03-08 00:53:26,976 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 00:53:26,976 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 9 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:26,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 369 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:26,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2025-03-08 00:53:27,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1852. [2025-03-08 00:53:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1851 states have (on average 1.3381955699621826) internal successors, (2477), 1851 states have internal predecessors, (2477), 0 states have call successors, (0), 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 00:53:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2477 transitions. [2025-03-08 00:53:27,010 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2477 transitions. Word has length 462 [2025-03-08 00:53:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:27,010 INFO L471 AbstractCegarLoop]: Abstraction has 1852 states and 2477 transitions. [2025-03-08 00:53:27,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 00:53:27,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2477 transitions. [2025-03-08 00:53:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2025-03-08 00:53:27,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:27,016 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:27,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 00:53:27,016 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:27,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:27,017 INFO L85 PathProgramCache]: Analyzing trace with hash -188318847, now seen corresponding path program 1 times [2025-03-08 00:53:27,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:27,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710882238] [2025-03-08 00:53:27,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:27,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:27,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-03-08 00:53:27,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-03-08 00:53:27,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:27,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2968 backedges. 1681 proven. 0 refuted. 0 times theorem prover too weak. 1287 trivial. 0 not checked. [2025-03-08 00:53:27,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:27,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710882238] [2025-03-08 00:53:27,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710882238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:27,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:27,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:27,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123249027] [2025-03-08 00:53:27,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:27,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:27,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:27,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:27,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:27,120 INFO L87 Difference]: Start difference. First operand 1852 states and 2477 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 00:53:27,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:27,251 INFO L93 Difference]: Finished difference Result 3853 states and 5235 transitions. [2025-03-08 00:53:27,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:27,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 522 [2025-03-08 00:53:27,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:27,258 INFO L225 Difference]: With dead ends: 3853 [2025-03-08 00:53:27,259 INFO L226 Difference]: Without dead ends: 2027 [2025-03-08 00:53:27,261 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 00:53:27,262 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 9 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:27,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 369 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:27,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2025-03-08 00:53:27,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2027. [2025-03-08 00:53:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 2026 states have (on average 1.3213228035538005) internal successors, (2677), 2026 states have internal predecessors, (2677), 0 states have call successors, (0), 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 00:53:27,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2677 transitions. [2025-03-08 00:53:27,300 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2677 transitions. Word has length 522 [2025-03-08 00:53:27,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:27,301 INFO L471 AbstractCegarLoop]: Abstraction has 2027 states and 2677 transitions. [2025-03-08 00:53:27,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 00:53:27,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2677 transitions. [2025-03-08 00:53:27,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-03-08 00:53:27,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:27,304 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:27,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 00:53:27,305 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:27,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:27,306 INFO L85 PathProgramCache]: Analyzing trace with hash 976660501, now seen corresponding path program 1 times [2025-03-08 00:53:27,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:27,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951122419] [2025-03-08 00:53:27,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:27,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:27,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-03-08 00:53:27,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-03-08 00:53:27,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:27,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3840 backedges. 2223 proven. 25 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2025-03-08 00:53:27,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:27,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951122419] [2025-03-08 00:53:27,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951122419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:27,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898502897] [2025-03-08 00:53:27,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:27,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:27,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:27,505 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 00:53:27,507 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 00:53:27,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-03-08 00:53:27,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-03-08 00:53:27,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:27,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:27,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:53:27,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3840 backedges. 2223 proven. 25 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2025-03-08 00:53:27,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3840 backedges. 2223 proven. 25 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2025-03-08 00:53:27,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898502897] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:27,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:53:27,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-08 00:53:27,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254209888] [2025-03-08 00:53:27,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:27,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:53:27,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:27,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:53:27,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:53:27,858 INFO L87 Difference]: Start difference. First operand 2027 states and 2677 transitions. Second operand has 8 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 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 00:53:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:28,178 INFO L93 Difference]: Finished difference Result 2898 states and 3841 transitions. [2025-03-08 00:53:28,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:53:28,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 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 586 [2025-03-08 00:53:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:28,182 INFO L225 Difference]: With dead ends: 2898 [2025-03-08 00:53:28,182 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 00:53:28,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1180 GetRequests, 1171 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:53:28,184 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 214 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:28,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 844 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:53:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 00:53:28,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 00:53:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 00:53:28,186 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 586 [2025-03-08 00:53:28,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:28,186 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 00:53:28,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 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 00:53:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 00:53:28,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 00:53:28,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:53:28,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 00:53:28,390 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,SelfDestructingSolverStorable20 [2025-03-08 00:53:28,393 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:28,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 00:53:28,748 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:53:28,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:53:28 BoogieIcfgContainer [2025-03-08 00:53:28,760 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:53:28,761 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:53:28,761 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:53:28,761 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:53:28,761 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:21" (3/4) ... [2025-03-08 00:53:28,763 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 00:53:28,775 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-08 00:53:28,777 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 00:53:28,777 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 00:53:28,778 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 00:53:28,877 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 00:53:28,878 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 00:53:28,878 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:53:28,879 INFO L158 Benchmark]: Toolchain (without parser) took 8495.94ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 122.5MB in the beginning and 403.6MB in the end (delta: -281.1MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2025-03-08 00:53:28,879 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:28,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.60ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 106.3MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 00:53:28,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.91ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 104.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:28,880 INFO L158 Benchmark]: Boogie Preprocessor took 52.98ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 101.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:28,881 INFO L158 Benchmark]: IcfgBuilder took 662.79ms. Allocated memory is still 167.8MB. Free memory was 101.9MB in the beginning and 59.2MB in the end (delta: 42.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 00:53:28,881 INFO L158 Benchmark]: TraceAbstraction took 7335.24ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 59.0MB in the beginning and 411.8MB in the end (delta: -352.9MB). Peak memory consumption was 159.1MB. Max. memory is 16.1GB. [2025-03-08 00:53:28,881 INFO L158 Benchmark]: Witness Printer took 116.76ms. Allocated memory is still 469.8MB. Free memory was 411.8MB in the beginning and 403.6MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:53:28,883 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.60ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 106.3MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.91ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 104.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.98ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 101.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 662.79ms. Allocated memory is still 167.8MB. Free memory was 101.9MB in the beginning and 59.2MB in the end (delta: 42.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7335.24ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 59.0MB in the beginning and 411.8MB in the end (delta: -352.9MB). Peak memory consumption was 159.1MB. Max. memory is 16.1GB. * Witness Printer took 116.76ms. Allocated memory is still 469.8MB. Free memory was 411.8MB in the beginning and 403.6MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 681]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 169 locations, 287 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 21, TraceHistogramMax: 19, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1597 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1597 mSDsluCounter, 9420 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4174 mSDsCounter, 405 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3102 IncrementalHoareTripleChecker+Invalid, 3507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 405 mSolverCounterUnsat, 5246 mSDtfsCounter, 3102 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1977 GetRequests, 1941 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2027occurred in iteration=20, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 623 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 5683 NumberOfCodeBlocks, 5683 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 6609 ConstructedInterpolants, 0 QuantifiedInterpolants, 8722 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1483 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 25 InterpolantComputations, 19 PerfectInterpolantSequences, 25895/26045 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 109]: Location Invariant Derived location invariant: (((((((((((((8464 == s__state) && (blastFlag == 0)) || ((2 == blastFlag) && (8560 == s__state))) || ((2 == blastFlag) && (s__state == 8512))) || ((((3 == blastFlag) && (s__s3__tmp__next_state___0 <= 8576)) && (8656 <= s__state)) && (s__state <= 8672))) || ((2 == blastFlag) && (0 != s__hit))) || ((2 == blastFlag) && (8544 == s__state))) || ((((2 == blastFlag) && (s__state != 8672)) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8672))) || (((3 == blastFlag) && (3 == s__s3__tmp__next_state___0)) && (8448 == s__state))) || ((3 == blastFlag) && (0 != s__hit))) || (s__state == 3)) || ((8496 == s__state) && (blastFlag == 1))) || ((s__state == 8528) && (2 == blastFlag))) RESULT: Ultimate proved your program to be correct! [2025-03-08 00:53:28,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE