./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-45.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-45.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 b05815fd5cec927760044a6cdc6a3ae40876f51be4ef175e85dd936d2cf2ad8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:11:46,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:11:46,914 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:11:46,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:11:46,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:11:46,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:11:46,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:11:46,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:11:46,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:11:46,944 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:11:46,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:11:46,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:11:46,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:11:46,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:11:46,949 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:11:46,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:11:46,950 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:11:46,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:11:46,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:11:46,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:11:46,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:11:46,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:11:46,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:11:46,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:11:46,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:11:46,951 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 -> b05815fd5cec927760044a6cdc6a3ae40876f51be4ef175e85dd936d2cf2ad8e [2025-03-04 00:11:47,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:11:47,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:11:47,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:11:47,181 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:11:47,182 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:11:47,182 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-45.i [2025-03-04 00:11:48,372 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4f163724/c0db6a1da7f14f43b976c1ee4a1fc138/FLAG21b83f53e [2025-03-04 00:11:48,646 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:11:48,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-45.i [2025-03-04 00:11:48,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4f163724/c0db6a1da7f14f43b976c1ee4a1fc138/FLAG21b83f53e [2025-03-04 00:11:48,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4f163724/c0db6a1da7f14f43b976c1ee4a1fc138 [2025-03-04 00:11:48,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:11:48,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:11:48,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:11:48,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:11:48,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:11:48,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:11:48" (1/1) ... [2025-03-04 00:11:48,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b61000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:48, skipping insertion in model container [2025-03-04 00:11:48,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:11:48" (1/1) ... [2025-03-04 00:11:48,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:11:48,815 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-45.i[916,929] [2025-03-04 00:11:48,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:11:48,959 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:11:48,965 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-45.i[916,929] [2025-03-04 00:11:49,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:11:49,025 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:11:49,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:49 WrapperNode [2025-03-04 00:11:49,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:11:49,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:11:49,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:11:49,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:11:49,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:49" (1/1) ... [2025-03-04 00:11:49,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:49" (1/1) ... [2025-03-04 00:11:49,079 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 450 [2025-03-04 00:11:49,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:11:49,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:11:49,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:11:49,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:11:49,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:49" (1/1) ... [2025-03-04 00:11:49,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:49" (1/1) ... [2025-03-04 00:11:49,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:49" (1/1) ... [2025-03-04 00:11:49,108 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-04 00:11:49,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:49" (1/1) ... [2025-03-04 00:11:49,109 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:49" (1/1) ... [2025-03-04 00:11:49,126 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:49" (1/1) ... [2025-03-04 00:11:49,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:49" (1/1) ... [2025-03-04 00:11:49,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:49" (1/1) ... [2025-03-04 00:11:49,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:49" (1/1) ... [2025-03-04 00:11:49,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:11:49,143 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:11:49,143 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:11:49,143 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:11:49,144 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:49" (1/1) ... [2025-03-04 00:11:49,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:11:49,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:49,168 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-04 00:11:49,173 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-04 00:11:49,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:11:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:11:49,188 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:11:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:11:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:11:49,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:11:49,267 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:11:49,269 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:11:49,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L352: havoc property_#t~ite32#1;havoc property_#t~bitwise31#1;havoc property_#t~ite34#1;havoc property_#t~bitwise33#1;havoc property_#t~short35#1;havoc property_#t~bitwise36#1;havoc property_#t~short37#1;havoc property_#t~bitwise38#1;havoc property_#t~short39#1;havoc property_#t~ite41#1;havoc property_#t~bitwise40#1;havoc property_#t~short42#1; [2025-03-04 00:11:49,959 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-03-04 00:11:49,960 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:11:49,989 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:11:49,990 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:11:49,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:11:49 BoogieIcfgContainer [2025-03-04 00:11:49,991 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:11:49,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:11:49,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:11:49,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:11:49,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:11:48" (1/3) ... [2025-03-04 00:11:49,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c88c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:11:49, skipping insertion in model container [2025-03-04 00:11:49,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:49" (2/3) ... [2025-03-04 00:11:49,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c88c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:11:49, skipping insertion in model container [2025-03-04 00:11:49,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:11:49" (3/3) ... [2025-03-04 00:11:49,999 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-45.i [2025-03-04 00:11:50,011 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:11:50,012 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-45.i that has 2 procedures, 179 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:11:50,059 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:11:50,066 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;@3454ef05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:11:50,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:11:50,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 138 states have (on average 1.5072463768115942) internal successors, (208), 139 states have internal predecessors, (208), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 00:11:50,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-04 00:11:50,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:50,081 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:50,081 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:50,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:50,084 INFO L85 PathProgramCache]: Analyzing trace with hash -962456706, now seen corresponding path program 1 times [2025-03-04 00:11:50,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:50,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352624041] [2025-03-04 00:11:50,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:50,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:50,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-04 00:11:50,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-04 00:11:50,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:50,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2025-03-04 00:11:50,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:50,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352624041] [2025-03-04 00:11:50,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352624041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:50,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026858245] [2025-03-04 00:11:50,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:50,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:50,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:50,519 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-04 00:11:50,521 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-04 00:11:50,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-04 00:11:50,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-04 00:11:50,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:50,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:50,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:11:50,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2025-03-04 00:11:50,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:11:50,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026858245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:50,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:11:50,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:11:50,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692818298] [2025-03-04 00:11:50,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:50,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:11:50,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:50,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:11:50,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:11:50,797 INFO L87 Difference]: Start difference. First operand has 179 states, 138 states have (on average 1.5072463768115942) internal successors, (208), 139 states have internal predecessors, (208), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-04 00:11:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:50,844 INFO L93 Difference]: Finished difference Result 351 states and 599 transitions. [2025-03-04 00:11:50,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:11:50,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) Word has length 270 [2025-03-04 00:11:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:50,851 INFO L225 Difference]: With dead ends: 351 [2025-03-04 00:11:50,853 INFO L226 Difference]: Without dead ends: 175 [2025-03-04 00:11:50,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 271 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-04 00:11:50,860 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:50,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:11:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-04 00:11:50,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-04 00:11:50,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 135 states have (on average 1.4814814814814814) internal successors, (200), 135 states have internal predecessors, (200), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 00:11:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 276 transitions. [2025-03-04 00:11:50,909 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 276 transitions. Word has length 270 [2025-03-04 00:11:50,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:50,909 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 276 transitions. [2025-03-04 00:11:50,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-04 00:11:50,910 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 276 transitions. [2025-03-04 00:11:50,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-04 00:11:50,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:50,913 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:50,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:11:51,113 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-04 00:11:51,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:51,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:51,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1233520384, now seen corresponding path program 1 times [2025-03-04 00:11:51,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:51,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602590835] [2025-03-04 00:11:51,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:51,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:51,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-04 00:11:51,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-04 00:11:51,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:51,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:11:51,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:51,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602590835] [2025-03-04 00:11:51,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602590835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:51,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:51,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:11:51,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449152699] [2025-03-04 00:11:51,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:51,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:11:51,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:51,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:11:51,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:11:51,426 INFO L87 Difference]: Start difference. First operand 175 states and 276 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:11:51,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:51,530 INFO L93 Difference]: Finished difference Result 509 states and 804 transitions. [2025-03-04 00:11:51,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:11:51,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 270 [2025-03-04 00:11:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:51,534 INFO L225 Difference]: With dead ends: 509 [2025-03-04 00:11:51,534 INFO L226 Difference]: Without dead ends: 337 [2025-03-04 00:11:51,536 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-04 00:11:51,536 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 250 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:51,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 690 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:11:51,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-04 00:11:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 204. [2025-03-04 00:11:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 164 states have (on average 1.5) internal successors, (246), 164 states have internal predecessors, (246), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 00:11:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 322 transitions. [2025-03-04 00:11:51,554 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 322 transitions. Word has length 270 [2025-03-04 00:11:51,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:51,556 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 322 transitions. [2025-03-04 00:11:51,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:11:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 322 transitions. [2025-03-04 00:11:51,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-04 00:11:51,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:51,561 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:51,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:11:51,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:51,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:51,562 INFO L85 PathProgramCache]: Analyzing trace with hash -903754623, now seen corresponding path program 1 times [2025-03-04 00:11:51,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:51,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723787900] [2025-03-04 00:11:51,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:51,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:51,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-04 00:11:51,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-04 00:11:51,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:51,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:11:51,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:51,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723787900] [2025-03-04 00:11:51,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723787900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:51,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:51,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:11:51,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574623843] [2025-03-04 00:11:51,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:51,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:11:51,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:51,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:11:51,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:11:51,801 INFO L87 Difference]: Start difference. First operand 204 states and 322 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:11:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:51,910 INFO L93 Difference]: Finished difference Result 584 states and 923 transitions. [2025-03-04 00:11:51,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:11:51,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 270 [2025-03-04 00:11:51,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:51,913 INFO L225 Difference]: With dead ends: 584 [2025-03-04 00:11:51,913 INFO L226 Difference]: Without dead ends: 383 [2025-03-04 00:11:51,915 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-04 00:11:51,916 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 228 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:51,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 541 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:11:51,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-04 00:11:51,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 277. [2025-03-04 00:11:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 237 states have (on average 1.5232067510548524) internal successors, (361), 237 states have internal predecessors, (361), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 00:11:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 437 transitions. [2025-03-04 00:11:51,944 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 437 transitions. Word has length 270 [2025-03-04 00:11:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:51,945 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 437 transitions. [2025-03-04 00:11:51,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:11:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 437 transitions. [2025-03-04 00:11:51,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-04 00:11:51,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:51,949 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:51,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:11:51,949 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:51,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:51,950 INFO L85 PathProgramCache]: Analyzing trace with hash 465083105, now seen corresponding path program 1 times [2025-03-04 00:11:51,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:51,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397950037] [2025-03-04 00:11:51,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:51,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:51,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-04 00:11:52,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-04 00:11:52,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:52,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:11:52,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:52,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397950037] [2025-03-04 00:11:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397950037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:52,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:52,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:11:52,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128709710] [2025-03-04 00:11:52,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:52,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:11:52,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:52,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:11:52,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:11:52,170 INFO L87 Difference]: Start difference. First operand 277 states and 437 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:11:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:52,265 INFO L93 Difference]: Finished difference Result 694 states and 1092 transitions. [2025-03-04 00:11:52,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:11:52,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 270 [2025-03-04 00:11:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:52,268 INFO L225 Difference]: With dead ends: 694 [2025-03-04 00:11:52,268 INFO L226 Difference]: Without dead ends: 420 [2025-03-04 00:11:52,269 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-04 00:11:52,272 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 239 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:52,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 504 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:11:52,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-04 00:11:52,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 277. [2025-03-04 00:11:52,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 237 states have (on average 1.5147679324894514) internal successors, (359), 237 states have internal predecessors, (359), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 00:11:52,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 435 transitions. [2025-03-04 00:11:52,296 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 435 transitions. Word has length 270 [2025-03-04 00:11:52,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:52,296 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 435 transitions. [2025-03-04 00:11:52,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:11:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 435 transitions. [2025-03-04 00:11:52,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-04 00:11:52,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:52,300 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:52,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:11:52,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:52,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:52,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1231039355, now seen corresponding path program 1 times [2025-03-04 00:11:52,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:52,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620673140] [2025-03-04 00:11:52,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:52,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:52,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-04 00:11:52,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-04 00:11:52,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:52,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:11:52,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:52,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620673140] [2025-03-04 00:11:52,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620673140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:52,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:52,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:11:52,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571436817] [2025-03-04 00:11:52,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:52,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:11:52,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:52,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:11:52,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:11:52,822 INFO L87 Difference]: Start difference. First operand 277 states and 435 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:11:53,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:53,073 INFO L93 Difference]: Finished difference Result 888 states and 1400 transitions. [2025-03-04 00:11:53,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:11:53,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 270 [2025-03-04 00:11:53,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:53,076 INFO L225 Difference]: With dead ends: 888 [2025-03-04 00:11:53,076 INFO L226 Difference]: Without dead ends: 614 [2025-03-04 00:11:53,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-04 00:11:53,081 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 265 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:53,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 785 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:11:53,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-03-04 00:11:53,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 529. [2025-03-04 00:11:53,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 450 states have (on average 1.52) internal successors, (684), 450 states have internal predecessors, (684), 76 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-04 00:11:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 836 transitions. [2025-03-04 00:11:53,107 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 836 transitions. Word has length 270 [2025-03-04 00:11:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:53,107 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 836 transitions. [2025-03-04 00:11:53,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:11:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 836 transitions. [2025-03-04 00:11:53,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-04 00:11:53,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:53,110 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:53,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:11:53,110 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:53,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:53,111 INFO L85 PathProgramCache]: Analyzing trace with hash -873310979, now seen corresponding path program 1 times [2025-03-04 00:11:53,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:53,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107189166] [2025-03-04 00:11:53,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:53,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:53,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-04 00:11:53,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-04 00:11:53,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:53,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:11:53,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:53,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107189166] [2025-03-04 00:11:53,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107189166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:53,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:53,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:11:53,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937416014] [2025-03-04 00:11:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:53,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:11:53,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:53,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:11:53,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:11:53,488 INFO L87 Difference]: Start difference. First operand 529 states and 836 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:11:53,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:53,734 INFO L93 Difference]: Finished difference Result 1059 states and 1670 transitions. [2025-03-04 00:11:53,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:11:53,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 271 [2025-03-04 00:11:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:53,738 INFO L225 Difference]: With dead ends: 1059 [2025-03-04 00:11:53,739 INFO L226 Difference]: Without dead ends: 614 [2025-03-04 00:11:53,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-04 00:11:53,740 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 261 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:53,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 788 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:11:53,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-03-04 00:11:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 530. [2025-03-04 00:11:53,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 451 states have (on average 1.516629711751663) internal successors, (684), 451 states have internal predecessors, (684), 76 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-04 00:11:53,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 836 transitions. [2025-03-04 00:11:53,783 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 836 transitions. Word has length 271 [2025-03-04 00:11:53,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:53,783 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 836 transitions. [2025-03-04 00:11:53,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:11:53,784 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 836 transitions. [2025-03-04 00:11:53,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-04 00:11:53,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:53,786 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:53,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:11:53,786 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:53,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:53,787 INFO L85 PathProgramCache]: Analyzing trace with hash 415277829, now seen corresponding path program 1 times [2025-03-04 00:11:53,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:53,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925463689] [2025-03-04 00:11:53,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:53,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:53,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-04 00:11:53,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-04 00:11:53,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:53,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:54,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:11:54,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:54,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925463689] [2025-03-04 00:11:54,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925463689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:54,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:54,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:11:54,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449840392] [2025-03-04 00:11:54,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:54,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:11:54,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:54,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:11:54,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:11:54,114 INFO L87 Difference]: Start difference. First operand 530 states and 836 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:11:54,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:54,584 INFO L93 Difference]: Finished difference Result 1726 states and 2720 transitions. [2025-03-04 00:11:54,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:11:54,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 272 [2025-03-04 00:11:54,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:54,590 INFO L225 Difference]: With dead ends: 1726 [2025-03-04 00:11:54,590 INFO L226 Difference]: Without dead ends: 1359 [2025-03-04 00:11:54,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-04 00:11:54,592 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 446 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:54,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 872 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:11:54,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2025-03-04 00:11:54,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1329. [2025-03-04 00:11:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1172 states have (on average 1.5273037542662116) internal successors, (1790), 1172 states have internal predecessors, (1790), 152 states have call successors, (152), 4 states have call predecessors, (152), 4 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-04 00:11:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 2094 transitions. [2025-03-04 00:11:54,656 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 2094 transitions. Word has length 272 [2025-03-04 00:11:54,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:54,656 INFO L471 AbstractCegarLoop]: Abstraction has 1329 states and 2094 transitions. [2025-03-04 00:11:54,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:11:54,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 2094 transitions. [2025-03-04 00:11:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-04 00:11:54,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:54,659 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:54,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:11:54,660 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:54,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:54,660 INFO L85 PathProgramCache]: Analyzing trace with hash -785347517, now seen corresponding path program 1 times [2025-03-04 00:11:54,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:54,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464219279] [2025-03-04 00:11:54,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:54,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:54,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-04 00:11:54,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-04 00:11:54,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:54,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:11:55,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:55,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464219279] [2025-03-04 00:11:55,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464219279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:55,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:55,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:11:55,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552584727] [2025-03-04 00:11:55,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:55,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:11:55,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:55,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:11:55,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:11:55,915 INFO L87 Difference]: Start difference. First operand 1329 states and 2094 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-04 00:11:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:56,978 INFO L93 Difference]: Finished difference Result 4114 states and 6402 transitions. [2025-03-04 00:11:56,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:11:56,979 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 273 [2025-03-04 00:11:56,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:56,992 INFO L225 Difference]: With dead ends: 4114 [2025-03-04 00:11:56,992 INFO L226 Difference]: Without dead ends: 3814 [2025-03-04 00:11:56,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:11:56,995 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 2252 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2252 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:56,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2252 Valid, 947 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:11:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3814 states. [2025-03-04 00:11:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3814 to 2004. [2025-03-04 00:11:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 1804 states have (on average 1.528270509977827) internal successors, (2757), 1804 states have internal predecessors, (2757), 190 states have call successors, (190), 9 states have call predecessors, (190), 9 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2025-03-04 00:11:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 3137 transitions. [2025-03-04 00:11:57,091 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 3137 transitions. Word has length 273 [2025-03-04 00:11:57,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:57,092 INFO L471 AbstractCegarLoop]: Abstraction has 2004 states and 3137 transitions. [2025-03-04 00:11:57,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-04 00:11:57,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 3137 transitions. [2025-03-04 00:11:57,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-04 00:11:57,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:57,096 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:57,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:11:57,097 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:57,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:57,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1782419870, now seen corresponding path program 1 times [2025-03-04 00:11:57,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:57,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418098670] [2025-03-04 00:11:57,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:57,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:57,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-04 00:11:57,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-04 00:11:57,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:57,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:57,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:11:57,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:57,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418098670] [2025-03-04 00:11:57,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418098670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:57,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:57,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:11:57,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385539075] [2025-03-04 00:11:57,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:57,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:11:57,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:57,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:11:57,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:11:57,460 INFO L87 Difference]: Start difference. First operand 2004 states and 3137 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-04 00:11:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:57,604 INFO L93 Difference]: Finished difference Result 5593 states and 8755 transitions. [2025-03-04 00:11:57,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:11:57,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 273 [2025-03-04 00:11:57,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:57,619 INFO L225 Difference]: With dead ends: 5593 [2025-03-04 00:11:57,619 INFO L226 Difference]: Without dead ends: 3931 [2025-03-04 00:11:57,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-04 00:11:57,624 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 262 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:57,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 856 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:11:57,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2025-03-04 00:11:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 3925. [2025-03-04 00:11:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3925 states, 3566 states have (on average 1.5266404935501963) internal successors, (5444), 3566 states have internal predecessors, (5444), 342 states have call successors, (342), 16 states have call predecessors, (342), 16 states have return successors, (342), 342 states have call predecessors, (342), 342 states have call successors, (342) [2025-03-04 00:11:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 6128 transitions. [2025-03-04 00:11:57,777 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 6128 transitions. Word has length 273 [2025-03-04 00:11:57,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:57,778 INFO L471 AbstractCegarLoop]: Abstraction has 3925 states and 6128 transitions. [2025-03-04 00:11:57,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-04 00:11:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 6128 transitions. [2025-03-04 00:11:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-04 00:11:57,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:57,783 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:57,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:11:57,783 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:57,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:57,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1085870939, now seen corresponding path program 1 times [2025-03-04 00:11:57,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:57,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889096128] [2025-03-04 00:11:57,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:57,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:57,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-04 00:11:57,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-04 00:11:57,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:57,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:11:57,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:57,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889096128] [2025-03-04 00:11:57,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889096128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:57,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:57,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:11:57,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268431631] [2025-03-04 00:11:57,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:57,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:11:57,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:57,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:11:57,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:11:57,874 INFO L87 Difference]: Start difference. First operand 3925 states and 6128 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:11:57,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:57,998 INFO L93 Difference]: Finished difference Result 8822 states and 13794 transitions. [2025-03-04 00:11:57,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:11:57,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 274 [2025-03-04 00:11:57,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:58,015 INFO L225 Difference]: With dead ends: 8822 [2025-03-04 00:11:58,015 INFO L226 Difference]: Without dead ends: 4974 [2025-03-04 00:11:58,021 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-04 00:11:58,022 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 163 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:58,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 573 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:11:58,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4974 states. [2025-03-04 00:11:58,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4974 to 3930. [2025-03-04 00:11:58,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3930 states, 3571 states have (on average 1.5245029403528423) internal successors, (5444), 3571 states have internal predecessors, (5444), 342 states have call successors, (342), 16 states have call predecessors, (342), 16 states have return successors, (342), 342 states have call predecessors, (342), 342 states have call successors, (342) [2025-03-04 00:11:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3930 states to 3930 states and 6128 transitions. [2025-03-04 00:11:58,180 INFO L78 Accepts]: Start accepts. Automaton has 3930 states and 6128 transitions. Word has length 274 [2025-03-04 00:11:58,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:58,181 INFO L471 AbstractCegarLoop]: Abstraction has 3930 states and 6128 transitions. [2025-03-04 00:11:58,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:11:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3930 states and 6128 transitions. [2025-03-04 00:11:58,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-04 00:11:58,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:58,188 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:58,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:11:58,188 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:58,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:58,189 INFO L85 PathProgramCache]: Analyzing trace with hash -392478234, now seen corresponding path program 1 times [2025-03-04 00:11:58,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:58,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266364138] [2025-03-04 00:11:58,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:58,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:58,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-04 00:11:58,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-04 00:11:58,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:58,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:58,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-03-04 00:11:58,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:58,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266364138] [2025-03-04 00:11:58,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266364138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:58,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:58,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:11:58,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351685293] [2025-03-04 00:11:58,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:58,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:11:58,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:58,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:11:58,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:11:58,444 INFO L87 Difference]: Start difference. First operand 3930 states and 6128 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:11:58,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:58,748 INFO L93 Difference]: Finished difference Result 5356 states and 8339 transitions. [2025-03-04 00:11:58,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:11:58,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 274 [2025-03-04 00:11:58,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:58,763 INFO L225 Difference]: With dead ends: 5356 [2025-03-04 00:11:58,764 INFO L226 Difference]: Without dead ends: 3423 [2025-03-04 00:11:58,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-04 00:11:58,769 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 199 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:58,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 750 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:11:58,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3423 states. [2025-03-04 00:11:58,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3423 to 3329. [2025-03-04 00:11:58,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 2970 states have (on average 1.5171717171717172) internal successors, (4506), 2970 states have internal predecessors, (4506), 342 states have call successors, (342), 16 states have call predecessors, (342), 16 states have return successors, (342), 342 states have call predecessors, (342), 342 states have call successors, (342) [2025-03-04 00:11:58,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 5190 transitions. [2025-03-04 00:11:58,906 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 5190 transitions. Word has length 274 [2025-03-04 00:11:58,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:58,906 INFO L471 AbstractCegarLoop]: Abstraction has 3329 states and 5190 transitions. [2025-03-04 00:11:58,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2025-03-04 00:11:58,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 5190 transitions. [2025-03-04 00:11:58,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-04 00:11:58,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:58,909 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:58,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:11:58,910 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:58,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:58,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1534817931, now seen corresponding path program 1 times [2025-03-04 00:11:58,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:58,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063061030] [2025-03-04 00:11:58,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:58,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:58,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-04 00:11:59,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-04 00:11:59,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:59,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat