./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-86.i --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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-86.i -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 c41233577d4f3add43688eebc1dd327b554f3a213d6a52593493024e00cc2d82 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:14:40,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:14:40,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:14:40,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:14:40,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:14:40,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:14:40,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:14:40,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:14:40,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:14:40,362 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:14:40,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:14:40,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:14:40,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:14:40,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:14:40,364 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:14:40,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:14:40,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:14:40,364 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:14:40,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:14:40,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:14:40,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:14:40,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:14:40,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:14:40,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:14:40,364 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:14:40,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:14:40,364 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:14:40,364 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:14:40,364 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:14:40,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:14:40,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:14:40,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:14:40,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:14:40,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:14:40,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:14:40,365 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:14:40,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:14:40,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:14:40,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:14:40,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:14:40,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:14:40,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:14:40,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:14:40,365 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 -> c41233577d4f3add43688eebc1dd327b554f3a213d6a52593493024e00cc2d82 [2025-03-08 11:14:40,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:14:40,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:14:40,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:14:40,604 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:14:40,604 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:14:40,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-86.i [2025-03-08 11:14:41,729 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a5decb7a/7eb24851461941ce9f45e0597b953d27/FLAGcb7a3ae27 [2025-03-08 11:14:41,952 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:14:41,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-86.i [2025-03-08 11:14:41,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a5decb7a/7eb24851461941ce9f45e0597b953d27/FLAGcb7a3ae27 [2025-03-08 11:14:41,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a5decb7a/7eb24851461941ce9f45e0597b953d27 [2025-03-08 11:14:41,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:14:41,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:14:41,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:14:41,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:14:41,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:14:41,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:14:41" (1/1) ... [2025-03-08 11:14:41,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3249ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:41, skipping insertion in model container [2025-03-08 11:14:41,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:14:41" (1/1) ... [2025-03-08 11:14:41,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:14:42,099 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-86.i[915,928] [2025-03-08 11:14:42,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:14:42,174 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:14:42,182 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-86.i[915,928] [2025-03-08 11:14:42,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:14:42,231 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:14:42,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:42 WrapperNode [2025-03-08 11:14:42,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:14:42,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:14:42,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:14:42,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:14:42,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:42" (1/1) ... [2025-03-08 11:14:42,247 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:42" (1/1) ... [2025-03-08 11:14:42,270 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2025-03-08 11:14:42,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:14:42,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:14:42,270 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:14:42,270 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:14:42,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:42" (1/1) ... [2025-03-08 11:14:42,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:42" (1/1) ... [2025-03-08 11:14:42,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:42" (1/1) ... [2025-03-08 11:14:42,290 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 11:14:42,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:42" (1/1) ... [2025-03-08 11:14:42,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:42" (1/1) ... [2025-03-08 11:14:42,296 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:42" (1/1) ... [2025-03-08 11:14:42,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:42" (1/1) ... [2025-03-08 11:14:42,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:42" (1/1) ... [2025-03-08 11:14:42,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:42" (1/1) ... [2025-03-08 11:14:42,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:14:42,302 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:14:42,302 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:14:42,302 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:14:42,303 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:42" (1/1) ... [2025-03-08 11:14:42,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:14:42,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:14:42,329 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 11:14:42,331 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 11:14:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:14:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:14:42,350 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:14:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:14:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:14:42,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:14:42,417 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:14:42,419 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:14:42,724 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-08 11:14:42,725 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:14:42,742 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:14:42,744 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:14:42,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:14:42 BoogieIcfgContainer [2025-03-08 11:14:42,744 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:14:42,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:14:42,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:14:42,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:14:42,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:14:41" (1/3) ... [2025-03-08 11:14:42,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d07c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:14:42, skipping insertion in model container [2025-03-08 11:14:42,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:42" (2/3) ... [2025-03-08 11:14:42,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d07c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:14:42, skipping insertion in model container [2025-03-08 11:14:42,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:14:42" (3/3) ... [2025-03-08 11:14:42,751 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-86.i [2025-03-08 11:14:42,763 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:14:42,766 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-86.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:14:42,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:14:42,817 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;@444ef65f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:14:42,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:14:42,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 64 states have internal predecessors, (89), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 11:14:42,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-08 11:14:42,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:14:42,835 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:14:42,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:14:42,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:14:42,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1976386731, now seen corresponding path program 1 times [2025-03-08 11:14:42,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:14:42,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541414792] [2025-03-08 11:14:42,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:14:42,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:14:42,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 11:14:42,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 11:14:42,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:14:42,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:14:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-08 11:14:43,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:14:43,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541414792] [2025-03-08 11:14:43,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541414792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:14:43,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719842266] [2025-03-08 11:14:43,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:14:43,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:14:43,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:14:43,134 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 11:14:43,135 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 11:14:43,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 11:14:43,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 11:14:43,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:14:43,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:14:43,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:14:43,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:14:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-08 11:14:43,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:14:43,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719842266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:14:43,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:14:43,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:14:43,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147957095] [2025-03-08 11:14:43,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:14:43,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:14:43,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:14:43,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:14:43,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:14:43,347 INFO L87 Difference]: Start difference. First operand has 100 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 64 states have internal predecessors, (89), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 11:14:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:14:43,370 INFO L93 Difference]: Finished difference Result 194 states and 343 transitions. [2025-03-08 11:14:43,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:14:43,372 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 212 [2025-03-08 11:14:43,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:14:43,376 INFO L225 Difference]: With dead ends: 194 [2025-03-08 11:14:43,376 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 11:14:43,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:14:43,380 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:14:43,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:14:43,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 11:14:43,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-08 11:14:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 11:14:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 150 transitions. [2025-03-08 11:14:43,411 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 150 transitions. Word has length 212 [2025-03-08 11:14:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:14:43,411 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 150 transitions. [2025-03-08 11:14:43,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 11:14:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 150 transitions. [2025-03-08 11:14:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-08 11:14:43,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:14:43,415 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:14:43,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:14:43,616 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,SelfDestructingSolverStorable0 [2025-03-08 11:14:43,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:14:43,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:14:43,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1921162605, now seen corresponding path program 1 times [2025-03-08 11:14:43,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:14:43,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405600840] [2025-03-08 11:14:43,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:14:43,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:14:43,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 11:14:43,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 11:14:43,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:14:43,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:14:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:14:43,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:14:43,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405600840] [2025-03-08 11:14:43,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405600840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:14:43,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:14:43,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:14:43,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769475204] [2025-03-08 11:14:43,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:14:43,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:14:43,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:14:43,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:14:43,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:14:43,957 INFO L87 Difference]: Start difference. First operand 97 states and 150 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:14:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:14:44,137 INFO L93 Difference]: Finished difference Result 192 states and 299 transitions. [2025-03-08 11:14:44,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:14:44,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 212 [2025-03-08 11:14:44,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:14:44,140 INFO L225 Difference]: With dead ends: 192 [2025-03-08 11:14:44,140 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 11:14:44,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:14:44,141 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 147 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:14:44,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 185 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:14:44,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 11:14:44,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-08 11:14:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 11:14:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 151 transitions. [2025-03-08 11:14:44,150 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 151 transitions. Word has length 212 [2025-03-08 11:14:44,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:14:44,153 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 151 transitions. [2025-03-08 11:14:44,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:14:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 151 transitions. [2025-03-08 11:14:44,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 11:14:44,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:14:44,157 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:14:44,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:14:44,157 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:14:44,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:14:44,158 INFO L85 PathProgramCache]: Analyzing trace with hash -184600964, now seen corresponding path program 1 times [2025-03-08 11:14:44,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:14:44,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732812716] [2025-03-08 11:14:44,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:14:44,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:14:44,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 11:14:44,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 11:14:44,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:14:44,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:14:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:14:44,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:14:44,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732812716] [2025-03-08 11:14:44,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732812716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:14:44,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:14:44,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:14:44,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619608081] [2025-03-08 11:14:44,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:14:44,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:14:44,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:14:44,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:14:44,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:14:44,374 INFO L87 Difference]: Start difference. First operand 98 states and 151 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:14:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:14:44,621 INFO L93 Difference]: Finished difference Result 278 states and 426 transitions. [2025-03-08 11:14:44,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:14:44,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2025-03-08 11:14:44,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:14:44,623 INFO L225 Difference]: With dead ends: 278 [2025-03-08 11:14:44,624 INFO L226 Difference]: Without dead ends: 183 [2025-03-08 11:14:44,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:14:44,625 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 201 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:14:44,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 662 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:14:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-08 11:14:44,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 127. [2025-03-08 11:14:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-08 11:14:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 194 transitions. [2025-03-08 11:14:44,639 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 194 transitions. Word has length 214 [2025-03-08 11:14:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:14:44,640 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 194 transitions. [2025-03-08 11:14:44,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:14:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 194 transitions. [2025-03-08 11:14:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 11:14:44,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:14:44,641 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:14:44,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:14:44,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:14:44,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:14:44,642 INFO L85 PathProgramCache]: Analyzing trace with hash -695135141, now seen corresponding path program 1 times [2025-03-08 11:14:44,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:14:44,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697323397] [2025-03-08 11:14:44,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:14:44,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:14:44,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 11:14:44,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 11:14:44,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:14:44,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:14:44,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:14:44,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:14:44,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697323397] [2025-03-08 11:14:44,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697323397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:14:44,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:14:44,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:14:44,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440453791] [2025-03-08 11:14:44,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:14:44,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:14:44,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:14:44,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:14:44,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:14:44,843 INFO L87 Difference]: Start difference. First operand 127 states and 194 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:14:45,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:14:45,040 INFO L93 Difference]: Finished difference Result 303 states and 460 transitions. [2025-03-08 11:14:45,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:14:45,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2025-03-08 11:14:45,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:14:45,043 INFO L225 Difference]: With dead ends: 303 [2025-03-08 11:14:45,043 INFO L226 Difference]: Without dead ends: 202 [2025-03-08 11:14:45,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:14:45,046 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 123 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:14:45,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 489 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:14:45,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-08 11:14:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 182. [2025-03-08 11:14:45,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 110 states have (on average 1.2818181818181817) internal successors, (141), 110 states have internal predecessors, (141), 68 states have call successors, (68), 3 states have call predecessors, (68), 3 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 11:14:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 277 transitions. [2025-03-08 11:14:45,084 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 277 transitions. Word has length 214 [2025-03-08 11:14:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:14:45,085 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 277 transitions. [2025-03-08 11:14:45,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:14:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 277 transitions. [2025-03-08 11:14:45,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 11:14:45,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:14:45,089 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:14:45,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:14:45,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:14:45,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:14:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1200693766, now seen corresponding path program 1 times [2025-03-08 11:14:45,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:14:45,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081746171] [2025-03-08 11:14:45,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:14:45,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:14:45,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 11:14:45,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 11:14:45,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:14:45,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:14:48,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:14:48,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:14:48,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081746171] [2025-03-08 11:14:48,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081746171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:14:48,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:14:48,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 11:14:48,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346647535] [2025-03-08 11:14:48,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:14:48,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 11:14:48,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:14:48,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 11:14:48,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:14:48,530 INFO L87 Difference]: Start difference. First operand 182 states and 277 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:14:49,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:14:49,507 INFO L93 Difference]: Finished difference Result 359 states and 536 transitions. [2025-03-08 11:14:49,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 11:14:49,508 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2025-03-08 11:14:49,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:14:49,511 INFO L225 Difference]: With dead ends: 359 [2025-03-08 11:14:49,511 INFO L226 Difference]: Without dead ends: 258 [2025-03-08 11:14:49,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2025-03-08 11:14:49,513 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 350 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:14:49,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 934 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:14:49,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-08 11:14:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 199. [2025-03-08 11:14:49,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 127 states have internal predecessors, (164), 68 states have call successors, (68), 3 states have call predecessors, (68), 3 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 11:14:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 300 transitions. [2025-03-08 11:14:49,534 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 300 transitions. Word has length 214 [2025-03-08 11:14:49,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:14:49,536 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 300 transitions. [2025-03-08 11:14:49,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:14:49,537 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 300 transitions. [2025-03-08 11:14:49,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 11:14:49,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:14:49,539 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:14:49,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:14:49,540 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:14:49,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:14:49,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1297322171, now seen corresponding path program 1 times [2025-03-08 11:14:49,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:14:49,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599054349] [2025-03-08 11:14:49,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:14:49,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:14:49,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 11:14:49,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 11:14:49,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:14:49,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:14:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:14:49,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:14:49,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599054349] [2025-03-08 11:14:49,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599054349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:14:49,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:14:49,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:14:49,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167631705] [2025-03-08 11:14:49,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:14:49,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:14:49,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:14:49,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:14:49,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:14:49,615 INFO L87 Difference]: Start difference. First operand 199 states and 300 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:14:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:14:49,659 INFO L93 Difference]: Finished difference Result 400 states and 604 transitions. [2025-03-08 11:14:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:14:49,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2025-03-08 11:14:49,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:14:49,661 INFO L225 Difference]: With dead ends: 400 [2025-03-08 11:14:49,661 INFO L226 Difference]: Without dead ends: 299 [2025-03-08 11:14:49,662 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 11:14:49,662 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 142 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:14:49,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 294 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:14:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-08 11:14:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2025-03-08 11:14:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 189 states have (on average 1.2857142857142858) internal successors, (243), 189 states have internal predecessors, (243), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 11:14:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 447 transitions. [2025-03-08 11:14:49,687 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 447 transitions. Word has length 214 [2025-03-08 11:14:49,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:14:49,687 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 447 transitions. [2025-03-08 11:14:49,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:14:49,687 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 447 transitions. [2025-03-08 11:14:49,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 11:14:49,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:14:49,689 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:14:49,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:14:49,689 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:14:49,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:14:49,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1520994954, now seen corresponding path program 1 times [2025-03-08 11:14:49,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:14:49,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046218829] [2025-03-08 11:14:49,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:14:49,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:14:49,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 11:14:49,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 11:14:49,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:14:49,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:14:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:14:54,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:14:54,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046218829] [2025-03-08 11:14:54,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046218829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:14:54,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:14:54,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 11:14:54,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132058738] [2025-03-08 11:14:54,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:14:54,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 11:14:54,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:14:54,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 11:14:54,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-08 11:14:54,390 INFO L87 Difference]: Start difference. First operand 297 states and 447 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:14:57,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:14:57,103 INFO L93 Difference]: Finished difference Result 347 states and 505 transitions. [2025-03-08 11:14:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 11:14:57,103 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-03-08 11:14:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:14:57,105 INFO L225 Difference]: With dead ends: 347 [2025-03-08 11:14:57,105 INFO L226 Difference]: Without dead ends: 345 [2025-03-08 11:14:57,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2025-03-08 11:14:57,106 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 401 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:14:57,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 825 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 11:14:57,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-08 11:14:57,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 298. [2025-03-08 11:14:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 190 states have (on average 1.2842105263157895) internal successors, (244), 190 states have internal predecessors, (244), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 11:14:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 448 transitions. [2025-03-08 11:14:57,133 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 448 transitions. Word has length 215 [2025-03-08 11:14:57,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:14:57,134 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 448 transitions. [2025-03-08 11:14:57,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:14:57,134 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 448 transitions. [2025-03-08 11:14:57,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 11:14:57,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:14:57,136 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:14:57,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:14:57,136 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:14:57,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:14:57,137 INFO L85 PathProgramCache]: Analyzing trace with hash -37795641, now seen corresponding path program 1 times [2025-03-08 11:14:57,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:14:57,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743335281] [2025-03-08 11:14:57,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:14:57,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:14:57,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 11:14:57,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 11:14:57,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:14:57,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:14:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:14:57,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:14:57,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743335281] [2025-03-08 11:14:57,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743335281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:14:57,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:14:57,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:14:57,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473517079] [2025-03-08 11:14:57,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:14:57,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:14:57,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:14:57,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:14:57,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:14:57,253 INFO L87 Difference]: Start difference. First operand 298 states and 448 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:14:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:14:57,277 INFO L93 Difference]: Finished difference Result 508 states and 763 transitions. [2025-03-08 11:14:57,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:14:57,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-03-08 11:14:57,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:14:57,281 INFO L225 Difference]: With dead ends: 508 [2025-03-08 11:14:57,282 INFO L226 Difference]: Without dead ends: 306 [2025-03-08 11:14:57,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 11:14:57,283 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:14:57,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 282 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:14:57,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-08 11:14:57,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 298. [2025-03-08 11:14:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 190 states have (on average 1.268421052631579) internal successors, (241), 190 states have internal predecessors, (241), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 11:14:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 445 transitions. [2025-03-08 11:14:57,303 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 445 transitions. Word has length 215 [2025-03-08 11:14:57,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:14:57,303 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 445 transitions. [2025-03-08 11:14:57,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:14:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 445 transitions. [2025-03-08 11:14:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 11:14:57,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:14:57,304 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:14:57,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:14:57,305 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:14:57,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:14:57,306 INFO L85 PathProgramCache]: Analyzing trace with hash 849708040, now seen corresponding path program 1 times [2025-03-08 11:14:57,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:14:57,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492384376] [2025-03-08 11:14:57,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:14:57,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:14:57,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 11:14:57,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 11:14:57,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:14:57,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:15:05,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:05,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492384376] [2025-03-08 11:15:05,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492384376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:15:05,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:15:05,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 11:15:05,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135198592] [2025-03-08 11:15:05,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:15:05,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 11:15:05,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:05,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 11:15:05,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-03-08 11:15:05,402 INFO L87 Difference]: Start difference. First operand 298 states and 445 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-08 11:15:12,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:12,489 INFO L93 Difference]: Finished difference Result 347 states and 500 transitions. [2025-03-08 11:15:12,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 11:15:12,490 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 215 [2025-03-08 11:15:12,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:12,492 INFO L225 Difference]: With dead ends: 347 [2025-03-08 11:15:12,492 INFO L226 Difference]: Without dead ends: 345 [2025-03-08 11:15:12,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 11:15:12,493 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 354 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:12,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1256 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 11:15:12,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-08 11:15:12,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 298. [2025-03-08 11:15:12,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 190 states have (on average 1.268421052631579) internal successors, (241), 190 states have internal predecessors, (241), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 11:15:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 445 transitions. [2025-03-08 11:15:12,513 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 445 transitions. Word has length 215 [2025-03-08 11:15:12,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:12,515 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 445 transitions. [2025-03-08 11:15:12,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-08 11:15:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 445 transitions. [2025-03-08 11:15:12,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 11:15:12,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:12,517 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:12,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:15:12,517 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:12,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:12,518 INFO L85 PathProgramCache]: Analyzing trace with hash -664347226, now seen corresponding path program 1 times [2025-03-08 11:15:12,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:12,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559180822] [2025-03-08 11:15:12,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:12,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:12,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 11:15:12,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 11:15:12,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:12,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:15:17,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:17,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559180822] [2025-03-08 11:15:17,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559180822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:15:17,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:15:17,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 11:15:17,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556180390] [2025-03-08 11:15:17,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:15:17,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 11:15:17,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:17,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 11:15:17,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-08 11:15:17,606 INFO L87 Difference]: Start difference. First operand 298 states and 445 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:15:24,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:24,633 INFO L93 Difference]: Finished difference Result 368 states and 524 transitions. [2025-03-08 11:15:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 11:15:24,634 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-03-08 11:15:24,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:24,636 INFO L225 Difference]: With dead ends: 368 [2025-03-08 11:15:24,636 INFO L226 Difference]: Without dead ends: 366 [2025-03-08 11:15:24,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=283, Invalid=773, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 11:15:24,637 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 338 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:24,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 785 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 11:15:24,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-08 11:15:24,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 308. [2025-03-08 11:15:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 200 states have (on average 1.27) internal successors, (254), 200 states have internal predecessors, (254), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 11:15:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 458 transitions. [2025-03-08 11:15:24,654 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 458 transitions. Word has length 215 [2025-03-08 11:15:24,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:24,654 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 458 transitions. [2025-03-08 11:15:24,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:15:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 458 transitions. [2025-03-08 11:15:24,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 11:15:24,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:24,657 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:24,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:15:24,657 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:24,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:24,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1823165607, now seen corresponding path program 1 times [2025-03-08 11:15:24,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:24,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752812491] [2025-03-08 11:15:24,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:24,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:24,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 11:15:24,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 11:15:24,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:24,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:15:31,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:31,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752812491] [2025-03-08 11:15:31,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752812491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:15:31,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:15:31,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 11:15:31,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233312570] [2025-03-08 11:15:31,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:15:31,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 11:15:31,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:31,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 11:15:31,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-08 11:15:31,162 INFO L87 Difference]: Start difference. First operand 308 states and 458 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:15:37,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:37,010 INFO L93 Difference]: Finished difference Result 362 states and 518 transitions. [2025-03-08 11:15:37,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 11:15:37,011 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-03-08 11:15:37,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:37,013 INFO L225 Difference]: With dead ends: 362 [2025-03-08 11:15:37,013 INFO L226 Difference]: Without dead ends: 360 [2025-03-08 11:15:37,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2025-03-08 11:15:37,014 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 282 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:37,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 905 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 11:15:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-08 11:15:37,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 308. [2025-03-08 11:15:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 200 states have (on average 1.27) internal successors, (254), 200 states have internal predecessors, (254), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 11:15:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 458 transitions. [2025-03-08 11:15:37,031 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 458 transitions. Word has length 215 [2025-03-08 11:15:37,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:37,031 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 458 transitions. [2025-03-08 11:15:37,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:15:37,031 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 458 transitions. [2025-03-08 11:15:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-08 11:15:37,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:37,032 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:37,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:15:37,033 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:37,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:37,033 INFO L85 PathProgramCache]: Analyzing trace with hash 921215512, now seen corresponding path program 1 times [2025-03-08 11:15:37,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:37,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681070436] [2025-03-08 11:15:37,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:37,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:37,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-08 11:15:37,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-08 11:15:37,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:37,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:15:42,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:42,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681070436] [2025-03-08 11:15:42,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681070436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:15:42,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:15:42,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 11:15:42,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174671233] [2025-03-08 11:15:42,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:15:42,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 11:15:42,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:42,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 11:15:42,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:15:42,867 INFO L87 Difference]: Start difference. First operand 308 states and 458 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:15:46,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:15:46,093 INFO L93 Difference]: Finished difference Result 371 states and 529 transitions. [2025-03-08 11:15:46,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 11:15:46,093 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2025-03-08 11:15:46,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:15:46,095 INFO L225 Difference]: With dead ends: 371 [2025-03-08 11:15:46,095 INFO L226 Difference]: Without dead ends: 369 [2025-03-08 11:15:46,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=318, Invalid=804, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 11:15:46,096 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 302 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:15:46,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 781 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 11:15:46,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-08 11:15:46,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 312. [2025-03-08 11:15:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 204 states have (on average 1.2696078431372548) internal successors, (259), 204 states have internal predecessors, (259), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 11:15:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 463 transitions. [2025-03-08 11:15:46,113 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 463 transitions. Word has length 216 [2025-03-08 11:15:46,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:15:46,114 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 463 transitions. [2025-03-08 11:15:46,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:15:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 463 transitions. [2025-03-08 11:15:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-08 11:15:46,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:15:46,115 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:46,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:15:46,115 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:15:46,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:15:46,115 INFO L85 PathProgramCache]: Analyzing trace with hash -886238951, now seen corresponding path program 1 times [2025-03-08 11:15:46,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:15:46,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499915137] [2025-03-08 11:15:46,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:15:46,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:15:46,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-08 11:15:46,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-08 11:15:46,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:15:46,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:15:57,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:15:57,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:15:57,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499915137] [2025-03-08 11:15:57,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499915137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:15:57,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:15:57,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 11:15:57,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621379348] [2025-03-08 11:15:57,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:15:57,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 11:15:57,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:15:57,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 11:15:57,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-03-08 11:15:57,528 INFO L87 Difference]: Start difference. First operand 312 states and 463 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:16:05,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:05,741 INFO L93 Difference]: Finished difference Result 365 states and 523 transitions. [2025-03-08 11:16:05,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 11:16:05,742 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2025-03-08 11:16:05,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:05,744 INFO L225 Difference]: With dead ends: 365 [2025-03-08 11:16:05,744 INFO L226 Difference]: Without dead ends: 363 [2025-03-08 11:16:05,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=341, Invalid=849, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 11:16:05,745 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 202 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:05,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1039 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 11:16:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-08 11:16:05,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 309. [2025-03-08 11:16:05,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 201 states have (on average 1.2686567164179106) internal successors, (255), 201 states have internal predecessors, (255), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 11:16:05,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 459 transitions. [2025-03-08 11:16:05,762 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 459 transitions. Word has length 216 [2025-03-08 11:16:05,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:05,762 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 459 transitions. [2025-03-08 11:16:05,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:16:05,762 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 459 transitions. [2025-03-08 11:16:05,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-08 11:16:05,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:05,763 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:16:05,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 11:16:05,763 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:05,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:05,764 INFO L85 PathProgramCache]: Analyzing trace with hash 658941500, now seen corresponding path program 1 times [2025-03-08 11:16:05,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:05,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029081665] [2025-03-08 11:16:05,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:05,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:05,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-08 11:16:05,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-08 11:16:05,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:05,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat