./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-91.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 98e66c61c01623c41b31710156dd9accf1ba643ca7c07eb5ec3e619f761304a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:34:48,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:34:48,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:34:48,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:34:48,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:34:48,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:34:48,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:34:48,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:34:48,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:34:48,223 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:34:48,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:34:48,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:34:48,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:34:48,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:34:48,225 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:34:48,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:34:48,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:34:48,225 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:34:48,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:34:48,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:34:48,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:34:48,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:34:48,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:34:48,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:34:48,225 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:34:48,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:34:48,225 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:34:48,225 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:34:48,225 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:34:48,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:34:48,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:34:48,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:34:48,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:34:48,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:34:48,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:34:48,226 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:34:48,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:34:48,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:34:48,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:34:48,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:34:48,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:34:48,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:34:48,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:34:48,226 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 -> 98e66c61c01623c41b31710156dd9accf1ba643ca7c07eb5ec3e619f761304a5 [2025-03-17 04:34:48,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:34:48,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:34:48,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:34:48,469 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:34:48,469 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:34:48,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-91.i [2025-03-17 04:34:49,624 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/671d13782/f031f42f151a4883b9ba6eee5a5a0fc3/FLAG664233c9a [2025-03-17 04:34:49,903 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:34:49,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-91.i [2025-03-17 04:34:49,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/671d13782/f031f42f151a4883b9ba6eee5a5a0fc3/FLAG664233c9a [2025-03-17 04:34:49,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/671d13782/f031f42f151a4883b9ba6eee5a5a0fc3 [2025-03-17 04:34:49,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:34:49,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:34:49,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:34:49,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:34:49,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:34:49,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:34:49" (1/1) ... [2025-03-17 04:34:49,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62d98f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:49, skipping insertion in model container [2025-03-17 04:34:49,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:34:49" (1/1) ... [2025-03-17 04:34:49,952 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:34:50,055 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_operatoramount_amount250_file-91.i[916,929] [2025-03-17 04:34:50,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:34:50,215 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:34:50,223 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_operatoramount_amount250_file-91.i[916,929] [2025-03-17 04:34:50,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:34:50,303 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:34:50,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:50 WrapperNode [2025-03-17 04:34:50,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:34:50,304 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:34:50,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:34:50,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:34:50,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:50" (1/1) ... [2025-03-17 04:34:50,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:50" (1/1) ... [2025-03-17 04:34:50,398 INFO L138 Inliner]: procedures = 26, calls = 70, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 512 [2025-03-17 04:34:50,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:34:50,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:34:50,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:34:50,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:34:50,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:50" (1/1) ... [2025-03-17 04:34:50,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:50" (1/1) ... [2025-03-17 04:34:50,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:50" (1/1) ... [2025-03-17 04:34:50,463 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-17 04:34:50,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:50" (1/1) ... [2025-03-17 04:34:50,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:50" (1/1) ... [2025-03-17 04:34:50,492 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:50" (1/1) ... [2025-03-17 04:34:50,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:50" (1/1) ... [2025-03-17 04:34:50,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:50" (1/1) ... [2025-03-17 04:34:50,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:50" (1/1) ... [2025-03-17 04:34:50,517 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:34:50,519 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:34:50,520 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:34:50,520 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:34:50,521 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:50" (1/1) ... [2025-03-17 04:34:50,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:34:50,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:34:50,550 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-17 04:34:50,553 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-17 04:34:50,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:34:50,570 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:34:50,570 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:34:50,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:34:50,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:34:50,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:34:50,692 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:34:50,693 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:34:51,406 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L372: havoc property_#t~bitwise44#1;havoc property_#t~bitwise45#1;havoc property_#t~short46#1;havoc property_#t~bitwise47#1;havoc property_#t~short48#1;havoc property_#t~bitwise49#1;havoc property_#t~bitwise50#1;havoc property_#t~short51#1;havoc property_#t~ite53#1;havoc property_#t~bitwise52#1;havoc property_#t~short54#1; [2025-03-17 04:34:51,472 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-03-17 04:34:51,472 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:34:51,505 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:34:51,505 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:34:51,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:34:51 BoogieIcfgContainer [2025-03-17 04:34:51,505 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:34:51,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:34:51,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:34:51,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:34:51,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:34:49" (1/3) ... [2025-03-17 04:34:51,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6859e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:34:51, skipping insertion in model container [2025-03-17 04:34:51,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:50" (2/3) ... [2025-03-17 04:34:51,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6859e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:34:51, skipping insertion in model container [2025-03-17 04:34:51,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:34:51" (3/3) ... [2025-03-17 04:34:51,514 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-91.i [2025-03-17 04:34:51,527 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:34:51,530 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-91.i that has 2 procedures, 207 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:34:51,585 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:34:51,594 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;@7d2c3c34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:34:51,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:34:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 147 states have (on average 1.5034013605442176) internal successors, (221), 148 states have internal predecessors, (221), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 04:34:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-17 04:34:51,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:51,625 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:34:51,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:51,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:51,631 INFO L85 PathProgramCache]: Analyzing trace with hash -784860088, now seen corresponding path program 1 times [2025-03-17 04:34:51,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:51,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931231732] [2025-03-17 04:34:51,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:51,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:51,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-17 04:34:51,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-17 04:34:51,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:51,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2025-03-17 04:34:52,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:34:52,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931231732] [2025-03-17 04:34:52,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931231732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:34:52,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238102554] [2025-03-17 04:34:52,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:52,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:34:52,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:34:52,076 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-17 04:34:52,077 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-17 04:34:52,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-17 04:34:52,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-17 04:34:52,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:52,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:52,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:34:52,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:34:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2025-03-17 04:34:52,376 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:34:52,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238102554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:34:52,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:34:52,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:34:52,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228738184] [2025-03-17 04:34:52,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:34:52,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:34:52,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:34:52,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:34:52,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:34:52,409 INFO L87 Difference]: Start difference. First operand has 207 states, 147 states have (on average 1.5034013605442176) internal successors, (221), 148 states have internal predecessors, (221), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) Second operand has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) [2025-03-17 04:34:52,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:34:52,468 INFO L93 Difference]: Finished difference Result 410 states and 723 transitions. [2025-03-17 04:34:52,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:34:52,471 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) Word has length 372 [2025-03-17 04:34:52,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:34:52,481 INFO L225 Difference]: With dead ends: 410 [2025-03-17 04:34:52,481 INFO L226 Difference]: Without dead ends: 204 [2025-03-17 04:34:52,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 373 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-17 04:34:52,490 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:34:52,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 316 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:34:52,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-17 04:34:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-17 04:34:52,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 145 states have (on average 1.4758620689655173) internal successors, (214), 145 states have internal predecessors, (214), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 04:34:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 328 transitions. [2025-03-17 04:34:52,558 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 328 transitions. Word has length 372 [2025-03-17 04:34:52,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:34:52,558 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 328 transitions. [2025-03-17 04:34:52,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) [2025-03-17 04:34:52,559 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 328 transitions. [2025-03-17 04:34:52,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-17 04:34:52,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:52,567 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:34:52,576 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-17 04:34:52,768 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-17 04:34:52,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:52,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash 939389043, now seen corresponding path program 1 times [2025-03-17 04:34:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:52,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600103816] [2025-03-17 04:34:52,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:52,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:52,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-17 04:34:52,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-17 04:34:52,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:52,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-17 04:34:53,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:34:53,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600103816] [2025-03-17 04:34:53,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600103816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:34:53,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:34:53,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:34:53,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197547958] [2025-03-17 04:34:53,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:34:53,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:34:53,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:34:53,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:34:53,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:34:53,110 INFO L87 Difference]: Start difference. First operand 204 states and 328 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-17 04:34:53,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:34:53,290 INFO L93 Difference]: Finished difference Result 601 states and 964 transitions. [2025-03-17 04:34:53,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:34:53,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 372 [2025-03-17 04:34:53,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:34:53,299 INFO L225 Difference]: With dead ends: 601 [2025-03-17 04:34:53,299 INFO L226 Difference]: Without dead ends: 398 [2025-03-17 04:34:53,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:34:53,303 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 299 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:34:53,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 753 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:34:53,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-17 04:34:53,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 261. [2025-03-17 04:34:53,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 202 states have (on average 1.4851485148514851) internal successors, (300), 202 states have internal predecessors, (300), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 04:34:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 414 transitions. [2025-03-17 04:34:53,340 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 414 transitions. Word has length 372 [2025-03-17 04:34:53,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:34:53,342 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 414 transitions. [2025-03-17 04:34:53,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-17 04:34:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 414 transitions. [2025-03-17 04:34:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-17 04:34:53,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:53,347 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:34:53,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:34:53,347 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:53,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:53,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1368264590, now seen corresponding path program 1 times [2025-03-17 04:34:53,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:53,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704960171] [2025-03-17 04:34:53,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:53,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:53,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-17 04:34:53,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-17 04:34:53,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:53,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:53,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-17 04:34:53,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:34:53,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704960171] [2025-03-17 04:34:53,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704960171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:34:53,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:34:53,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:34:53,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092473921] [2025-03-17 04:34:53,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:34:53,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:34:53,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:34:53,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:34:53,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:34:53,655 INFO L87 Difference]: Start difference. First operand 261 states and 414 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-17 04:34:53,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:34:53,736 INFO L93 Difference]: Finished difference Result 461 states and 735 transitions. [2025-03-17 04:34:53,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:34:53,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 372 [2025-03-17 04:34:53,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:34:53,739 INFO L225 Difference]: With dead ends: 461 [2025-03-17 04:34:53,741 INFO L226 Difference]: Without dead ends: 201 [2025-03-17 04:34:53,742 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-17 04:34:53,742 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 293 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:34:53,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 277 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:34:53,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-17 04:34:53,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-03-17 04:34:53,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 142 states have internal predecessors, (195), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 04:34:53,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 309 transitions. [2025-03-17 04:34:53,758 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 309 transitions. Word has length 372 [2025-03-17 04:34:53,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:34:53,758 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 309 transitions. [2025-03-17 04:34:53,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-17 04:34:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 309 transitions. [2025-03-17 04:34:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-17 04:34:53,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:53,762 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:34:53,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:34:53,762 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:53,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:53,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1057854348, now seen corresponding path program 1 times [2025-03-17 04:34:53,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:53,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747561479] [2025-03-17 04:34:53,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:53,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:53,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-17 04:34:53,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-17 04:34:53,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:53,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-17 04:34:54,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:34:54,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747561479] [2025-03-17 04:34:54,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747561479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:34:54,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:34:54,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:34:54,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723026315] [2025-03-17 04:34:54,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:34:54,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:34:54,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:34:54,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:34:54,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:34:54,508 INFO L87 Difference]: Start difference. First operand 201 states and 309 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2025-03-17 04:34:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:34:55,053 INFO L93 Difference]: Finished difference Result 602 states and 927 transitions. [2025-03-17 04:34:55,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:34:55,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) Word has length 373 [2025-03-17 04:34:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:34:55,058 INFO L225 Difference]: With dead ends: 602 [2025-03-17 04:34:55,058 INFO L226 Difference]: Without dead ends: 402 [2025-03-17 04:34:55,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:34:55,059 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 210 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:34:55,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 952 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:34:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-17 04:34:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 399. [2025-03-17 04:34:55,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 282 states have (on average 1.372340425531915) internal successors, (387), 282 states have internal predecessors, (387), 114 states have call successors, (114), 2 states have call predecessors, (114), 2 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-17 04:34:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 615 transitions. [2025-03-17 04:34:55,111 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 615 transitions. Word has length 373 [2025-03-17 04:34:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:34:55,113 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 615 transitions. [2025-03-17 04:34:55,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2025-03-17 04:34:55,113 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 615 transitions. [2025-03-17 04:34:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-17 04:34:55,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:55,118 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:34:55,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:34:55,118 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:55,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:55,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1387620109, now seen corresponding path program 1 times [2025-03-17 04:34:55,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:55,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947594898] [2025-03-17 04:34:55,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:55,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:55,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-17 04:34:55,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-17 04:34:55,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:55,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-17 04:34:55,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:34:55,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947594898] [2025-03-17 04:34:55,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947594898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:34:55,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:34:55,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:34:55,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341032225] [2025-03-17 04:34:55,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:34:55,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:34:55,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:34:55,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:34:55,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:34:55,662 INFO L87 Difference]: Start difference. First operand 399 states and 615 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2025-03-17 04:34:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:34:55,832 INFO L93 Difference]: Finished difference Result 800 states and 1232 transitions. [2025-03-17 04:34:55,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:34:55,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) Word has length 373 [2025-03-17 04:34:55,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:34:55,836 INFO L225 Difference]: With dead ends: 800 [2025-03-17 04:34:55,836 INFO L226 Difference]: Without dead ends: 402 [2025-03-17 04:34:55,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:34:55,843 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 225 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:34:55,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 925 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:34:55,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-17 04:34:55,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 399. [2025-03-17 04:34:55,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 282 states have (on average 1.3652482269503545) internal successors, (385), 282 states have internal predecessors, (385), 114 states have call successors, (114), 2 states have call predecessors, (114), 2 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-17 04:34:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 613 transitions. [2025-03-17 04:34:55,892 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 613 transitions. Word has length 373 [2025-03-17 04:34:55,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:34:55,897 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 613 transitions. [2025-03-17 04:34:55,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2025-03-17 04:34:55,898 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 613 transitions. [2025-03-17 04:34:55,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-17 04:34:55,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:55,901 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:34:55,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:34:55,901 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:55,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:55,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1426623005, now seen corresponding path program 1 times [2025-03-17 04:34:55,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:55,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304259331] [2025-03-17 04:34:55,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:55,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:55,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-17 04:34:56,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-17 04:34:56,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:56,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat