./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-0.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 6220e6745b3165a6fc1efc167bda264ea9d52d0f56711813aaca8387b0aa2cbd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:46:45,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:46:45,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:46:45,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:46:45,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:46:45,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:46:45,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:46:45,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:46:45,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:46:45,844 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:46:45,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:46:45,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:46:45,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:46:45,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:46:45,845 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:46:45,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:46:45,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:46:45,845 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:46:45,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:46:45,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:46:45,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:46:45,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:46:45,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:46:45,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:46:45,846 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:46:45,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:46:45,846 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:46:45,846 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:46:45,846 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:46:45,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:46:45,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:46:45,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:46:45,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:46:45,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:46:45,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:46:45,847 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:46:45,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:46:45,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:46:45,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:46:45,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:46:45,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:46:45,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:46:45,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:46:45,848 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 -> 6220e6745b3165a6fc1efc167bda264ea9d52d0f56711813aaca8387b0aa2cbd [2025-03-17 04:46:46,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:46:46,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:46:46,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:46:46,119 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:46:46,119 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:46:46,120 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-0.i [2025-03-17 04:46:47,295 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e85d69f/2752725ca5f44e30b30269b8127a08b2/FLAG72904f53e [2025-03-17 04:46:47,614 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:46:47,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-0.i [2025-03-17 04:46:47,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e85d69f/2752725ca5f44e30b30269b8127a08b2/FLAG72904f53e [2025-03-17 04:46:47,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e85d69f/2752725ca5f44e30b30269b8127a08b2 [2025-03-17 04:46:47,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:46:47,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:46:47,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:46:47,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:46:47,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:46:47,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:46:47" (1/1) ... [2025-03-17 04:46:47,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f713cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:46:47, skipping insertion in model container [2025-03-17 04:46:47,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:46:47" (1/1) ... [2025-03-17 04:46:47,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:46:47,999 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-0.i[915,928] [2025-03-17 04:46:48,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:46:48,239 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:46:48,247 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-0.i[915,928] [2025-03-17 04:46:48,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:46:48,376 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:46:48,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:46:48 WrapperNode [2025-03-17 04:46:48,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:46:48,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:46:48,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:46:48,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:46:48,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:46:48" (1/1) ... [2025-03-17 04:46:48,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:46:48" (1/1) ... [2025-03-17 04:46:48,503 INFO L138 Inliner]: procedures = 26, calls = 74, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 717 [2025-03-17 04:46:48,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:46:48,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:46:48,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:46:48,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:46:48,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:46:48" (1/1) ... [2025-03-17 04:46:48,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:46:48" (1/1) ... [2025-03-17 04:46:48,527 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:46:48" (1/1) ... [2025-03-17 04:46:48,619 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:46:48,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:46:48" (1/1) ... [2025-03-17 04:46:48,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:46:48" (1/1) ... [2025-03-17 04:46:48,658 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:46:48" (1/1) ... [2025-03-17 04:46:48,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:46:48" (1/1) ... [2025-03-17 04:46:48,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:46:48" (1/1) ... [2025-03-17 04:46:48,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:46:48" (1/1) ... [2025-03-17 04:46:48,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:46:48,697 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:46:48,697 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:46:48,697 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:46:48,698 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:46:48" (1/1) ... [2025-03-17 04:46:48,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:46:48,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:46:48,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:46:48,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:46:48,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:46:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:46:48,752 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:46:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:46:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:46:48,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:46:48,879 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:46:48,881 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:46:49,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L605: havoc property_#t~ite46#1;havoc property_#t~bitwise45#1;havoc property_#t~short47#1;havoc property_#t~ite50#1;havoc property_#t~ite49#1;havoc property_#t~bitwise48#1;havoc property_#t~short51#1;havoc property_#t~ite56#1;havoc property_#t~ite55#1;havoc property_#t~ite54#1;havoc property_#t~ite53#1;havoc property_#t~bitwise52#1;havoc property_#t~short57#1;havoc property_#t~ite60#1;havoc property_#t~ite59#1;havoc property_#t~bitwise58#1;havoc property_#t~short61#1;havoc property_#t~bitwise62#1;havoc property_#t~bitwise63#1;havoc property_#t~short64#1; [2025-03-17 04:46:49,954 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2025-03-17 04:46:49,954 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:46:49,983 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:46:49,984 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:46:49,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:46:49 BoogieIcfgContainer [2025-03-17 04:46:49,984 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:46:49,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:46:49,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:46:49,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:46:49,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:46:47" (1/3) ... [2025-03-17 04:46:49,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272a39d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:46:49, skipping insertion in model container [2025-03-17 04:46:49,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:46:48" (2/3) ... [2025-03-17 04:46:49,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272a39d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:46:49, skipping insertion in model container [2025-03-17 04:46:49,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:46:49" (3/3) ... [2025-03-17 04:46:49,991 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-0.i [2025-03-17 04:46:50,004 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:46:50,007 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-0.i that has 2 procedures, 285 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:46:50,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:46:50,085 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;@4201631c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:46:50,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:46:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 285 states, 221 states have (on average 1.5656108597285068) internal successors, (346), 222 states have internal predecessors, (346), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-17 04:46:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-17 04:46:50,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:46:50,116 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:46:50,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:46:50,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:46:50,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1239665079, now seen corresponding path program 1 times [2025-03-17 04:46:50,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:46:50,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996807846] [2025-03-17 04:46:50,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:46:50,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:46:50,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-17 04:46:50,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-17 04:46:50,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:46:50,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:46:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-03-17 04:46:50,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:46:50,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996807846] [2025-03-17 04:46:50,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996807846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:46:50,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111371128] [2025-03-17 04:46:50,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:46:50,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:46:50,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:46:50,690 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:46:50,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:46:50,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-17 04:46:51,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-17 04:46:51,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:46:51,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:46:51,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:46:51,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:46:51,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-03-17 04:46:51,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:46:51,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111371128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:46:51,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:46:51,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:46:51,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150530134] [2025-03-17 04:46:51,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:46:51,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:46:51,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:46:51,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:46:51,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:46:51,110 INFO L87 Difference]: Start difference. First operand has 285 states, 221 states have (on average 1.5656108597285068) internal successors, (346), 222 states have internal predecessors, (346), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) Second operand has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-17 04:46:51,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:46:51,170 INFO L93 Difference]: Finished difference Result 567 states and 995 transitions. [2025-03-17 04:46:51,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:46:51,172 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) Word has length 426 [2025-03-17 04:46:51,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:46:51,178 INFO L225 Difference]: With dead ends: 567 [2025-03-17 04:46:51,178 INFO L226 Difference]: Without dead ends: 283 [2025-03-17 04:46:51,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:46:51,188 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:46:51,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 451 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:46:51,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-17 04:46:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-03-17 04:46:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 220 states have (on average 1.55) internal successors, (341), 220 states have internal predecessors, (341), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-17 04:46:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 463 transitions. [2025-03-17 04:46:51,260 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 463 transitions. Word has length 426 [2025-03-17 04:46:51,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:46:51,261 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 463 transitions. [2025-03-17 04:46:51,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-17 04:46:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 463 transitions. [2025-03-17 04:46:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-17 04:46:51,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:46:51,273 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:46:51,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 04:46:51,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 04:46:51,477 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:46:51,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:46:51,479 INFO L85 PathProgramCache]: Analyzing trace with hash -108599954, now seen corresponding path program 1 times [2025-03-17 04:46:51,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:46:51,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395843844] [2025-03-17 04:46:51,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:46:51,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:46:51,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-17 04:46:51,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-17 04:46:51,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:46:51,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:46:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:46:51,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:46:51,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395843844] [2025-03-17 04:46:51,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395843844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:46:51,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:46:51,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:46:51,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129527461] [2025-03-17 04:46:51,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:46:51,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:46:51,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:46:51,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:46:51,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:46:51,912 INFO L87 Difference]: Start difference. First operand 283 states and 463 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:46:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:46:52,071 INFO L93 Difference]: Finished difference Result 749 states and 1222 transitions. [2025-03-17 04:46:52,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:46:52,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 426 [2025-03-17 04:46:52,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:46:52,075 INFO L225 Difference]: With dead ends: 749 [2025-03-17 04:46:52,076 INFO L226 Difference]: Without dead ends: 467 [2025-03-17 04:46:52,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:46:52,077 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 285 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:46:52,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1094 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:46:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-17 04:46:52,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 464. [2025-03-17 04:46:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 394 states have (on average 1.5736040609137056) internal successors, (620), 395 states have internal predecessors, (620), 67 states have call successors, (67), 2 states have call predecessors, (67), 2 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 04:46:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 754 transitions. [2025-03-17 04:46:52,129 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 754 transitions. Word has length 426 [2025-03-17 04:46:52,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:46:52,130 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 754 transitions. [2025-03-17 04:46:52,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:46:52,130 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 754 transitions. [2025-03-17 04:46:52,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-17 04:46:52,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:46:52,136 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:46:52,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:46:52,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:46:52,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:46:52,137 INFO L85 PathProgramCache]: Analyzing trace with hash -36948368, now seen corresponding path program 1 times [2025-03-17 04:46:52,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:46:52,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72603337] [2025-03-17 04:46:52,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:46:52,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:46:52,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-17 04:46:52,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-17 04:46:52,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:46:52,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:46:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:46:52,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:46:52,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72603337] [2025-03-17 04:46:52,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72603337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:46:52,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:46:52,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:46:52,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154880417] [2025-03-17 04:46:52,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:46:52,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:46:52,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:46:52,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:46:52,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:46:52,570 INFO L87 Difference]: Start difference. First operand 464 states and 754 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:46:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:46:52,705 INFO L93 Difference]: Finished difference Result 1260 states and 2043 transitions. [2025-03-17 04:46:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:46:52,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 426 [2025-03-17 04:46:52,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:46:52,716 INFO L225 Difference]: With dead ends: 1260 [2025-03-17 04:46:52,716 INFO L226 Difference]: Without dead ends: 797 [2025-03-17 04:46:52,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:46:52,718 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 260 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:46:52,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 874 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:46:52,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-03-17 04:46:52,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 794. [2025-03-17 04:46:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 702 states have (on average 1.584045584045584) internal successors, (1112), 705 states have internal predecessors, (1112), 87 states have call successors, (87), 4 states have call predecessors, (87), 4 states have return successors, (87), 84 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-17 04:46:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1286 transitions. [2025-03-17 04:46:52,769 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1286 transitions. Word has length 426 [2025-03-17 04:46:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:46:52,772 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1286 transitions. [2025-03-17 04:46:52,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:46:52,772 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1286 transitions. [2025-03-17 04:46:52,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-17 04:46:52,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:46:52,780 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:46:52,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:46:52,780 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:46:52,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:46:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1737688847, now seen corresponding path program 1 times [2025-03-17 04:46:52,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:46:52,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658153291] [2025-03-17 04:46:52,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:46:52,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:46:52,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-17 04:46:52,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-17 04:46:52,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:46:52,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:46:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:46:53,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:46:53,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658153291] [2025-03-17 04:46:53,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658153291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:46:53,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:46:53,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:46:53,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610200789] [2025-03-17 04:46:53,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:46:53,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:46:53,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:46:53,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:46:53,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:46:53,962 INFO L87 Difference]: Start difference. First operand 794 states and 1286 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:46:54,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:46:54,448 INFO L93 Difference]: Finished difference Result 2894 states and 4663 transitions. [2025-03-17 04:46:54,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:46:54,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 426 [2025-03-17 04:46:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:46:54,463 INFO L225 Difference]: With dead ends: 2894 [2025-03-17 04:46:54,464 INFO L226 Difference]: Without dead ends: 2101 [2025-03-17 04:46:54,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:46:54,467 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 1066 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:46:54,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 1548 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:46:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2025-03-17 04:46:54,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 1578. [2025-03-17 04:46:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1434 states have (on average 1.589260808926081) internal successors, (2279), 1442 states have internal predecessors, (2279), 131 states have call successors, (131), 12 states have call predecessors, (131), 12 states have return successors, (131), 123 states have call predecessors, (131), 131 states have call successors, (131) [2025-03-17 04:46:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2541 transitions. [2025-03-17 04:46:54,560 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2541 transitions. Word has length 426 [2025-03-17 04:46:54,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:46:54,561 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2541 transitions. [2025-03-17 04:46:54,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:46:54,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2541 transitions. [2025-03-17 04:46:54,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-17 04:46:54,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:46:54,567 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:46:54,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:46:54,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:46:54,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:46:54,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2121952722, now seen corresponding path program 1 times [2025-03-17 04:46:54,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:46:54,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44323107] [2025-03-17 04:46:54,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:46:54,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:46:54,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-17 04:46:54,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-17 04:46:54,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:46:54,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:46:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:46:54,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:46:54,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44323107] [2025-03-17 04:46:54,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44323107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:46:54,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:46:54,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:46:54,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885219929] [2025-03-17 04:46:54,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:46:54,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:46:54,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:46:54,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:46:54,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:46:54,843 INFO L87 Difference]: Start difference. First operand 1578 states and 2541 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:46:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:46:54,981 INFO L93 Difference]: Finished difference Result 4386 states and 7065 transitions. [2025-03-17 04:46:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:46:54,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 426 [2025-03-17 04:46:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:46:54,992 INFO L225 Difference]: With dead ends: 4386 [2025-03-17 04:46:54,992 INFO L226 Difference]: Without dead ends: 2832 [2025-03-17 04:46:54,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:46:54,997 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 225 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:46:54,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1004 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:46:55,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2025-03-17 04:46:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2826. [2025-03-17 04:46:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2826 states, 2608 states have (on average 1.5855061349693251) internal successors, (4135), 2624 states have internal predecessors, (4135), 195 states have call successors, (195), 22 states have call predecessors, (195), 22 states have return successors, (195), 179 states have call predecessors, (195), 195 states have call successors, (195) [2025-03-17 04:46:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 4525 transitions. [2025-03-17 04:46:55,100 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 4525 transitions. Word has length 426 [2025-03-17 04:46:55,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:46:55,103 INFO L471 AbstractCegarLoop]: Abstraction has 2826 states and 4525 transitions. [2025-03-17 04:46:55,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:46:55,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 4525 transitions. [2025-03-17 04:46:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-17 04:46:55,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:46:55,112 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:46:55,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:46:55,112 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:46:55,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:46:55,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2068700334, now seen corresponding path program 1 times [2025-03-17 04:46:55,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:46:55,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058534727] [2025-03-17 04:46:55,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:46:55,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:46:55,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-17 04:46:55,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-17 04:46:55,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:46:55,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:46:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:46:55,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:46:55,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058534727] [2025-03-17 04:46:55,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058534727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:46:55,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:46:55,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:46:55,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498647363] [2025-03-17 04:46:55,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:46:55,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:46:55,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:46:55,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:46:55,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:46:55,266 INFO L87 Difference]: Start difference. First operand 2826 states and 4525 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:46:55,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:46:55,427 INFO L93 Difference]: Finished difference Result 7896 states and 12739 transitions. [2025-03-17 04:46:55,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:46:55,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 426 [2025-03-17 04:46:55,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:46:55,449 INFO L225 Difference]: With dead ends: 7896 [2025-03-17 04:46:55,449 INFO L226 Difference]: Without dead ends: 5094 [2025-03-17 04:46:55,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:46:55,458 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 290 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:46:55,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 861 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:46:55,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5094 states. [2025-03-17 04:46:55,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5094 to 4676. [2025-03-17 04:46:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4676 states, 4458 states have (on average 1.6242709735307312) internal successors, (7241), 4474 states have internal predecessors, (7241), 195 states have call successors, (195), 22 states have call predecessors, (195), 22 states have return successors, (195), 179 states have call predecessors, (195), 195 states have call successors, (195) [2025-03-17 04:46:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4676 states to 4676 states and 7631 transitions. [2025-03-17 04:46:55,594 INFO L78 Accepts]: Start accepts. Automaton has 4676 states and 7631 transitions. Word has length 426 [2025-03-17 04:46:55,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:46:55,594 INFO L471 AbstractCegarLoop]: Abstraction has 4676 states and 7631 transitions. [2025-03-17 04:46:55,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:46:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 4676 states and 7631 transitions. [2025-03-17 04:46:55,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-17 04:46:55,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:46:55,606 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:46:55,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:46:55,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:46:55,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:46:55,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1948580461, now seen corresponding path program 1 times [2025-03-17 04:46:55,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:46:55,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42252258] [2025-03-17 04:46:55,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:46:55,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:46:55,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-17 04:46:55,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-17 04:46:55,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:46:55,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:46:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:46:56,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:46:56,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42252258] [2025-03-17 04:46:56,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42252258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:46:56,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:46:56,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:46:56,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717169247] [2025-03-17 04:46:56,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:46:56,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:46:56,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:46:56,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:46:56,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:46:56,333 INFO L87 Difference]: Start difference. First operand 4676 states and 7631 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-17 04:46:57,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:46:57,351 INFO L93 Difference]: Finished difference Result 15810 states and 25669 transitions. [2025-03-17 04:46:57,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:46:57,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) Word has length 426 [2025-03-17 04:46:57,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:46:57,390 INFO L225 Difference]: With dead ends: 15810 [2025-03-17 04:46:57,390 INFO L226 Difference]: Without dead ends: 11158 [2025-03-17 04:46:57,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:46:57,405 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 953 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 04:46:57,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 2116 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 04:46:57,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11158 states. [2025-03-17 04:46:57,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11158 to 9266. [2025-03-17 04:46:57,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9266 states, 8840 states have (on average 1.6180995475113122) internal successors, (14304), 8871 states have internal predecessors, (14304), 382 states have call successors, (382), 43 states have call predecessors, (382), 43 states have return successors, (382), 351 states have call predecessors, (382), 382 states have call successors, (382) [2025-03-17 04:46:57,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9266 states to 9266 states and 15068 transitions. [2025-03-17 04:46:57,667 INFO L78 Accepts]: Start accepts. Automaton has 9266 states and 15068 transitions. Word has length 426 [2025-03-17 04:46:57,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:46:57,669 INFO L471 AbstractCegarLoop]: Abstraction has 9266 states and 15068 transitions. [2025-03-17 04:46:57,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-17 04:46:57,673 INFO L276 IsEmpty]: Start isEmpty. Operand 9266 states and 15068 transitions. [2025-03-17 04:46:57,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-17 04:46:57,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:46:57,684 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:46:57,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:46:57,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:46:57,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:46:57,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1935047660, now seen corresponding path program 1 times [2025-03-17 04:46:57,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:46:57,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95539607] [2025-03-17 04:46:57,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:46:57,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:46:57,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-17 04:46:58,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-17 04:46:58,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:46:58,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:46:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:46:58,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:46:58,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95539607] [2025-03-17 04:46:58,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95539607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:46:58,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:46:58,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:46:58,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990304013] [2025-03-17 04:46:58,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:46:58,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:46:58,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:46:58,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:46:58,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:46:58,761 INFO L87 Difference]: Start difference. First operand 9266 states and 15068 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:46:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:46:59,006 INFO L93 Difference]: Finished difference Result 18502 states and 30067 transitions. [2025-03-17 04:46:59,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:46:59,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 426 [2025-03-17 04:46:59,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:46:59,039 INFO L225 Difference]: With dead ends: 18502 [2025-03-17 04:46:59,039 INFO L226 Difference]: Without dead ends: 9260 [2025-03-17 04:46:59,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:46:59,054 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 248 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:46:59,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1537 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:46:59,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9260 states. [2025-03-17 04:46:59,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9260 to 7730. [2025-03-17 04:46:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7730 states, 7444 states have (on average 1.6405158516926384) internal successors, (12212), 7459 states have internal predecessors, (12212), 254 states have call successors, (254), 31 states have call predecessors, (254), 31 states have return successors, (254), 239 states have call predecessors, (254), 254 states have call successors, (254) [2025-03-17 04:46:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7730 states to 7730 states and 12720 transitions. [2025-03-17 04:46:59,257 INFO L78 Accepts]: Start accepts. Automaton has 7730 states and 12720 transitions. Word has length 426 [2025-03-17 04:46:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:46:59,259 INFO L471 AbstractCegarLoop]: Abstraction has 7730 states and 12720 transitions. [2025-03-17 04:46:59,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:46:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 7730 states and 12720 transitions. [2025-03-17 04:46:59,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-03-17 04:46:59,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:46:59,274 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:46:59,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:46:59,275 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:46:59,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:46:59,275 INFO L85 PathProgramCache]: Analyzing trace with hash -116958720, now seen corresponding path program 1 times [2025-03-17 04:46:59,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:46:59,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984205611] [2025-03-17 04:46:59,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:46:59,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:46:59,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-17 04:46:59,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-17 04:46:59,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:46:59,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:47:00,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:00,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984205611] [2025-03-17 04:47:00,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984205611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:00,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:00,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:47:00,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122760581] [2025-03-17 04:47:00,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:00,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:47:00,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:00,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:47:00,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:47:00,262 INFO L87 Difference]: Start difference. First operand 7730 states and 12720 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:00,730 INFO L93 Difference]: Finished difference Result 21490 states and 35457 transitions. [2025-03-17 04:47:00,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:47:00,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 427 [2025-03-17 04:47:00,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:00,764 INFO L225 Difference]: With dead ends: 21490 [2025-03-17 04:47:00,764 INFO L226 Difference]: Without dead ends: 13784 [2025-03-17 04:47:00,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:47:00,785 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 1095 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:00,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1744 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:47:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13784 states. [2025-03-17 04:47:01,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13784 to 7362. [2025-03-17 04:47:01,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7362 states, 7124 states have (on average 1.6193149915777654) internal successors, (11536), 7131 states have internal predecessors, (11536), 206 states have call successors, (206), 31 states have call predecessors, (206), 31 states have return successors, (206), 199 states have call predecessors, (206), 206 states have call successors, (206) [2025-03-17 04:47:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7362 states to 7362 states and 11948 transitions. [2025-03-17 04:47:01,090 INFO L78 Accepts]: Start accepts. Automaton has 7362 states and 11948 transitions. Word has length 427 [2025-03-17 04:47:01,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:01,091 INFO L471 AbstractCegarLoop]: Abstraction has 7362 states and 11948 transitions. [2025-03-17 04:47:01,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 7362 states and 11948 transitions. [2025-03-17 04:47:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-03-17 04:47:01,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:01,102 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:01,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:47:01,103 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:01,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:01,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1016231873, now seen corresponding path program 1 times [2025-03-17 04:47:01,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:01,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435136844] [2025-03-17 04:47:01,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:01,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:01,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-17 04:47:02,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-17 04:47:02,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:02,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:02,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-17 04:47:02,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:02,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435136844] [2025-03-17 04:47:02,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435136844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:47:02,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138250212] [2025-03-17 04:47:02,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:02,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:47:02,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:47:02,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:47:02,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 04:47:02,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-17 04:47:02,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-17 04:47:02,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:02,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:02,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 04:47:02,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:47:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3798 proven. 27 refuted. 0 times theorem prover too weak. 3495 trivial. 0 not checked. [2025-03-17 04:47:03,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:47:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 153 proven. 27 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-17 04:47:03,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138250212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:47:03,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:47:03,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-17 04:47:03,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353488380] [2025-03-17 04:47:03,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:47:03,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 04:47:03,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:03,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 04:47:03,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-17 04:47:03,573 INFO L87 Difference]: Start difference. First operand 7362 states and 11948 transitions. Second operand has 15 states, 15 states have (on average 14.6) internal successors, (219), 15 states have internal predecessors, (219), 6 states have call successors, (136), 3 states have call predecessors, (136), 6 states have return successors, (137), 6 states have call predecessors, (137), 6 states have call successors, (137) [2025-03-17 04:47:04,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:04,294 INFO L93 Difference]: Finished difference Result 11678 states and 18905 transitions. [2025-03-17 04:47:04,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 04:47:04,295 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 14.6) internal successors, (219), 15 states have internal predecessors, (219), 6 states have call successors, (136), 3 states have call predecessors, (136), 6 states have return successors, (137), 6 states have call predecessors, (137), 6 states have call successors, (137) Word has length 427 [2025-03-17 04:47:04,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:04,306 INFO L225 Difference]: With dead ends: 11678 [2025-03-17 04:47:04,306 INFO L226 Difference]: Without dead ends: 4340 [2025-03-17 04:47:04,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 869 GetRequests, 846 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2025-03-17 04:47:04,317 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 909 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:04,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 1547 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:47:04,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4340 states. [2025-03-17 04:47:04,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4340 to 4216. [2025-03-17 04:47:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4216 states, 3967 states have (on average 1.6054953365263422) internal successors, (6369), 3974 states have internal predecessors, (6369), 206 states have call successors, (206), 42 states have call predecessors, (206), 42 states have return successors, (206), 199 states have call predecessors, (206), 206 states have call successors, (206) [2025-03-17 04:47:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4216 states to 4216 states and 6781 transitions. [2025-03-17 04:47:04,431 INFO L78 Accepts]: Start accepts. Automaton has 4216 states and 6781 transitions. Word has length 427 [2025-03-17 04:47:04,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:04,432 INFO L471 AbstractCegarLoop]: Abstraction has 4216 states and 6781 transitions. [2025-03-17 04:47:04,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 14.6) internal successors, (219), 15 states have internal predecessors, (219), 6 states have call successors, (136), 3 states have call predecessors, (136), 6 states have return successors, (137), 6 states have call predecessors, (137), 6 states have call successors, (137) [2025-03-17 04:47:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4216 states and 6781 transitions. [2025-03-17 04:47:04,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-17 04:47:04,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:04,439 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:04,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 04:47:04,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 04:47:04,640 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:04,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:04,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1339660795, now seen corresponding path program 1 times [2025-03-17 04:47:04,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:04,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210361491] [2025-03-17 04:47:04,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:04,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:04,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-17 04:47:04,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-17 04:47:04,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:04,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:05,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:47:05,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:05,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210361491] [2025-03-17 04:47:05,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210361491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:05,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:05,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:47:05,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585884929] [2025-03-17 04:47:05,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:05,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:47:05,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:05,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:47:05,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:05,102 INFO L87 Difference]: Start difference. First operand 4216 states and 6781 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:05,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:05,451 INFO L93 Difference]: Finished difference Result 15362 states and 24922 transitions. [2025-03-17 04:47:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:47:05,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 428 [2025-03-17 04:47:05,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:05,478 INFO L225 Difference]: With dead ends: 15362 [2025-03-17 04:47:05,478 INFO L226 Difference]: Without dead ends: 11174 [2025-03-17 04:47:05,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-17 04:47:05,489 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 598 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:05,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1510 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:47:05,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11174 states. [2025-03-17 04:47:05,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11174 to 8402. [2025-03-17 04:47:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8402 states, 7916 states have (on average 1.6018191005558362) internal successors, (12680), 7929 states have internal predecessors, (12680), 404 states have call successors, (404), 81 states have call predecessors, (404), 81 states have return successors, (404), 391 states have call predecessors, (404), 404 states have call successors, (404) [2025-03-17 04:47:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8402 states to 8402 states and 13488 transitions. [2025-03-17 04:47:05,738 INFO L78 Accepts]: Start accepts. Automaton has 8402 states and 13488 transitions. Word has length 428 [2025-03-17 04:47:05,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:05,739 INFO L471 AbstractCegarLoop]: Abstraction has 8402 states and 13488 transitions. [2025-03-17 04:47:05,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 8402 states and 13488 transitions. [2025-03-17 04:47:05,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-17 04:47:05,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:05,749 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:05,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 04:47:05,749 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:05,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:05,750 INFO L85 PathProgramCache]: Analyzing trace with hash 60598559, now seen corresponding path program 1 times [2025-03-17 04:47:05,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:05,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258903813] [2025-03-17 04:47:05,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:05,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:05,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-17 04:47:06,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-17 04:47:06,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:06,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:47:06,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:06,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258903813] [2025-03-17 04:47:06,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258903813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:06,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:06,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:47:06,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808754149] [2025-03-17 04:47:06,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:06,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:47:06,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:06,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:47:06,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:47:06,691 INFO L87 Difference]: Start difference. First operand 8402 states and 13488 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:07,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:07,320 INFO L93 Difference]: Finished difference Result 32846 states and 53250 transitions. [2025-03-17 04:47:07,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:47:07,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-03-17 04:47:07,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:07,370 INFO L225 Difference]: With dead ends: 32846 [2025-03-17 04:47:07,370 INFO L226 Difference]: Without dead ends: 24472 [2025-03-17 04:47:07,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:47:07,385 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 868 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:07,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1857 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:47:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24472 states. [2025-03-17 04:47:07,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24472 to 12951. [2025-03-17 04:47:07,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12951 states, 12388 states have (on average 1.6060703907006781) internal successors, (19896), 12408 states have internal predecessors, (19896), 460 states have call successors, (460), 102 states have call predecessors, (460), 102 states have return successors, (460), 440 states have call predecessors, (460), 460 states have call successors, (460) [2025-03-17 04:47:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12951 states to 12951 states and 20816 transitions. [2025-03-17 04:47:07,765 INFO L78 Accepts]: Start accepts. Automaton has 12951 states and 20816 transitions. Word has length 429 [2025-03-17 04:47:07,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:07,766 INFO L471 AbstractCegarLoop]: Abstraction has 12951 states and 20816 transitions. [2025-03-17 04:47:07,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:07,767 INFO L276 IsEmpty]: Start isEmpty. Operand 12951 states and 20816 transitions. [2025-03-17 04:47:07,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-17 04:47:07,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:07,779 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:07,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 04:47:07,779 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:07,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1193789152, now seen corresponding path program 1 times [2025-03-17 04:47:07,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:07,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881651770] [2025-03-17 04:47:07,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:07,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:07,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-17 04:47:08,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-17 04:47:08,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:08,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-17 04:47:08,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:08,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881651770] [2025-03-17 04:47:08,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881651770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:08,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:08,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:47:08,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303356938] [2025-03-17 04:47:08,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:08,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:47:08,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:08,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:47:08,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:08,377 INFO L87 Difference]: Start difference. First operand 12951 states and 20816 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:08,753 INFO L93 Difference]: Finished difference Result 33115 states and 53360 transitions. [2025-03-17 04:47:08,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:47:08,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-03-17 04:47:08,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:08,795 INFO L225 Difference]: With dead ends: 33115 [2025-03-17 04:47:08,795 INFO L226 Difference]: Without dead ends: 20165 [2025-03-17 04:47:08,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:08,811 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 452 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:08,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1143 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:47:08,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20165 states. [2025-03-17 04:47:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20165 to 14167. [2025-03-17 04:47:09,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14167 states, 13604 states have (on average 1.6130549838282857) internal successors, (21944), 13624 states have internal predecessors, (21944), 460 states have call successors, (460), 102 states have call predecessors, (460), 102 states have return successors, (460), 440 states have call predecessors, (460), 460 states have call successors, (460) [2025-03-17 04:47:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14167 states to 14167 states and 22864 transitions. [2025-03-17 04:47:09,106 INFO L78 Accepts]: Start accepts. Automaton has 14167 states and 22864 transitions. Word has length 429 [2025-03-17 04:47:09,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:09,107 INFO L471 AbstractCegarLoop]: Abstraction has 14167 states and 22864 transitions. [2025-03-17 04:47:09,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-17 04:47:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 14167 states and 22864 transitions. [2025-03-17 04:47:09,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-17 04:47:09,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:09,121 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:09,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 04:47:09,121 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:09,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:09,122 INFO L85 PathProgramCache]: Analyzing trace with hash -989887775, now seen corresponding path program 1 times [2025-03-17 04:47:09,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:09,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735720444] [2025-03-17 04:47:09,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:09,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:09,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-17 04:47:09,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-17 04:47:09,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:09,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 24 proven. 156 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-17 04:47:10,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:10,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735720444] [2025-03-17 04:47:10,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735720444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:47:10,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887798182] [2025-03-17 04:47:10,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:10,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:47:10,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:47:10,183 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:47:10,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 04:47:10,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-17 04:47:10,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-17 04:47:10,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:10,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:10,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 04:47:10,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:47:10,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 1740 proven. 156 refuted. 0 times theorem prover too weak. 5424 trivial. 0 not checked. [2025-03-17 04:47:10,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:47:11,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 24 proven. 156 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-17 04:47:11,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887798182] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:47:11,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:47:11,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 04:47:11,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475219635] [2025-03-17 04:47:11,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:47:11,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 04:47:11,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:11,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 04:47:11,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:47:11,449 INFO L87 Difference]: Start difference. First operand 14167 states and 22864 transitions. Second operand has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 2 states have call successors, (113), 2 states have call predecessors, (113), 4 states have return successors, (114), 2 states have call predecessors, (114), 2 states have call successors, (114) [2025-03-17 04:47:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:12,012 INFO L93 Difference]: Finished difference Result 23108 states and 37243 transitions. [2025-03-17 04:47:12,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:47:12,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 2 states have call successors, (113), 2 states have call predecessors, (113), 4 states have return successors, (114), 2 states have call predecessors, (114), 2 states have call successors, (114) Word has length 429 [2025-03-17 04:47:12,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:12,032 INFO L225 Difference]: With dead ends: 23108 [2025-03-17 04:47:12,032 INFO L226 Difference]: Without dead ends: 8942 [2025-03-17 04:47:12,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 855 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:47:12,045 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 282 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:12,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 987 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:47:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8942 states. [2025-03-17 04:47:12,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8942 to 8930. [2025-03-17 04:47:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8930 states, 8428 states have (on average 1.578547698149027) internal successors, (13304), 8441 states have internal predecessors, (13304), 404 states have call successors, (404), 97 states have call predecessors, (404), 97 states have return successors, (404), 391 states have call predecessors, (404), 404 states have call successors, (404) [2025-03-17 04:47:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8930 states to 8930 states and 14112 transitions. [2025-03-17 04:47:12,258 INFO L78 Accepts]: Start accepts. Automaton has 8930 states and 14112 transitions. Word has length 429 [2025-03-17 04:47:12,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:12,258 INFO L471 AbstractCegarLoop]: Abstraction has 8930 states and 14112 transitions. [2025-03-17 04:47:12,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 2 states have call successors, (113), 2 states have call predecessors, (113), 4 states have return successors, (114), 2 states have call predecessors, (114), 2 states have call successors, (114) [2025-03-17 04:47:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 8930 states and 14112 transitions. [2025-03-17 04:47:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-17 04:47:12,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:12,270 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:12,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 04:47:12,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:47:12,471 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:12,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:12,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1600691083, now seen corresponding path program 1 times [2025-03-17 04:47:12,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:12,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733866645] [2025-03-17 04:47:12,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:12,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:12,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-17 04:47:13,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-17 04:47:13,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:13,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 36 proven. 144 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-17 04:47:14,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:14,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733866645] [2025-03-17 04:47:14,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733866645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:47:14,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604861783] [2025-03-17 04:47:14,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:14,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:47:14,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:47:14,120 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:47:14,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 04:47:14,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-17 04:47:14,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-17 04:47:14,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:14,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:14,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 04:47:14,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:47:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 2388 proven. 144 refuted. 0 times theorem prover too weak. 4788 trivial. 0 not checked. [2025-03-17 04:47:14,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:47:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 36 proven. 144 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-17 04:47:15,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604861783] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:47:15,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:47:15,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 16 [2025-03-17 04:47:15,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933449301] [2025-03-17 04:47:15,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:47:15,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 04:47:15,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:15,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 04:47:15,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-03-17 04:47:15,427 INFO L87 Difference]: Start difference. First operand 8930 states and 14112 transitions. Second operand has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 2 states have call successors, (109), 2 states have call predecessors, (109), 4 states have return successors, (110), 2 states have call predecessors, (110), 2 states have call successors, (110) [2025-03-17 04:47:17,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:17,353 INFO L93 Difference]: Finished difference Result 27028 states and 42607 transitions. [2025-03-17 04:47:17,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-17 04:47:17,354 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 2 states have call successors, (109), 2 states have call predecessors, (109), 4 states have return successors, (110), 2 states have call predecessors, (110), 2 states have call successors, (110) Word has length 429 [2025-03-17 04:47:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:17,399 INFO L225 Difference]: With dead ends: 27028 [2025-03-17 04:47:17,400 INFO L226 Difference]: Without dead ends: 18126 [2025-03-17 04:47:17,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 897 GetRequests, 852 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=513, Invalid=1557, Unknown=0, NotChecked=0, Total=2070 [2025-03-17 04:47:17,415 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 1459 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 2732 SdHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:17,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 2732 Invalid, 1953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 04:47:17,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18126 states. [2025-03-17 04:47:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18126 to 17553. [2025-03-17 04:47:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17553 states, 16524 states have (on average 1.5630597918179618) internal successors, (25828), 16549 states have internal predecessors, (25828), 816 states have call successors, (816), 212 states have call predecessors, (816), 212 states have return successors, (816), 791 states have call predecessors, (816), 816 states have call successors, (816) [2025-03-17 04:47:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17553 states to 17553 states and 27460 transitions. [2025-03-17 04:47:18,039 INFO L78 Accepts]: Start accepts. Automaton has 17553 states and 27460 transitions. Word has length 429 [2025-03-17 04:47:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:18,039 INFO L471 AbstractCegarLoop]: Abstraction has 17553 states and 27460 transitions. [2025-03-17 04:47:18,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 2 states have call successors, (109), 2 states have call predecessors, (109), 4 states have return successors, (110), 2 states have call predecessors, (110), 2 states have call successors, (110) [2025-03-17 04:47:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 17553 states and 27460 transitions. [2025-03-17 04:47:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-17 04:47:18,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:18,053 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:47:18,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 04:47:18,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 04:47:18,257 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:18,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:18,258 INFO L85 PathProgramCache]: Analyzing trace with hash 157787605, now seen corresponding path program 1 times [2025-03-17 04:47:18,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:18,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260100696] [2025-03-17 04:47:18,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:18,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:18,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-17 04:47:19,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-17 04:47:19,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:19,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 153 proven. 27 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-17 04:47:20,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:20,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260100696] [2025-03-17 04:47:20,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260100696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:47:20,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634628735] [2025-03-17 04:47:20,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:20,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:47:20,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:47:20,183 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:47:20,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 04:47:20,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-17 04:47:20,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-17 04:47:20,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:20,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:20,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 04:47:20,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:47:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 4541 proven. 294 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2025-03-17 04:47:23,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:47:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-17 04:47:25,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634628735] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:47:25,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:47:25,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 21, 12] total 36 [2025-03-17 04:47:25,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276178216] [2025-03-17 04:47:25,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:47:25,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-17 04:47:25,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:25,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-17 04:47:25,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1075, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 04:47:25,682 INFO L87 Difference]: Start difference. First operand 17553 states and 27460 transitions. Second operand has 36 states, 35 states have (on average 9.742857142857142) internal successors, (341), 35 states have internal predecessors, (341), 8 states have call successors, (152), 5 states have call predecessors, (152), 9 states have return successors, (153), 7 states have call predecessors, (153), 8 states have call successors, (153) [2025-03-17 04:47:31,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 04:47:36,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 04:47:39,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 04:47:41,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 04:47:44,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 04:47:46,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 04:47:49,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 04:47:51,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 04:47:55,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 04:47:59,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 04:48:03,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]