./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-67.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_amount500_file-67.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 b19aaffa51fcf58d16591b444a0f2c1fb8f77cc866d774e0cbbccf08602937b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:35:14,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:35:14,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:35:14,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:35:14,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:35:14,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:35:14,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:35:14,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:35:14,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:35:14,258 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:35:14,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:35:14,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:35:14,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:35:14,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:35:14,260 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:35:14,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:35:14,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:35:14,260 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:35:14,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:35:14,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:35:14,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:35:14,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:35:14,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:35:14,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:35:14,261 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:35:14,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:35:14,261 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:35:14,261 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:35:14,261 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:35:14,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:35:14,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:35:14,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:35:14,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:35:14,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:35:14,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:35:14,262 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:35:14,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:35:14,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:35:14,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:35:14,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:35:14,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:35:14,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:35:14,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:35:14,263 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 -> b19aaffa51fcf58d16591b444a0f2c1fb8f77cc866d774e0cbbccf08602937b4 [2025-03-04 00:35:14,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:35:14,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:35:14,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:35:14,511 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:35:14,511 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:35:14,513 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-67.i [2025-03-04 00:35:15,698 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1638676d/1ab44a2233d44644be66518dc167e175/FLAG02b8e3d0c [2025-03-04 00:35:16,017 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:35:16,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-67.i [2025-03-04 00:35:16,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1638676d/1ab44a2233d44644be66518dc167e175/FLAG02b8e3d0c [2025-03-04 00:35:16,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1638676d/1ab44a2233d44644be66518dc167e175 [2025-03-04 00:35:16,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:35:16,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:35:16,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:35:16,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:35:16,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:35:16,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:35:16" (1/1) ... [2025-03-04 00:35:16,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e2ed5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:16, skipping insertion in model container [2025-03-04 00:35:16,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:35:16" (1/1) ... [2025-03-04 00:35:16,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:35:16,239 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_amount500_file-67.i[916,929] [2025-03-04 00:35:16,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:35:16,479 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:35:16,486 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_amount500_file-67.i[916,929] [2025-03-04 00:35:16,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:35:16,573 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:35:16,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:16 WrapperNode [2025-03-04 00:35:16,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:35:16,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:35:16,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:35:16,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:35:16,582 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:35:16" (1/1) ... [2025-03-04 00:35:16,603 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:35:16" (1/1) ... [2025-03-04 00:35:16,685 INFO L138 Inliner]: procedures = 26, calls = 91, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 762 [2025-03-04 00:35:16,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:35:16,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:35:16,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:35:16,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:35:16,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:16" (1/1) ... [2025-03-04 00:35:16,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:16" (1/1) ... [2025-03-04 00:35:16,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:16" (1/1) ... [2025-03-04 00:35:16,795 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:35:16,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:16" (1/1) ... [2025-03-04 00:35:16,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:16" (1/1) ... [2025-03-04 00:35:16,818 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:16" (1/1) ... [2025-03-04 00:35:16,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:16" (1/1) ... [2025-03-04 00:35:16,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:16" (1/1) ... [2025-03-04 00:35:16,836 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:16" (1/1) ... [2025-03-04 00:35:16,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:35:16,855 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:35:16,855 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:35:16,855 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:35:16,856 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:16" (1/1) ... [2025-03-04 00:35:16,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:35:16,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:35:16,882 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:35:16,885 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:35:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:35:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:35:16,903 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:35:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:35:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:35:16,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:35:17,013 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:35:17,015 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:35:17,906 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L641: havoc property_#t~bitwise55#1;havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~short58#1;havoc property_#t~bitwise59#1;havoc property_#t~bitwise60#1;havoc property_#t~bitwise61#1;havoc property_#t~short62#1;havoc property_#t~bitwise63#1;havoc property_#t~bitwise64#1;havoc property_#t~short65#1;havoc property_#t~bitwise66#1;havoc property_#t~short67#1; [2025-03-04 00:35:18,026 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-03-04 00:35:18,027 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:35:18,060 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:35:18,061 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:35:18,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:35:18 BoogieIcfgContainer [2025-03-04 00:35:18,061 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:35:18,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:35:18,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:35:18,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:35:18,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:35:16" (1/3) ... [2025-03-04 00:35:18,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b66266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:35:18, skipping insertion in model container [2025-03-04 00:35:18,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:16" (2/3) ... [2025-03-04 00:35:18,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b66266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:35:18, skipping insertion in model container [2025-03-04 00:35:18,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:35:18" (3/3) ... [2025-03-04 00:35:18,070 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-67.i [2025-03-04 00:35:18,081 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:35:18,085 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-67.i that has 2 procedures, 299 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:35:18,159 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:35:18,172 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;@63af6887, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:35:18,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:35:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 299 states, 218 states have (on average 1.5504587155963303) internal successors, (338), 219 states have internal predecessors, (338), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 00:35:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-04 00:35:18,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:18,197 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:18,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:18,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:18,209 INFO L85 PathProgramCache]: Analyzing trace with hash 502695856, now seen corresponding path program 1 times [2025-03-04 00:35:18,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:18,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070951872] [2025-03-04 00:35:18,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:18,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:18,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-04 00:35:18,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-04 00:35:18,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:18,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 11858 trivial. 0 not checked. [2025-03-04 00:35:18,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:18,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070951872] [2025-03-04 00:35:18,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070951872] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:35:18,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248762476] [2025-03-04 00:35:18,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:18,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:35:18,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:35:18,781 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:35:18,785 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:35:18,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-04 00:35:19,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-04 00:35:19,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:19,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:19,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:35:19,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:35:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 11858 trivial. 0 not checked. [2025-03-04 00:35:19,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:35:19,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248762476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:19,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:35:19,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:35:19,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707197567] [2025-03-04 00:35:19,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:19,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:35:19,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:19,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:35:19,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:35:19,211 INFO L87 Difference]: Start difference. First operand has 299 states, 218 states have (on average 1.5504587155963303) internal successors, (338), 219 states have internal predecessors, (338), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) Second operand has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (78), 2 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 2 states have call successors, (78) [2025-03-04 00:35:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:19,295 INFO L93 Difference]: Finished difference Result 592 states and 1061 transitions. [2025-03-04 00:35:19,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:35:19,298 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (78), 2 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 2 states have call successors, (78) Word has length 517 [2025-03-04 00:35:19,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:19,304 INFO L225 Difference]: With dead ends: 592 [2025-03-04 00:35:19,304 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 00:35:19,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 518 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:35:19,310 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:19,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 470 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:35:19,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 00:35:19,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-03-04 00:35:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 216 states have (on average 1.5277777777777777) internal successors, (330), 216 states have internal predecessors, (330), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 00:35:19,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 486 transitions. [2025-03-04 00:35:19,374 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 486 transitions. Word has length 517 [2025-03-04 00:35:19,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:19,375 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 486 transitions. [2025-03-04 00:35:19,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (78), 2 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 2 states have call successors, (78) [2025-03-04 00:35:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 486 transitions. [2025-03-04 00:35:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-04 00:35:19,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:19,384 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:19,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:35:19,585 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:35:19,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:19,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:19,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1182542568, now seen corresponding path program 1 times [2025-03-04 00:35:19,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:19,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144542897] [2025-03-04 00:35:19,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:19,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:19,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-04 00:35:19,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-04 00:35:19,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:19,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:35:20,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:20,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144542897] [2025-03-04 00:35:20,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144542897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:20,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:20,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:35:20,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951587882] [2025-03-04 00:35:20,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:20,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:35:20,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:20,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:35:20,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:35:20,183 INFO L87 Difference]: Start difference. First operand 296 states and 486 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:35:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:20,305 INFO L93 Difference]: Finished difference Result 865 states and 1422 transitions. [2025-03-04 00:35:20,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:35:20,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 517 [2025-03-04 00:35:20,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:20,312 INFO L225 Difference]: With dead ends: 865 [2025-03-04 00:35:20,313 INFO L226 Difference]: Without dead ends: 572 [2025-03-04 00:35:20,314 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:35:20,314 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 432 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:20,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1206 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:35:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-04 00:35:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 333. [2025-03-04 00:35:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 253 states have (on average 1.565217391304348) internal successors, (396), 253 states have internal predecessors, (396), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 00:35:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 552 transitions. [2025-03-04 00:35:20,367 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 552 transitions. Word has length 517 [2025-03-04 00:35:20,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:20,371 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 552 transitions. [2025-03-04 00:35:20,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:35:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 552 transitions. [2025-03-04 00:35:20,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-04 00:35:20,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:20,380 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:20,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:35:20,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:20,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:20,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1035215385, now seen corresponding path program 1 times [2025-03-04 00:35:20,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:20,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186892783] [2025-03-04 00:35:20,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:20,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:20,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-04 00:35:20,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-04 00:35:20,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:20,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:35:20,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:20,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186892783] [2025-03-04 00:35:20,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186892783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:20,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:20,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:35:20,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346361544] [2025-03-04 00:35:20,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:20,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:35:20,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:20,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:35:20,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:35:20,895 INFO L87 Difference]: Start difference. First operand 333 states and 552 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:35:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:21,027 INFO L93 Difference]: Finished difference Result 932 states and 1547 transitions. [2025-03-04 00:35:21,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:35:21,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 517 [2025-03-04 00:35:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:21,037 INFO L225 Difference]: With dead ends: 932 [2025-03-04 00:35:21,037 INFO L226 Difference]: Without dead ends: 602 [2025-03-04 00:35:21,038 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:35:21,039 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 331 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:21,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1036 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:35:21,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-04 00:35:21,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 598. [2025-03-04 00:35:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 474 states have (on average 1.5843881856540085) internal successors, (751), 475 states have internal predecessors, (751), 121 states have call successors, (121), 2 states have call predecessors, (121), 2 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2025-03-04 00:35:21,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 993 transitions. [2025-03-04 00:35:21,095 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 993 transitions. Word has length 517 [2025-03-04 00:35:21,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:21,096 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 993 transitions. [2025-03-04 00:35:21,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:35:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 993 transitions. [2025-03-04 00:35:21,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-04 00:35:21,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:21,106 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:21,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:35:21,107 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:21,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:21,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1387306824, now seen corresponding path program 1 times [2025-03-04 00:35:21,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:21,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170856340] [2025-03-04 00:35:21,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:21,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:21,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-04 00:35:21,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-04 00:35:21,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:21,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:35:21,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:21,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170856340] [2025-03-04 00:35:21,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170856340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:21,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:21,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:35:21,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045566551] [2025-03-04 00:35:21,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:21,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:35:21,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:21,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:35:21,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:35:21,468 INFO L87 Difference]: Start difference. First operand 598 states and 993 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:35:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:21,597 INFO L93 Difference]: Finished difference Result 1788 states and 2973 transitions. [2025-03-04 00:35:21,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:35:21,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 517 [2025-03-04 00:35:21,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:21,608 INFO L225 Difference]: With dead ends: 1788 [2025-03-04 00:35:21,609 INFO L226 Difference]: Without dead ends: 1193 [2025-03-04 00:35:21,611 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:35:21,612 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 438 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:21,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 904 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:35:21,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-03-04 00:35:21,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 780. [2025-03-04 00:35:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 656 states have (on average 1.6204268292682926) internal successors, (1063), 657 states have internal predecessors, (1063), 121 states have call successors, (121), 2 states have call predecessors, (121), 2 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2025-03-04 00:35:21,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1305 transitions. [2025-03-04 00:35:21,696 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1305 transitions. Word has length 517 [2025-03-04 00:35:21,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:21,697 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1305 transitions. [2025-03-04 00:35:21,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:35:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1305 transitions. [2025-03-04 00:35:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-04 00:35:21,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:21,707 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:21,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:35:21,708 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:21,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:21,709 INFO L85 PathProgramCache]: Analyzing trace with hash -142542343, now seen corresponding path program 1 times [2025-03-04 00:35:21,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:21,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689069081] [2025-03-04 00:35:21,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:21,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:21,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-04 00:35:21,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-04 00:35:21,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:21,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:35:22,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:22,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689069081] [2025-03-04 00:35:22,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689069081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:22,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:22,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:35:22,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19640437] [2025-03-04 00:35:22,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:22,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:35:22,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:22,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:35:22,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:35:22,503 INFO L87 Difference]: Start difference. First operand 780 states and 1305 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:35:22,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:22,948 INFO L93 Difference]: Finished difference Result 2271 states and 3810 transitions. [2025-03-04 00:35:22,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:35:22,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 517 [2025-03-04 00:35:22,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:22,956 INFO L225 Difference]: With dead ends: 2271 [2025-03-04 00:35:22,956 INFO L226 Difference]: Without dead ends: 1494 [2025-03-04 00:35:22,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:35:22,959 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 404 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:22,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1820 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:35:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2025-03-04 00:35:23,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 958. [2025-03-04 00:35:23,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 755 states have (on average 1.585430463576159) internal successors, (1197), 756 states have internal predecessors, (1197), 199 states have call successors, (199), 3 states have call predecessors, (199), 3 states have return successors, (199), 198 states have call predecessors, (199), 199 states have call successors, (199) [2025-03-04 00:35:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1595 transitions. [2025-03-04 00:35:23,072 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1595 transitions. Word has length 517 [2025-03-04 00:35:23,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:23,074 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 1595 transitions. [2025-03-04 00:35:23,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:35:23,075 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1595 transitions. [2025-03-04 00:35:23,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-04 00:35:23,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:23,083 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:23,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:35:23,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:23,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1039260128, now seen corresponding path program 1 times [2025-03-04 00:35:23,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:23,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017220246] [2025-03-04 00:35:23,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:23,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:23,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-04 00:35:23,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-04 00:35:23,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:23,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:35:23,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:23,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017220246] [2025-03-04 00:35:23,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017220246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:23,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:23,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:35:23,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683185555] [2025-03-04 00:35:23,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:23,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:35:23,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:23,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:35:23,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:35:23,559 INFO L87 Difference]: Start difference. First operand 958 states and 1595 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:35:23,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:23,728 INFO L93 Difference]: Finished difference Result 2424 states and 4051 transitions. [2025-03-04 00:35:23,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:35:23,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 518 [2025-03-04 00:35:23,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:23,740 INFO L225 Difference]: With dead ends: 2424 [2025-03-04 00:35:23,740 INFO L226 Difference]: Without dead ends: 1647 [2025-03-04 00:35:23,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:35:23,743 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 335 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:23,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1116 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:35:23,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2025-03-04 00:35:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1644. [2025-03-04 00:35:23,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1337 states have (on average 1.6013462976813762) internal successors, (2141), 1340 states have internal predecessors, (2141), 301 states have call successors, (301), 5 states have call predecessors, (301), 5 states have return successors, (301), 298 states have call predecessors, (301), 301 states have call successors, (301) [2025-03-04 00:35:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2743 transitions. [2025-03-04 00:35:23,897 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2743 transitions. Word has length 518 [2025-03-04 00:35:23,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:23,898 INFO L471 AbstractCegarLoop]: Abstraction has 1644 states and 2743 transitions. [2025-03-04 00:35:23,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:35:23,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2743 transitions. [2025-03-04 00:35:23,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-04 00:35:23,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:23,907 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:23,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:35:23,908 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:23,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:23,908 INFO L85 PathProgramCache]: Analyzing trace with hash 318100050, now seen corresponding path program 1 times [2025-03-04 00:35:23,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:23,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575992731] [2025-03-04 00:35:23,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:23,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:23,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-04 00:35:24,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-04 00:35:24,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:24,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:35:24,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:24,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575992731] [2025-03-04 00:35:24,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575992731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:24,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:24,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:35:24,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519082222] [2025-03-04 00:35:24,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:24,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:35:24,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:24,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:35:24,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:35:24,594 INFO L87 Difference]: Start difference. First operand 1644 states and 2743 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:35:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:25,898 INFO L93 Difference]: Finished difference Result 4391 states and 7287 transitions. [2025-03-04 00:35:25,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:35:25,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 518 [2025-03-04 00:35:25,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:25,913 INFO L225 Difference]: With dead ends: 4391 [2025-03-04 00:35:25,914 INFO L226 Difference]: Without dead ends: 2928 [2025-03-04 00:35:25,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:35:25,917 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 642 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 2137 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:25,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 2137 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:35:25,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2025-03-04 00:35:26,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2400. [2025-03-04 00:35:26,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 1952 states have (on average 1.5968237704918034) internal successors, (3117), 1956 states have internal predecessors, (3117), 438 states have call successors, (438), 9 states have call predecessors, (438), 9 states have return successors, (438), 434 states have call predecessors, (438), 438 states have call successors, (438) [2025-03-04 00:35:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3993 transitions. [2025-03-04 00:35:26,079 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3993 transitions. Word has length 518 [2025-03-04 00:35:26,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:26,079 INFO L471 AbstractCegarLoop]: Abstraction has 2400 states and 3993 transitions. [2025-03-04 00:35:26,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:35:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3993 transitions. [2025-03-04 00:35:26,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-04 00:35:26,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:26,087 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:26,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:35:26,087 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:26,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:26,088 INFO L85 PathProgramCache]: Analyzing trace with hash -874963982, now seen corresponding path program 1 times [2025-03-04 00:35:26,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:26,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798646565] [2025-03-04 00:35:26,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:26,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:26,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-04 00:35:26,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-04 00:35:26,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:26,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:35:26,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:26,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798646565] [2025-03-04 00:35:26,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798646565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:26,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:26,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:35:26,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079275787] [2025-03-04 00:35:26,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:26,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:35:26,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:26,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:35:26,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:35:26,795 INFO L87 Difference]: Start difference. First operand 2400 states and 3993 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:35:27,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:27,231 INFO L93 Difference]: Finished difference Result 5637 states and 9391 transitions. [2025-03-04 00:35:27,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:35:27,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 518 [2025-03-04 00:35:27,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:27,247 INFO L225 Difference]: With dead ends: 5637 [2025-03-04 00:35:27,248 INFO L226 Difference]: Without dead ends: 3418 [2025-03-04 00:35:27,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:35:27,254 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 338 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:27,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1322 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:35:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2025-03-04 00:35:27,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 2389. [2025-03-04 00:35:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2389 states, 1940 states have (on average 1.5989690721649485) internal successors, (3102), 1944 states have internal predecessors, (3102), 438 states have call successors, (438), 10 states have call predecessors, (438), 10 states have return successors, (438), 434 states have call predecessors, (438), 438 states have call successors, (438) [2025-03-04 00:35:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3978 transitions. [2025-03-04 00:35:27,445 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3978 transitions. Word has length 518 [2025-03-04 00:35:27,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:27,447 INFO L471 AbstractCegarLoop]: Abstraction has 2389 states and 3978 transitions. [2025-03-04 00:35:27,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:35:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3978 transitions. [2025-03-04 00:35:27,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-03-04 00:35:27,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:27,453 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:27,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:35:27,454 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:27,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:27,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1968028924, now seen corresponding path program 1 times [2025-03-04 00:35:27,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:27,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214434881] [2025-03-04 00:35:27,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:27,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:27,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-03-04 00:35:27,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-03-04 00:35:27,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:27,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:28,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:35:28,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:28,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214434881] [2025-03-04 00:35:28,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214434881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:28,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:28,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:35:28,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817935435] [2025-03-04 00:35:28,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:28,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:35:28,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:28,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:35:28,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:35:28,282 INFO L87 Difference]: Start difference. First operand 2389 states and 3978 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:35:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:29,214 INFO L93 Difference]: Finished difference Result 7039 states and 11782 transitions. [2025-03-04 00:35:29,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:35:29,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 519 [2025-03-04 00:35:29,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:29,233 INFO L225 Difference]: With dead ends: 7039 [2025-03-04 00:35:29,233 INFO L226 Difference]: Without dead ends: 4835 [2025-03-04 00:35:29,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:35:29,240 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 737 mSDsluCounter, 2481 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 3289 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:29,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 3289 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:35:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4835 states. [2025-03-04 00:35:29,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4835 to 3075. [2025-03-04 00:35:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3075 states, 2626 states have (on average 1.6283320639756282) internal successors, (4276), 2630 states have internal predecessors, (4276), 438 states have call successors, (438), 10 states have call predecessors, (438), 10 states have return successors, (438), 434 states have call predecessors, (438), 438 states have call successors, (438) [2025-03-04 00:35:29,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3075 states to 3075 states and 5152 transitions. [2025-03-04 00:35:29,442 INFO L78 Accepts]: Start accepts. Automaton has 3075 states and 5152 transitions. Word has length 519 [2025-03-04 00:35:29,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:29,443 INFO L471 AbstractCegarLoop]: Abstraction has 3075 states and 5152 transitions. [2025-03-04 00:35:29,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:35:29,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3075 states and 5152 transitions. [2025-03-04 00:35:29,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-03-04 00:35:29,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:29,451 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:29,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:35:29,451 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:29,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:29,452 INFO L85 PathProgramCache]: Analyzing trace with hash 359497808, now seen corresponding path program 1 times [2025-03-04 00:35:29,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:29,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824722889] [2025-03-04 00:35:29,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:29,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:29,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-03-04 00:35:30,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-03-04 00:35:30,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:30,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:35:30,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:30,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824722889] [2025-03-04 00:35:30,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824722889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:30,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:30,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:35:30,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541102790] [2025-03-04 00:35:30,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:30,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:35:30,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:30,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:35:30,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:35:30,526 INFO L87 Difference]: Start difference. First operand 3075 states and 5152 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:35:31,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:31,219 INFO L93 Difference]: Finished difference Result 9767 states and 16538 transitions. [2025-03-04 00:35:31,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:35:31,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 519 [2025-03-04 00:35:31,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:31,246 INFO L225 Difference]: With dead ends: 9767 [2025-03-04 00:35:31,246 INFO L226 Difference]: Without dead ends: 6847 [2025-03-04 00:35:31,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:35:31,253 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 1078 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:31,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 1673 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:35:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6847 states. [2025-03-04 00:35:31,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6847 to 3075. [2025-03-04 00:35:31,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3075 states, 2626 states have (on average 1.6275704493526275) internal successors, (4274), 2630 states have internal predecessors, (4274), 438 states have call successors, (438), 10 states have call predecessors, (438), 10 states have return successors, (438), 434 states have call predecessors, (438), 438 states have call successors, (438) [2025-03-04 00:35:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3075 states to 3075 states and 5150 transitions. [2025-03-04 00:35:31,467 INFO L78 Accepts]: Start accepts. Automaton has 3075 states and 5150 transitions. Word has length 519 [2025-03-04 00:35:31,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:31,468 INFO L471 AbstractCegarLoop]: Abstraction has 3075 states and 5150 transitions. [2025-03-04 00:35:31,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:35:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3075 states and 5150 transitions. [2025-03-04 00:35:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-03-04 00:35:31,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:31,473 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:31,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:35:31,474 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:31,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:31,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1622139308, now seen corresponding path program 1 times [2025-03-04 00:35:31,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:31,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194714649] [2025-03-04 00:35:31,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:31,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:31,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-03-04 00:35:32,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-03-04 00:35:32,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:32,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:35:45,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:45,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194714649] [2025-03-04 00:35:45,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194714649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:45,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:45,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-04 00:35:45,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303532524] [2025-03-04 00:35:45,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:45,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 00:35:45,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:45,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 00:35:45,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:35:45,590 INFO L87 Difference]: Start difference. First operand 3075 states and 5150 transitions. Second operand has 18 states, 18 states have (on average 7.333333333333333) internal successors, (132), 18 states have internal predecessors, (132), 2 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 2 states have call predecessors, (78), 2 states have call successors, (78) [2025-03-04 00:36:06,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:06,541 INFO L93 Difference]: Finished difference Result 10374 states and 17005 transitions. [2025-03-04 00:36:06,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 00:36:06,542 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.333333333333333) internal successors, (132), 18 states have internal predecessors, (132), 2 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 2 states have call predecessors, (78), 2 states have call successors, (78) Word has length 519 [2025-03-04 00:36:06,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:06,567 INFO L225 Difference]: With dead ends: 10374 [2025-03-04 00:36:06,567 INFO L226 Difference]: Without dead ends: 8170 [2025-03-04 00:36:06,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=366, Invalid=1040, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 00:36:06,574 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 4618 mSDsluCounter, 7076 mSDsCounter, 0 mSdLazyCounter, 6893 mSolverCounterSat, 1846 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4618 SdHoareTripleChecker+Valid, 7759 SdHoareTripleChecker+Invalid, 8739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1846 IncrementalHoareTripleChecker+Valid, 6893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:06,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4618 Valid, 7759 Invalid, 8739 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1846 Valid, 6893 Invalid, 0 Unknown, 0 Unchecked, 14.7s Time] [2025-03-04 00:36:06,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8170 states. [2025-03-04 00:36:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8170 to 5431. [2025-03-04 00:36:07,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5431 states, 4772 states have (on average 1.631810561609388) internal successors, (7787), 4782 states have internal predecessors, (7787), 640 states have call successors, (640), 18 states have call predecessors, (640), 18 states have return successors, (640), 630 states have call predecessors, (640), 640 states have call successors, (640) [2025-03-04 00:36:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5431 states to 5431 states and 9067 transitions. [2025-03-04 00:36:07,071 INFO L78 Accepts]: Start accepts. Automaton has 5431 states and 9067 transitions. Word has length 519 [2025-03-04 00:36:07,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:07,072 INFO L471 AbstractCegarLoop]: Abstraction has 5431 states and 9067 transitions. [2025-03-04 00:36:07,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.333333333333333) internal successors, (132), 18 states have internal predecessors, (132), 2 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 2 states have call predecessors, (78), 2 states have call successors, (78) [2025-03-04 00:36:07,073 INFO L276 IsEmpty]: Start isEmpty. Operand 5431 states and 9067 transitions. [2025-03-04 00:36:07,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-03-04 00:36:07,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:07,081 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:07,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:36:07,081 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:07,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:07,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1165276179, now seen corresponding path program 1 times [2025-03-04 00:36:07,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:07,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939962793] [2025-03-04 00:36:07,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:07,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:07,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-03-04 00:36:07,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-03-04 00:36:07,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:07,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 72 proven. 159 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2025-03-04 00:36:07,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:07,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939962793] [2025-03-04 00:36:07,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939962793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:36:07,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539307523] [2025-03-04 00:36:07,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:07,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:36:07,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:36:07,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:36:07,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:36:08,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-03-04 00:36:08,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-03-04 00:36:08,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:08,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:08,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 1280 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 00:36:08,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:36:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 5327 proven. 156 refuted. 0 times theorem prover too weak. 6529 trivial. 0 not checked. [2025-03-04 00:36:09,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:36:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 75 proven. 156 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2025-03-04 00:36:10,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539307523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:36:10,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:36:10,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 17 [2025-03-04 00:36:10,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219244976] [2025-03-04 00:36:10,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:36:10,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 00:36:10,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:10,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 00:36:10,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:36:10,174 INFO L87 Difference]: Start difference. First operand 5431 states and 9067 transitions. Second operand has 17 states, 17 states have (on average 19.764705882352942) internal successors, (336), 17 states have internal predecessors, (336), 5 states have call successors, (209), 3 states have call predecessors, (209), 6 states have return successors, (210), 5 states have call predecessors, (210), 5 states have call successors, (210) [2025-03-04 00:36:15,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:15,022 INFO L93 Difference]: Finished difference Result 27211 states and 44605 transitions. [2025-03-04 00:36:15,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-04 00:36:15,023 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 19.764705882352942) internal successors, (336), 17 states have internal predecessors, (336), 5 states have call successors, (209), 3 states have call predecessors, (209), 6 states have return successors, (210), 5 states have call predecessors, (210), 5 states have call successors, (210) Word has length 519 [2025-03-04 00:36:15,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:15,088 INFO L225 Difference]: With dead ends: 27211 [2025-03-04 00:36:15,088 INFO L226 Difference]: Without dead ends: 22064 [2025-03-04 00:36:15,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1096 GetRequests, 1030 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1467 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=3776, Unknown=0, NotChecked=0, Total=4556 [2025-03-04 00:36:15,103 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 4646 mSDsluCounter, 3342 mSDsCounter, 0 mSdLazyCounter, 2839 mSolverCounterSat, 1164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4673 SdHoareTripleChecker+Valid, 3891 SdHoareTripleChecker+Invalid, 4003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1164 IncrementalHoareTripleChecker+Valid, 2839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:15,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4673 Valid, 3891 Invalid, 4003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1164 Valid, 2839 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-04 00:36:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22064 states. [2025-03-04 00:36:16,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22064 to 16076. [2025-03-04 00:36:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16076 states, 14566 states have (on average 1.5931621584511877) internal successors, (23206), 14600 states have internal predecessors, (23206), 1427 states have call successors, (1427), 82 states have call predecessors, (1427), 82 states have return successors, (1427), 1393 states have call predecessors, (1427), 1427 states have call successors, (1427) [2025-03-04 00:36:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16076 states to 16076 states and 26060 transitions. [2025-03-04 00:36:16,511 INFO L78 Accepts]: Start accepts. Automaton has 16076 states and 26060 transitions. Word has length 519 [2025-03-04 00:36:16,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:16,512 INFO L471 AbstractCegarLoop]: Abstraction has 16076 states and 26060 transitions. [2025-03-04 00:36:16,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 19.764705882352942) internal successors, (336), 17 states have internal predecessors, (336), 5 states have call successors, (209), 3 states have call predecessors, (209), 6 states have return successors, (210), 5 states have call predecessors, (210), 5 states have call successors, (210) [2025-03-04 00:36:16,512 INFO L276 IsEmpty]: Start isEmpty. Operand 16076 states and 26060 transitions. [2025-03-04 00:36:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-04 00:36:16,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:16,527 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:16,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:36:16,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 00:36:16,732 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:16,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:16,733 INFO L85 PathProgramCache]: Analyzing trace with hash 145480905, now seen corresponding path program 1 times [2025-03-04 00:36:16,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:16,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315729240] [2025-03-04 00:36:16,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:16,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:16,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-04 00:36:16,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-04 00:36:16,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:16,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:36:17,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:17,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315729240] [2025-03-04 00:36:17,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315729240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:17,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:17,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:36:17,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191063516] [2025-03-04 00:36:17,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:17,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:36:17,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:17,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:36:17,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:36:17,499 INFO L87 Difference]: Start difference. First operand 16076 states and 26060 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:36:19,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:19,592 INFO L93 Difference]: Finished difference Result 30290 states and 49015 transitions. [2025-03-04 00:36:19,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:36:19,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 520 [2025-03-04 00:36:19,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:19,654 INFO L225 Difference]: With dead ends: 30290 [2025-03-04 00:36:19,654 INFO L226 Difference]: Without dead ends: 22857 [2025-03-04 00:36:19,671 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:36:19,672 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 609 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:19,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1952 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:36:19,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22857 states. [2025-03-04 00:36:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22857 to 18538. [2025-03-04 00:36:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18538 states, 17028 states have (on average 1.6066478740897345) internal successors, (27358), 17062 states have internal predecessors, (27358), 1427 states have call successors, (1427), 82 states have call predecessors, (1427), 82 states have return successors, (1427), 1393 states have call predecessors, (1427), 1427 states have call successors, (1427) [2025-03-04 00:36:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18538 states to 18538 states and 30212 transitions. [2025-03-04 00:36:21,564 INFO L78 Accepts]: Start accepts. Automaton has 18538 states and 30212 transitions. Word has length 520 [2025-03-04 00:36:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:21,565 INFO L471 AbstractCegarLoop]: Abstraction has 18538 states and 30212 transitions. [2025-03-04 00:36:21,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:36:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 18538 states and 30212 transitions. [2025-03-04 00:36:21,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-04 00:36:21,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:21,587 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:21,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:36:21,587 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:21,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:21,588 INFO L85 PathProgramCache]: Analyzing trace with hash 225371881, now seen corresponding path program 1 times [2025-03-04 00:36:21,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:21,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8067056] [2025-03-04 00:36:21,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:21,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:21,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-04 00:36:21,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-04 00:36:21,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:21,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:36:22,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:22,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8067056] [2025-03-04 00:36:22,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8067056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:22,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:22,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:36:22,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538683704] [2025-03-04 00:36:22,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:22,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:36:22,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:22,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:36:22,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:36:22,327 INFO L87 Difference]: Start difference. First operand 18538 states and 30212 transitions. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:36:27,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:27,727 INFO L93 Difference]: Finished difference Result 39843 states and 64029 transitions. [2025-03-04 00:36:27,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:36:27,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 520 [2025-03-04 00:36:27,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:27,825 INFO L225 Difference]: With dead ends: 39843 [2025-03-04 00:36:27,825 INFO L226 Difference]: Without dead ends: 35954 [2025-03-04 00:36:27,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-03-04 00:36:27,840 INFO L435 NwaCegarLoop]: 1839 mSDtfsCounter, 1971 mSDsluCounter, 3626 mSDsCounter, 0 mSdLazyCounter, 2662 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1971 SdHoareTripleChecker+Valid, 5465 SdHoareTripleChecker+Invalid, 3053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 2662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:27,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1971 Valid, 5465 Invalid, 3053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 2662 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-04 00:36:27,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35954 states. [2025-03-04 00:36:31,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35954 to 31056. [2025-03-04 00:36:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31056 states, 27557 states have (on average 1.5794897848096672) internal successors, (43526), 27636 states have internal predecessors, (43526), 3314 states have call successors, (3314), 184 states have call predecessors, (3314), 184 states have return successors, (3314), 3235 states have call predecessors, (3314), 3314 states have call successors, (3314) [2025-03-04 00:36:31,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31056 states to 31056 states and 50154 transitions. [2025-03-04 00:36:31,144 INFO L78 Accepts]: Start accepts. Automaton has 31056 states and 50154 transitions. Word has length 520 [2025-03-04 00:36:31,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:31,144 INFO L471 AbstractCegarLoop]: Abstraction has 31056 states and 50154 transitions. [2025-03-04 00:36:31,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:36:31,145 INFO L276 IsEmpty]: Start isEmpty. Operand 31056 states and 50154 transitions. [2025-03-04 00:36:31,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-04 00:36:31,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:31,164 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:31,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:36:31,165 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:31,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:31,165 INFO L85 PathProgramCache]: Analyzing trace with hash -967692151, now seen corresponding path program 1 times [2025-03-04 00:36:31,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:31,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405053334] [2025-03-04 00:36:31,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:31,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:31,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-04 00:36:31,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-04 00:36:31,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:31,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:31,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:36:31,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:31,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405053334] [2025-03-04 00:36:31,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405053334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:31,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:31,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:36:31,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960435182] [2025-03-04 00:36:31,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:31,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:36:31,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:31,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:36:31,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:36:31,793 INFO L87 Difference]: Start difference. First operand 31056 states and 50154 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78)