./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-81.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 8e61ad20a36349f4673d22f97854260433b62fc5e4079b00e6a93a15c6138c2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:48:04,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:48:04,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:48:04,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:48:04,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:48:04,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:48:04,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:48:04,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:48:04,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:48:04,632 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:48:04,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:48:04,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:48:04,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:48:04,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:48:04,633 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:48:04,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:48:04,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:48:04,633 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:48:04,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:48:04,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:48:04,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:48:04,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:48:04,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:48:04,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:48:04,633 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:48:04,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:48:04,633 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:48:04,633 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:48:04,633 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:48:04,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:48:04,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:48:04,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:48:04,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:48:04,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:48:04,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:48:04,634 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:48:04,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:48:04,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:48:04,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:48:04,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:48:04,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:48:04,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:48:04,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:48:04,634 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 -> 8e61ad20a36349f4673d22f97854260433b62fc5e4079b00e6a93a15c6138c2d [2025-03-08 15:48:04,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:48:04,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:48:04,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:48:04,852 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:48:04,853 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:48:04,854 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-81.i [2025-03-08 15:48:06,003 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda0922d7/12b0790c5d1347df8d111cf86c2acdf9/FLAGc8fe77c0e [2025-03-08 15:48:06,298 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:48:06,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-81.i [2025-03-08 15:48:06,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda0922d7/12b0790c5d1347df8d111cf86c2acdf9/FLAGc8fe77c0e [2025-03-08 15:48:06,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda0922d7/12b0790c5d1347df8d111cf86c2acdf9 [2025-03-08 15:48:06,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:48:06,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:48:06,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:48:06,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:48:06,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:48:06,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:48:06" (1/1) ... [2025-03-08 15:48:06,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e131198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:06, skipping insertion in model container [2025-03-08 15:48:06,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:48:06" (1/1) ... [2025-03-08 15:48:06,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:48:06,493 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-81.i[916,929] [2025-03-08 15:48:06,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:48:06,679 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:48:06,686 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-81.i[916,929] [2025-03-08 15:48:06,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:48:06,788 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:48:06,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:06 WrapperNode [2025-03-08 15:48:06,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:48:06,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:48:06,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:48:06,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:48:06,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:06" (1/1) ... [2025-03-08 15:48:06,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:06" (1/1) ... [2025-03-08 15:48:06,899 INFO L138 Inliner]: procedures = 26, calls = 89, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 811 [2025-03-08 15:48:06,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:48:06,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:48:06,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:48:06,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:48:06,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:06" (1/1) ... [2025-03-08 15:48:06,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:06" (1/1) ... [2025-03-08 15:48:06,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:06" (1/1) ... [2025-03-08 15:48:07,001 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:48:07,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:06" (1/1) ... [2025-03-08 15:48:07,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:06" (1/1) ... [2025-03-08 15:48:07,029 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:06" (1/1) ... [2025-03-08 15:48:07,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:06" (1/1) ... [2025-03-08 15:48:07,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:06" (1/1) ... [2025-03-08 15:48:07,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:06" (1/1) ... [2025-03-08 15:48:07,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:48:07,065 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:48:07,065 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:48:07,065 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:48:07,066 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:06" (1/1) ... [2025-03-08 15:48:07,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:48:07,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:48:07,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:48:07,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:48:07,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:48:07,109 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:48:07,109 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:48:07,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:48:07,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:48:07,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:48:07,218 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:48:07,219 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:48:08,120 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L671: havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~bitwise58#1;havoc property_#t~bitwise59#1;havoc property_#t~short60#1;havoc property_#t~bitwise61#1;havoc property_#t~short62#1;havoc property_#t~bitwise63#1;havoc property_#t~short64#1;havoc property_#t~bitwise65#1;havoc property_#t~short66#1;havoc property_#t~bitwise67#1;havoc property_#t~short68#1;havoc property_#t~ite70#1;havoc property_#t~bitwise69#1;havoc property_#t~short71#1; [2025-03-08 15:48:08,279 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2025-03-08 15:48:08,280 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:48:08,319 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:48:08,319 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:48:08,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:48:08 BoogieIcfgContainer [2025-03-08 15:48:08,320 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:48:08,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:48:08,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:48:08,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:48:08,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:48:06" (1/3) ... [2025-03-08 15:48:08,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61989e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:48:08, skipping insertion in model container [2025-03-08 15:48:08,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:06" (2/3) ... [2025-03-08 15:48:08,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61989e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:48:08, skipping insertion in model container [2025-03-08 15:48:08,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:48:08" (3/3) ... [2025-03-08 15:48:08,329 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-81.i [2025-03-08 15:48:08,339 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:48:08,343 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-81.i that has 2 procedures, 330 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:48:08,399 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:48:08,408 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;@83f758d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:48:08,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:48:08,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 330 states, 251 states have (on average 1.545816733067729) internal successors, (388), 252 states have internal predecessors, (388), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 15:48:08,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-08 15:48:08,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:08,434 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:08,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:08,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:08,439 INFO L85 PathProgramCache]: Analyzing trace with hash -614023678, now seen corresponding path program 1 times [2025-03-08 15:48:08,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:08,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391071623] [2025-03-08 15:48:08,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:08,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:08,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-08 15:48:08,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-08 15:48:08,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:08,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2025-03-08 15:48:09,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:09,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391071623] [2025-03-08 15:48:09,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391071623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:48:09,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185769339] [2025-03-08 15:48:09,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:09,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:48:09,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:48:09,036 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:48:09,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:48:09,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-08 15:48:09,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-08 15:48:09,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:09,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:09,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:48:09,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:48:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2025-03-08 15:48:09,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:48:09,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185769339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:09,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:48:09,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:48:09,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717662831] [2025-03-08 15:48:09,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:09,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:48:09,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:09,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:48:09,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:48:09,486 INFO L87 Difference]: Start difference. First operand has 330 states, 251 states have (on average 1.545816733067729) internal successors, (388), 252 states have internal predecessors, (388), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) Second operand has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (76), 2 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-08 15:48:09,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:09,579 INFO L93 Difference]: Finished difference Result 652 states and 1147 transitions. [2025-03-08 15:48:09,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:48:09,583 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (76), 2 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) Word has length 528 [2025-03-08 15:48:09,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:09,590 INFO L225 Difference]: With dead ends: 652 [2025-03-08 15:48:09,591 INFO L226 Difference]: Without dead ends: 325 [2025-03-08 15:48:09,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:48:09,600 INFO L435 NwaCegarLoop]: 513 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, 513 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-08 15:48:09,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 513 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:48:09,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-08 15:48:09,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2025-03-08 15:48:09,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 247 states have (on average 1.5263157894736843) internal successors, (377), 247 states have internal predecessors, (377), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 15:48:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 529 transitions. [2025-03-08 15:48:09,666 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 529 transitions. Word has length 528 [2025-03-08 15:48:09,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:09,666 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 529 transitions. [2025-03-08 15:48:09,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (76), 2 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-08 15:48:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 529 transitions. [2025-03-08 15:48:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-08 15:48:09,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:09,677 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:09,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:48:09,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:48:09,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:09,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:09,879 INFO L85 PathProgramCache]: Analyzing trace with hash 24244456, now seen corresponding path program 1 times [2025-03-08 15:48:09,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:09,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2548610] [2025-03-08 15:48:09,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:09,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:09,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-08 15:48:10,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-08 15:48:10,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:10,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:10,620 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:48:10,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:10,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2548610] [2025-03-08 15:48:10,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2548610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:10,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:10,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:48:10,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922470817] [2025-03-08 15:48:10,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:10,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:48:10,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:10,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:48:10,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:48:10,624 INFO L87 Difference]: Start difference. First operand 325 states and 529 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:11,045 INFO L93 Difference]: Finished difference Result 1040 states and 1689 transitions. [2025-03-08 15:48:11,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:48:11,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 528 [2025-03-08 15:48:11,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:11,055 INFO L225 Difference]: With dead ends: 1040 [2025-03-08 15:48:11,056 INFO L226 Difference]: Without dead ends: 718 [2025-03-08 15:48:11,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:48:11,058 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 695 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:11,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1590 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:48:11,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-03-08 15:48:11,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 663. [2025-03-08 15:48:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 508 states have (on average 1.531496062992126) internal successors, (778), 508 states have internal predecessors, (778), 152 states have call successors, (152), 2 states have call predecessors, (152), 2 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-08 15:48:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1082 transitions. [2025-03-08 15:48:11,120 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1082 transitions. Word has length 528 [2025-03-08 15:48:11,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:11,121 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 1082 transitions. [2025-03-08 15:48:11,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1082 transitions. [2025-03-08 15:48:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-08 15:48:11,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:11,129 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:11,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:48:11,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:11,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:11,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1241864876, now seen corresponding path program 1 times [2025-03-08 15:48:11,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:11,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157797699] [2025-03-08 15:48:11,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:11,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:11,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-08 15:48:11,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-08 15:48:11,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:11,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:48:11,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:11,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157797699] [2025-03-08 15:48:11,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157797699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:11,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:11,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:48:11,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603641592] [2025-03-08 15:48:11,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:11,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:48:11,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:11,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:48:11,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:11,431 INFO L87 Difference]: Start difference. First operand 663 states and 1082 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:11,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:11,510 INFO L93 Difference]: Finished difference Result 1727 states and 2828 transitions. [2025-03-08 15:48:11,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:48:11,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 529 [2025-03-08 15:48:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:11,516 INFO L225 Difference]: With dead ends: 1727 [2025-03-08 15:48:11,516 INFO L226 Difference]: Without dead ends: 1067 [2025-03-08 15:48:11,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:11,517 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 304 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:11,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1012 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:48:11,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2025-03-08 15:48:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 715. [2025-03-08 15:48:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 560 states have (on average 1.5446428571428572) internal successors, (865), 560 states have internal predecessors, (865), 152 states have call successors, (152), 2 states have call predecessors, (152), 2 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-08 15:48:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1169 transitions. [2025-03-08 15:48:11,582 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1169 transitions. Word has length 529 [2025-03-08 15:48:11,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:11,583 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1169 transitions. [2025-03-08 15:48:11,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:11,583 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1169 transitions. [2025-03-08 15:48:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-08 15:48:11,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:11,591 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:11,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:48:11,591 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:11,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:11,592 INFO L85 PathProgramCache]: Analyzing trace with hash 32622637, now seen corresponding path program 1 times [2025-03-08 15:48:11,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:11,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962841847] [2025-03-08 15:48:11,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:11,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:11,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-08 15:48:11,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-08 15:48:11,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:11,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:48:11,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:11,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962841847] [2025-03-08 15:48:11,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962841847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:11,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:11,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:48:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896475669] [2025-03-08 15:48:11,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:11,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:48:11,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:11,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:48:11,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:11,842 INFO L87 Difference]: Start difference. First operand 715 states and 1169 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:11,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:11,972 INFO L93 Difference]: Finished difference Result 1939 states and 3165 transitions. [2025-03-08 15:48:11,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:48:11,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 529 [2025-03-08 15:48:11,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:11,979 INFO L225 Difference]: With dead ends: 1939 [2025-03-08 15:48:11,979 INFO L226 Difference]: Without dead ends: 1227 [2025-03-08 15:48:11,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:11,981 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 398 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:11,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1233 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:48:11,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2025-03-08 15:48:12,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1223. [2025-03-08 15:48:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 950 states have (on average 1.5326315789473683) internal successors, (1456), 952 states have internal predecessors, (1456), 268 states have call successors, (268), 4 states have call predecessors, (268), 4 states have return successors, (268), 266 states have call predecessors, (268), 268 states have call successors, (268) [2025-03-08 15:48:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1992 transitions. [2025-03-08 15:48:12,063 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1992 transitions. Word has length 529 [2025-03-08 15:48:12,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:12,063 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1992 transitions. [2025-03-08 15:48:12,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1992 transitions. [2025-03-08 15:48:12,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-08 15:48:12,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:12,070 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:12,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:48:12,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:12,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:12,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2076410612, now seen corresponding path program 1 times [2025-03-08 15:48:12,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:12,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517938879] [2025-03-08 15:48:12,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:12,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:12,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-08 15:48:12,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-08 15:48:12,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:12,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:12,298 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:48:12,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:12,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517938879] [2025-03-08 15:48:12,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517938879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:12,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:12,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:48:12,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216965059] [2025-03-08 15:48:12,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:12,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:48:12,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:12,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:48:12,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:12,300 INFO L87 Difference]: Start difference. First operand 1223 states and 1992 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:12,425 INFO L93 Difference]: Finished difference Result 2455 states and 3990 transitions. [2025-03-08 15:48:12,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:48:12,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 529 [2025-03-08 15:48:12,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:12,433 INFO L225 Difference]: With dead ends: 2455 [2025-03-08 15:48:12,433 INFO L226 Difference]: Without dead ends: 1235 [2025-03-08 15:48:12,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:12,436 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 367 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:12,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1102 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:48:12,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2025-03-08 15:48:12,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 857. [2025-03-08 15:48:12,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 700 states have (on average 1.5585714285714285) internal successors, (1091), 700 states have internal predecessors, (1091), 152 states have call successors, (152), 4 states have call predecessors, (152), 4 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-08 15:48:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1395 transitions. [2025-03-08 15:48:12,480 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1395 transitions. Word has length 529 [2025-03-08 15:48:12,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:12,482 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1395 transitions. [2025-03-08 15:48:12,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:12,482 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1395 transitions. [2025-03-08 15:48:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-08 15:48:12,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:12,488 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:12,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:48:12,490 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:12,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:12,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1365861941, now seen corresponding path program 1 times [2025-03-08 15:48:12,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:12,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878201317] [2025-03-08 15:48:12,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:12,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:12,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-08 15:48:12,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-08 15:48:12,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:12,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:48:13,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:13,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878201317] [2025-03-08 15:48:13,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878201317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:13,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:13,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:48:13,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28796075] [2025-03-08 15:48:13,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:13,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:48:13,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:13,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:48:13,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:48:13,084 INFO L87 Difference]: Start difference. First operand 857 states and 1395 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:13,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:13,473 INFO L93 Difference]: Finished difference Result 2715 states and 4416 transitions. [2025-03-08 15:48:13,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:48:13,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 530 [2025-03-08 15:48:13,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:13,482 INFO L225 Difference]: With dead ends: 2715 [2025-03-08 15:48:13,482 INFO L226 Difference]: Without dead ends: 1861 [2025-03-08 15:48:13,484 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-08 15:48:13,485 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 720 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:13,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1615 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:48:13,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2025-03-08 15:48:13,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1519. [2025-03-08 15:48:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1206 states have (on average 1.5348258706467661) internal successors, (1851), 1206 states have internal predecessors, (1851), 304 states have call successors, (304), 8 states have call predecessors, (304), 8 states have return successors, (304), 304 states have call predecessors, (304), 304 states have call successors, (304) [2025-03-08 15:48:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 2459 transitions. [2025-03-08 15:48:13,567 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 2459 transitions. Word has length 530 [2025-03-08 15:48:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:13,568 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 2459 transitions. [2025-03-08 15:48:13,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 2459 transitions. [2025-03-08 15:48:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-03-08 15:48:13,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:13,583 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:13,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:48:13,584 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:13,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:13,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2011163273, now seen corresponding path program 1 times [2025-03-08 15:48:13,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:13,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008233716] [2025-03-08 15:48:13,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:13,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-03-08 15:48:13,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-03-08 15:48:13,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:13,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:48:14,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:14,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008233716] [2025-03-08 15:48:14,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008233716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:14,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:14,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:48:14,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351981165] [2025-03-08 15:48:14,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:14,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:48:14,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:14,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:48:14,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:48:14,056 INFO L87 Difference]: Start difference. First operand 1519 states and 2459 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:14,451 INFO L93 Difference]: Finished difference Result 3658 states and 5908 transitions. [2025-03-08 15:48:14,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:48:14,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 531 [2025-03-08 15:48:14,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:14,462 INFO L225 Difference]: With dead ends: 3658 [2025-03-08 15:48:14,462 INFO L226 Difference]: Without dead ends: 2142 [2025-03-08 15:48:14,465 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-08 15:48:14,466 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 429 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:14,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1487 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:48:14,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2025-03-08 15:48:14,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2028. [2025-03-08 15:48:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2028 states, 1637 states have (on average 1.5430665852168601) internal successors, (2526), 1637 states have internal predecessors, (2526), 380 states have call successors, (380), 10 states have call predecessors, (380), 10 states have return successors, (380), 380 states have call predecessors, (380), 380 states have call successors, (380) [2025-03-08 15:48:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 3286 transitions. [2025-03-08 15:48:14,605 INFO L78 Accepts]: Start accepts. Automaton has 2028 states and 3286 transitions. Word has length 531 [2025-03-08 15:48:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:14,605 INFO L471 AbstractCegarLoop]: Abstraction has 2028 states and 3286 transitions. [2025-03-08 15:48:14,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 3286 transitions. [2025-03-08 15:48:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-08 15:48:14,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:14,611 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:14,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:48:14,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:14,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:14,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2040383067, now seen corresponding path program 1 times [2025-03-08 15:48:14,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:14,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329093384] [2025-03-08 15:48:14,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:14,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:14,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-08 15:48:14,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-08 15:48:14,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:14,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:15,024 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:48:15,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:15,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329093384] [2025-03-08 15:48:15,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329093384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:15,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:15,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:48:15,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104324143] [2025-03-08 15:48:15,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:15,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:48:15,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:15,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:48:15,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:48:15,026 INFO L87 Difference]: Start difference. First operand 2028 states and 3286 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:15,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:15,414 INFO L93 Difference]: Finished difference Result 4014 states and 6489 transitions. [2025-03-08 15:48:15,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:48:15,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 532 [2025-03-08 15:48:15,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:15,425 INFO L225 Difference]: With dead ends: 4014 [2025-03-08 15:48:15,425 INFO L226 Difference]: Without dead ends: 2142 [2025-03-08 15:48:15,429 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-08 15:48:15,430 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 425 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:15,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1490 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:48:15,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2025-03-08 15:48:15,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2032. [2025-03-08 15:48:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2032 states, 1641 states have (on average 1.5411334552102376) internal successors, (2529), 1641 states have internal predecessors, (2529), 380 states have call successors, (380), 10 states have call predecessors, (380), 10 states have return successors, (380), 380 states have call predecessors, (380), 380 states have call successors, (380) [2025-03-08 15:48:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 3289 transitions. [2025-03-08 15:48:15,547 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 3289 transitions. Word has length 532 [2025-03-08 15:48:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:15,548 INFO L471 AbstractCegarLoop]: Abstraction has 2032 states and 3289 transitions. [2025-03-08 15:48:15,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 3289 transitions. [2025-03-08 15:48:15,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-08 15:48:15,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:15,551 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:15,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:48:15,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:15,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:15,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1404984769, now seen corresponding path program 1 times [2025-03-08 15:48:15,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:15,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930580344] [2025-03-08 15:48:15,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:15,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:15,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-08 15:48:15,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-08 15:48:15,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:15,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:48:15,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:15,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930580344] [2025-03-08 15:48:15,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930580344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:15,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:15,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:48:15,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244093874] [2025-03-08 15:48:15,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:15,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:48:15,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:15,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:48:15,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:48:15,970 INFO L87 Difference]: Start difference. First operand 2032 states and 3289 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:16,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:16,406 INFO L93 Difference]: Finished difference Result 5963 states and 9639 transitions. [2025-03-08 15:48:16,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:48:16,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 533 [2025-03-08 15:48:16,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:16,426 INFO L225 Difference]: With dead ends: 5963 [2025-03-08 15:48:16,427 INFO L226 Difference]: Without dead ends: 4078 [2025-03-08 15:48:16,433 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-08 15:48:16,433 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 687 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:16,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 1601 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:48:16,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4078 states. [2025-03-08 15:48:16,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4078 to 3874. [2025-03-08 15:48:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3874 states, 3171 states have (on average 1.54241564175339) internal successors, (4891), 3171 states have internal predecessors, (4891), 684 states have call successors, (684), 18 states have call predecessors, (684), 18 states have return successors, (684), 684 states have call predecessors, (684), 684 states have call successors, (684) [2025-03-08 15:48:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3874 states to 3874 states and 6259 transitions. [2025-03-08 15:48:16,669 INFO L78 Accepts]: Start accepts. Automaton has 3874 states and 6259 transitions. Word has length 533 [2025-03-08 15:48:16,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:16,670 INFO L471 AbstractCegarLoop]: Abstraction has 3874 states and 6259 transitions. [2025-03-08 15:48:16,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:16,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3874 states and 6259 transitions. [2025-03-08 15:48:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-03-08 15:48:16,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:16,678 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:16,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:48:16,678 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:16,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:16,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1088444182, now seen corresponding path program 1 times [2025-03-08 15:48:16,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:16,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575711074] [2025-03-08 15:48:16,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:16,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:16,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-03-08 15:48:16,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-03-08 15:48:16,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:16,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:48:17,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:17,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575711074] [2025-03-08 15:48:17,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575711074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:17,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:17,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:48:17,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258650880] [2025-03-08 15:48:17,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:17,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:48:17,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:17,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:48:17,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:48:17,179 INFO L87 Difference]: Start difference. First operand 3874 states and 6259 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:17,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:17,679 INFO L93 Difference]: Finished difference Result 7909 states and 12739 transitions. [2025-03-08 15:48:17,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:48:17,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 534 [2025-03-08 15:48:17,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:17,703 INFO L225 Difference]: With dead ends: 7909 [2025-03-08 15:48:17,703 INFO L226 Difference]: Without dead ends: 4182 [2025-03-08 15:48:17,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:48:17,713 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 678 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 2082 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:17,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 2082 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:48:17,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4182 states. [2025-03-08 15:48:17,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4182 to 3884. [2025-03-08 15:48:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3884 states, 3181 states have (on average 1.5363093366865765) internal successors, (4887), 3181 states have internal predecessors, (4887), 684 states have call successors, (684), 18 states have call predecessors, (684), 18 states have return successors, (684), 684 states have call predecessors, (684), 684 states have call successors, (684) [2025-03-08 15:48:17,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3884 states to 3884 states and 6255 transitions. [2025-03-08 15:48:17,949 INFO L78 Accepts]: Start accepts. Automaton has 3884 states and 6255 transitions. Word has length 534 [2025-03-08 15:48:17,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:17,950 INFO L471 AbstractCegarLoop]: Abstraction has 3884 states and 6255 transitions. [2025-03-08 15:48:17,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3884 states and 6255 transitions. [2025-03-08 15:48:17,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-08 15:48:17,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:17,954 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:17,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:48:17,954 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:17,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:17,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1398938116, now seen corresponding path program 1 times [2025-03-08 15:48:17,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:17,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406519360] [2025-03-08 15:48:17,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:17,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:17,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-08 15:48:18,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-08 15:48:18,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:18,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:48:19,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:19,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406519360] [2025-03-08 15:48:19,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406519360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:19,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:19,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:48:19,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567972932] [2025-03-08 15:48:19,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:19,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:48:19,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:19,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:48:19,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:48:19,470 INFO L87 Difference]: Start difference. First operand 3884 states and 6255 transitions. Second operand has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:21,601 INFO L93 Difference]: Finished difference Result 13287 states and 21260 transitions. [2025-03-08 15:48:21,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:48:21,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 535 [2025-03-08 15:48:21,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:21,651 INFO L225 Difference]: With dead ends: 13287 [2025-03-08 15:48:21,651 INFO L226 Difference]: Without dead ends: 11292 [2025-03-08 15:48:21,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:48:21,660 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 1910 mSDsluCounter, 2625 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 737 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1910 SdHoareTripleChecker+Valid, 3421 SdHoareTripleChecker+Invalid, 1903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 737 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:21,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1910 Valid, 3421 Invalid, 1903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [737 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 15:48:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11292 states. [2025-03-08 15:48:22,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11292 to 8333. [2025-03-08 15:48:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8333 states, 6774 states have (on average 1.52760555063478) internal successors, (10348), 6786 states have internal predecessors, (10348), 1516 states have call successors, (1516), 42 states have call predecessors, (1516), 42 states have return successors, (1516), 1504 states have call predecessors, (1516), 1516 states have call successors, (1516) [2025-03-08 15:48:22,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8333 states to 8333 states and 13380 transitions. [2025-03-08 15:48:22,091 INFO L78 Accepts]: Start accepts. Automaton has 8333 states and 13380 transitions. Word has length 535 [2025-03-08 15:48:22,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:22,092 INFO L471 AbstractCegarLoop]: Abstraction has 8333 states and 13380 transitions. [2025-03-08 15:48:22,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:48:22,093 INFO L276 IsEmpty]: Start isEmpty. Operand 8333 states and 13380 transitions. [2025-03-08 15:48:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-08 15:48:22,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:22,098 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:22,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:48:22,098 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:22,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:22,099 INFO L85 PathProgramCache]: Analyzing trace with hash 554466245, now seen corresponding path program 1 times [2025-03-08 15:48:22,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:22,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469397935] [2025-03-08 15:48:22,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:22,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:22,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-08 15:48:22,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-08 15:48:22,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:22,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:48:29,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:29,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469397935] [2025-03-08 15:48:29,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469397935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:29,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:29,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-08 15:48:29,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468320554] [2025-03-08 15:48:29,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:29,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 15:48:29,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:29,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 15:48:29,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2025-03-08 15:48:29,824 INFO L87 Difference]: Start difference. First operand 8333 states and 13380 transitions. Second operand has 23 states, 23 states have (on average 6.869565217391305) internal successors, (158), 23 states have internal predecessors, (158), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-08 15:48:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:51,864 INFO L93 Difference]: Finished difference Result 43557 states and 69621 transitions. [2025-03-08 15:48:51,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 15:48:51,864 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.869565217391305) internal successors, (158), 23 states have internal predecessors, (158), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) Word has length 535 [2025-03-08 15:48:51,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:51,979 INFO L225 Difference]: With dead ends: 43557 [2025-03-08 15:48:51,980 INFO L226 Difference]: Without dead ends: 38889 [2025-03-08 15:48:52,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=503, Invalid=1477, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 15:48:52,010 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 6351 mSDsluCounter, 7849 mSDsCounter, 0 mSdLazyCounter, 10065 mSolverCounterSat, 1088 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6351 SdHoareTripleChecker+Valid, 8728 SdHoareTripleChecker+Invalid, 11153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1088 IncrementalHoareTripleChecker+Valid, 10065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:52,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6351 Valid, 8728 Invalid, 11153 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1088 Valid, 10065 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2025-03-08 15:48:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38889 states. [2025-03-08 15:48:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38889 to 12211. [2025-03-08 15:48:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12211 states, 10283 states have (on average 1.5478945832928135) internal successors, (15917), 10307 states have internal predecessors, (15917), 1864 states have call successors, (1864), 63 states have call predecessors, (1864), 63 states have return successors, (1864), 1840 states have call predecessors, (1864), 1864 states have call successors, (1864) [2025-03-08 15:48:53,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12211 states to 12211 states and 19645 transitions. [2025-03-08 15:48:53,491 INFO L78 Accepts]: Start accepts. Automaton has 12211 states and 19645 transitions. Word has length 535 [2025-03-08 15:48:53,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:53,492 INFO L471 AbstractCegarLoop]: Abstraction has 12211 states and 19645 transitions. [2025-03-08 15:48:53,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.869565217391305) internal successors, (158), 23 states have internal predecessors, (158), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-08 15:48:53,492 INFO L276 IsEmpty]: Start isEmpty. Operand 12211 states and 19645 transitions. [2025-03-08 15:48:53,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-08 15:48:53,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:53,497 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:53,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:48:53,498 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:53,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:53,498 INFO L85 PathProgramCache]: Analyzing trace with hash -925089723, now seen corresponding path program 1 times [2025-03-08 15:48:53,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:53,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751900227] [2025-03-08 15:48:53,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:53,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:53,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-08 15:48:53,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-08 15:48:53,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:53,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:48:54,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:54,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751900227] [2025-03-08 15:48:54,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751900227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:54,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:54,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 15:48:54,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022422051] [2025-03-08 15:48:54,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:54,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 15:48:54,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:54,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 15:48:54,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:48:54,713 INFO L87 Difference]: Start difference. First operand 12211 states and 19645 transitions. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-08 15:49:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:02,137 INFO L93 Difference]: Finished difference Result 36408 states and 58045 transitions. [2025-03-08 15:49:02,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 15:49:02,138 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) Word has length 535 [2025-03-08 15:49:02,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:02,216 INFO L225 Difference]: With dead ends: 36408 [2025-03-08 15:49:02,216 INFO L226 Difference]: Without dead ends: 27877 [2025-03-08 15:49:02,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-03-08 15:49:02,242 INFO L435 NwaCegarLoop]: 988 mSDtfsCounter, 2596 mSDsluCounter, 3918 mSDsCounter, 0 mSdLazyCounter, 4327 mSolverCounterSat, 663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2596 SdHoareTripleChecker+Valid, 4906 SdHoareTripleChecker+Invalid, 4990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 4327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:02,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2596 Valid, 4906 Invalid, 4990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 4327 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-08 15:49:02,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27877 states. [2025-03-08 15:49:04,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27877 to 17924. [2025-03-08 15:49:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17924 states, 15195 states have (on average 1.5463639355051004) internal successors, (23497), 15231 states have internal predecessors, (23497), 2608 states have call successors, (2608), 120 states have call predecessors, (2608), 120 states have return successors, (2608), 2572 states have call predecessors, (2608), 2608 states have call successors, (2608) [2025-03-08 15:49:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17924 states to 17924 states and 28713 transitions. [2025-03-08 15:49:04,383 INFO L78 Accepts]: Start accepts. Automaton has 17924 states and 28713 transitions. Word has length 535 [2025-03-08 15:49:04,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:04,384 INFO L471 AbstractCegarLoop]: Abstraction has 17924 states and 28713 transitions. [2025-03-08 15:49:04,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-08 15:49:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 17924 states and 28713 transitions. [2025-03-08 15:49:04,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-08 15:49:04,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:04,393 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:04,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:49:04,393 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:04,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:04,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1901862636, now seen corresponding path program 1 times [2025-03-08 15:49:04,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:04,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85371792] [2025-03-08 15:49:04,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:04,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:04,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-08 15:49:04,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-08 15:49:04,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:04,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:49:04,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:04,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85371792] [2025-03-08 15:49:04,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85371792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:04,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:04,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:49:04,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80824687] [2025-03-08 15:49:04,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:04,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:49:04,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:04,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:49:04,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:49:04,842 INFO L87 Difference]: Start difference. First operand 17924 states and 28713 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:49:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:07,718 INFO L93 Difference]: Finished difference Result 39834 states and 63767 transitions. [2025-03-08 15:49:07,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:49:07,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 535 [2025-03-08 15:49:07,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:07,788 INFO L225 Difference]: With dead ends: 39834 [2025-03-08 15:49:07,789 INFO L226 Difference]: Without dead ends: 23994 [2025-03-08 15:49:07,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:49:07,825 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 1290 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 2347 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:07,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 2347 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 15:49:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23994 states. [2025-03-08 15:49:10,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23994 to 23478. [2025-03-08 15:49:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23478 states, 19637 states have (on average 1.537454804705403) internal successors, (30191), 19685 states have internal predecessors, (30191), 3664 states have call successors, (3664), 176 states have call predecessors, (3664), 176 states have return successors, (3664), 3616 states have call predecessors, (3664), 3664 states have call successors, (3664) [2025-03-08 15:49:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23478 states to 23478 states and 37519 transitions. [2025-03-08 15:49:10,578 INFO L78 Accepts]: Start accepts. Automaton has 23478 states and 37519 transitions. Word has length 535 [2025-03-08 15:49:10,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:10,579 INFO L471 AbstractCegarLoop]: Abstraction has 23478 states and 37519 transitions. [2025-03-08 15:49:10,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:49:10,579 INFO L276 IsEmpty]: Start isEmpty. Operand 23478 states and 37519 transitions. [2025-03-08 15:49:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-08 15:49:10,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:10,588 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:10,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:49:10,588 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:10,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:10,588 INFO L85 PathProgramCache]: Analyzing trace with hash 593047158, now seen corresponding path program 1 times [2025-03-08 15:49:10,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:10,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285606923] [2025-03-08 15:49:10,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:10,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:10,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-08 15:49:11,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-08 15:49:11,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:11,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:49:11,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:11,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285606923] [2025-03-08 15:49:11,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285606923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:11,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:11,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:49:11,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630886407] [2025-03-08 15:49:11,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:11,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:49:11,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:11,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:49:11,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:49:11,763 INFO L87 Difference]: Start difference. First operand 23478 states and 37519 transitions. Second operand has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-08 15:49:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:17,941 INFO L93 Difference]: Finished difference Result 62571 states and 100759 transitions. [2025-03-08 15:49:17,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:49:17,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) Word has length 536 [2025-03-08 15:49:17,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:18,069 INFO L225 Difference]: With dead ends: 62571 [2025-03-08 15:49:18,070 INFO L226 Difference]: Without dead ends: 49067 [2025-03-08 15:49:18,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:49:18,112 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 2439 mSDsluCounter, 2291 mSDsCounter, 0 mSdLazyCounter, 2149 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2439 SdHoareTripleChecker+Valid, 3274 SdHoareTripleChecker+Invalid, 2567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 2149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:18,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2439 Valid, 3274 Invalid, 2567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 2149 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 15:49:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49067 states. [2025-03-08 15:49:20,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49067 to 24054. [2025-03-08 15:49:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24054 states, 20213 states have (on average 1.5407411072082324) internal successors, (31143), 20261 states have internal predecessors, (31143), 3664 states have call successors, (3664), 176 states have call predecessors, (3664), 176 states have return successors, (3664), 3616 states have call predecessors, (3664), 3664 states have call successors, (3664) [2025-03-08 15:49:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24054 states to 24054 states and 38471 transitions. [2025-03-08 15:49:20,858 INFO L78 Accepts]: Start accepts. Automaton has 24054 states and 38471 transitions. Word has length 536 [2025-03-08 15:49:20,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:20,859 INFO L471 AbstractCegarLoop]: Abstraction has 24054 states and 38471 transitions. [2025-03-08 15:49:20,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-08 15:49:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 24054 states and 38471 transitions. [2025-03-08 15:49:20,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-08 15:49:20,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:20,867 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:20,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 15:49:20,867 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:20,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:20,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1121966197, now seen corresponding path program 1 times [2025-03-08 15:49:20,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:20,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556006766] [2025-03-08 15:49:20,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:20,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:20,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-08 15:49:21,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-08 15:49:21,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:21,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:49:21,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:21,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556006766] [2025-03-08 15:49:21,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556006766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:21,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:21,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:49:21,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788360992] [2025-03-08 15:49:21,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:21,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:49:21,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:21,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:49:21,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:49:21,568 INFO L87 Difference]: Start difference. First operand 24054 states and 38471 transitions. Second operand has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76)