./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-11.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-11.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 23501b270359c8bb66bf017123a6b997c736c6bad56bfcdab3d899e8f1555d26 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:47:24,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:47:24,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:47:24,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:47:24,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:47:24,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:47:24,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:47:24,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:47:24,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:47:24,699 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:47:24,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:47:24,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:47:24,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:47:24,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:47:24,701 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:47:24,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:47:24,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:47:24,701 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:47:24,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:47:24,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:47:24,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:47:24,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:47:24,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:47:24,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:47:24,702 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:47:24,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:47:24,702 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:47:24,702 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:47:24,702 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:47:24,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:47:24,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:47:24,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:47:24,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:47:24,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:47:24,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:47:24,703 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:47:24,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:47:24,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:47:24,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:47:24,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:47:24,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:47:24,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:47:24,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:47:24,703 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 -> 23501b270359c8bb66bf017123a6b997c736c6bad56bfcdab3d899e8f1555d26 [2025-03-17 04:47:24,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:47:24,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:47:24,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:47:24,918 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:47:24,918 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:47:24,919 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-11.i [2025-03-17 04:47:26,065 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8afda232f/89f6d2d041144b61b52553ea14f6ef74/FLAG1934bdb57 [2025-03-17 04:47:26,338 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:47:26,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-11.i [2025-03-17 04:47:26,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8afda232f/89f6d2d041144b61b52553ea14f6ef74/FLAG1934bdb57 [2025-03-17 04:47:26,357 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8afda232f/89f6d2d041144b61b52553ea14f6ef74 [2025-03-17 04:47:26,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:47:26,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:47:26,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:47:26,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:47:26,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:47:26,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:47:26" (1/1) ... [2025-03-17 04:47:26,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3528870c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:26, skipping insertion in model container [2025-03-17 04:47:26,367 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:47:26" (1/1) ... [2025-03-17 04:47:26,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:47:26,501 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-11.i[916,929] [2025-03-17 04:47:26,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:47:26,741 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:47:26,750 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-11.i[916,929] [2025-03-17 04:47:26,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:47:26,861 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:47:26,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:26 WrapperNode [2025-03-17 04:47:26,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:47:26,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:47:26,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:47:26,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:47:26,867 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:47:26" (1/1) ... [2025-03-17 04:47:26,882 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:47:26" (1/1) ... [2025-03-17 04:47:26,956 INFO L138 Inliner]: procedures = 26, calls = 82, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 802 [2025-03-17 04:47:26,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:47:26,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:47:26,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:47:26,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:47:26,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:26" (1/1) ... [2025-03-17 04:47:26,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:26" (1/1) ... [2025-03-17 04:47:26,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:26" (1/1) ... [2025-03-17 04:47:27,070 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:47:27,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:26" (1/1) ... [2025-03-17 04:47:27,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:26" (1/1) ... [2025-03-17 04:47:27,102 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:26" (1/1) ... [2025-03-17 04:47:27,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:26" (1/1) ... [2025-03-17 04:47:27,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:26" (1/1) ... [2025-03-17 04:47:27,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:26" (1/1) ... [2025-03-17 04:47:27,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:47:27,136 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:47:27,136 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:47:27,136 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:47:27,137 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:26" (1/1) ... [2025-03-17 04:47:27,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:47:27,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:47:27,161 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:47:27,165 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:47:27,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:47:27,179 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:47:27,180 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:47:27,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:47:27,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:47:27,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:47:27,309 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:47:27,310 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:47:28,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L660: havoc property_#t~bitwise54#1;havoc property_#t~bitwise55#1;havoc property_#t~bitwise56#1;havoc property_#t~short57#1;havoc property_#t~bitwise58#1;havoc property_#t~short59#1;havoc property_#t~ite61#1;havoc property_#t~bitwise60#1;havoc property_#t~short62#1;havoc property_#t~ite64#1;havoc property_#t~bitwise63#1;havoc property_#t~short65#1;havoc property_#t~bitwise66#1;havoc property_#t~short67#1;havoc property_#t~ite69#1;havoc property_#t~bitwise68#1;havoc property_#t~short70#1;havoc property_#t~ite72#1;havoc property_#t~bitwise71#1;havoc property_#t~short73#1; [2025-03-17 04:47:28,320 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-03-17 04:47:28,320 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:47:28,348 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:47:28,349 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:47:28,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:47:28 BoogieIcfgContainer [2025-03-17 04:47:28,349 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:47:28,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:47:28,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:47:28,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:47:28,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:47:26" (1/3) ... [2025-03-17 04:47:28,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edd3374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:47:28, skipping insertion in model container [2025-03-17 04:47:28,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:26" (2/3) ... [2025-03-17 04:47:28,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edd3374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:47:28, skipping insertion in model container [2025-03-17 04:47:28,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:47:28" (3/3) ... [2025-03-17 04:47:28,355 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-11.i [2025-03-17 04:47:28,365 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:47:28,367 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-11.i that has 2 procedures, 312 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:47:28,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:47:28,425 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;@7cb95ad6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:47:28,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:47:28,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 312 states, 240 states have (on average 1.55) internal successors, (372), 241 states have internal predecessors, (372), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-17 04:47:28,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-03-17 04:47:28,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:28,450 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:28,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:28,456 INFO L85 PathProgramCache]: Analyzing trace with hash 127160436, now seen corresponding path program 1 times [2025-03-17 04:47:28,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:28,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212178462] [2025-03-17 04:47:28,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:28,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:28,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-03-17 04:47:28,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-03-17 04:47:28,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:28,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2025-03-17 04:47:29,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:29,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212178462] [2025-03-17 04:47:29,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212178462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:47:29,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109451643] [2025-03-17 04:47:29,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:29,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:47:29,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:47:29,078 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:47:29,080 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:47:29,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-03-17 04:47:29,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-03-17 04:47:29,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:29,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:29,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:47:29,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:47:29,466 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2025-03-17 04:47:29,466 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:47:29,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109451643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:29,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:47:29,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:47:29,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592069125] [2025-03-17 04:47:29,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:29,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:47:29,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:29,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:47:29,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:47:29,498 INFO L87 Difference]: Start difference. First operand has 312 states, 240 states have (on average 1.55) internal successors, (372), 241 states have internal predecessors, (372), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) [2025-03-17 04:47:29,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:29,569 INFO L93 Difference]: Finished difference Result 621 states and 1087 transitions. [2025-03-17 04:47:29,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:47:29,573 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) Word has length 488 [2025-03-17 04:47:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:29,580 INFO L225 Difference]: With dead ends: 621 [2025-03-17 04:47:29,581 INFO L226 Difference]: Without dead ends: 310 [2025-03-17 04:47:29,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 489 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:47:29,593 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:29,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:47:29,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-17 04:47:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2025-03-17 04:47:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 239 states have (on average 1.5355648535564854) internal successors, (367), 239 states have internal predecessors, (367), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-17 04:47:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 505 transitions. [2025-03-17 04:47:29,658 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 505 transitions. Word has length 488 [2025-03-17 04:47:29,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:29,658 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 505 transitions. [2025-03-17 04:47:29,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) [2025-03-17 04:47:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 505 transitions. [2025-03-17 04:47:29,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-03-17 04:47:29,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:29,672 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,681 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:47:29,873 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:47:29,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:29,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:29,874 INFO L85 PathProgramCache]: Analyzing trace with hash 545346587, now seen corresponding path program 1 times [2025-03-17 04:47:29,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:29,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930101962] [2025-03-17 04:47:29,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:29,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:29,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-03-17 04:47:30,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-03-17 04:47:30,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:30,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:30,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-17 04:47:30,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:30,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930101962] [2025-03-17 04:47:30,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930101962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:30,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:30,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:47:30,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242321968] [2025-03-17 04:47:30,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:30,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:47:30,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:30,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:47:30,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:47:30,338 INFO L87 Difference]: Start difference. First operand 310 states and 505 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:30,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:30,517 INFO L93 Difference]: Finished difference Result 913 states and 1489 transitions. [2025-03-17 04:47:30,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:47:30,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 488 [2025-03-17 04:47:30,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:30,525 INFO L225 Difference]: With dead ends: 913 [2025-03-17 04:47:30,525 INFO L226 Difference]: Without dead ends: 604 [2025-03-17 04:47:30,526 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:47:30,529 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 444 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:30,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 936 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:47:30,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-17 04:47:30,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 602. [2025-03-17 04:47:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 461 states have (on average 1.5206073752711498) internal successors, (701), 461 states have internal predecessors, (701), 138 states have call successors, (138), 2 states have call predecessors, (138), 2 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2025-03-17 04:47:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 977 transitions. [2025-03-17 04:47:30,593 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 977 transitions. Word has length 488 [2025-03-17 04:47:30,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:30,596 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 977 transitions. [2025-03-17 04:47:30,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:30,597 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 977 transitions. [2025-03-17 04:47:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-03-17 04:47:30,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:30,601 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:47:30,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:30,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:30,602 INFO L85 PathProgramCache]: Analyzing trace with hash -216862277, now seen corresponding path program 1 times [2025-03-17 04:47:30,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:30,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936341812] [2025-03-17 04:47:30,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:30,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:30,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-03-17 04:47:30,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-03-17 04:47:30,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:30,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-17 04:47:31,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:31,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936341812] [2025-03-17 04:47:31,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936341812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:31,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:31,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:47:31,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364321572] [2025-03-17 04:47:31,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:31,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:47:31,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:31,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:47:31,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:47:31,018 INFO L87 Difference]: Start difference. First operand 602 states and 977 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:31,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:31,175 INFO L93 Difference]: Finished difference Result 1206 states and 1956 transitions. [2025-03-17 04:47:31,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:47:31,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 488 [2025-03-17 04:47:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:31,182 INFO L225 Difference]: With dead ends: 1206 [2025-03-17 04:47:31,184 INFO L226 Difference]: Without dead ends: 605 [2025-03-17 04:47:31,185 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:47:31,186 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 420 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:31,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1263 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:47:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-17 04:47:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2025-03-17 04:47:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 462 states have (on average 1.5064935064935066) internal successors, (696), 462 states have internal predecessors, (696), 138 states have call successors, (138), 2 states have call predecessors, (138), 2 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2025-03-17 04:47:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 972 transitions. [2025-03-17 04:47:31,233 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 972 transitions. Word has length 488 [2025-03-17 04:47:31,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:31,234 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 972 transitions. [2025-03-17 04:47:31,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 972 transitions. [2025-03-17 04:47:31,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-03-17 04:47:31,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:31,237 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:47:31,237 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:31,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:31,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1372187137, now seen corresponding path program 1 times [2025-03-17 04:47:31,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:31,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816066859] [2025-03-17 04:47:31,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:31,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:31,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-03-17 04:47:31,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-03-17 04:47:31,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:31,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-17 04:47:31,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:31,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816066859] [2025-03-17 04:47:31,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816066859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:31,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:31,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:47:31,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949518488] [2025-03-17 04:47:31,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:31,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:47:31,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:31,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:47:31,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:47:31,526 INFO L87 Difference]: Start difference. First operand 603 states and 972 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:31,655 INFO L93 Difference]: Finished difference Result 1803 states and 2906 transitions. [2025-03-17 04:47:31,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:47:31,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 489 [2025-03-17 04:47:31,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:31,663 INFO L225 Difference]: With dead ends: 1803 [2025-03-17 04:47:31,663 INFO L226 Difference]: Without dead ends: 1201 [2025-03-17 04:47:31,665 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:47:31,666 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 434 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:31,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1153 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:47:31,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2025-03-17 04:47:31,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 790. [2025-03-17 04:47:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 649 states have (on average 1.546995377503852) internal successors, (1004), 649 states have internal predecessors, (1004), 138 states have call successors, (138), 2 states have call predecessors, (138), 2 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2025-03-17 04:47:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1280 transitions. [2025-03-17 04:47:31,737 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1280 transitions. Word has length 489 [2025-03-17 04:47:31,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:31,738 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1280 transitions. [2025-03-17 04:47:31,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1280 transitions. [2025-03-17 04:47:31,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-03-17 04:47:31,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:31,742 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:47:31,742 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:31,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:31,743 INFO L85 PathProgramCache]: Analyzing trace with hash 739103232, now seen corresponding path program 1 times [2025-03-17 04:47:31,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:31,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237045850] [2025-03-17 04:47:31,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:31,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:31,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-03-17 04:47:31,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-03-17 04:47:31,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:31,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-17 04:47:32,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:32,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237045850] [2025-03-17 04:47:32,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237045850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:32,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:32,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:47:32,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316012455] [2025-03-17 04:47:32,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:32,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:47:32,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:32,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:47:32,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:32,173 INFO L87 Difference]: Start difference. First operand 790 states and 1280 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:32,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:32,340 INFO L93 Difference]: Finished difference Result 1906 states and 3084 transitions. [2025-03-17 04:47:32,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:47:32,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 489 [2025-03-17 04:47:32,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:32,348 INFO L225 Difference]: With dead ends: 1906 [2025-03-17 04:47:32,348 INFO L226 Difference]: Without dead ends: 1117 [2025-03-17 04:47:32,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:32,351 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 183 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:32,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1391 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:47:32,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-03-17 04:47:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1016. [2025-03-17 04:47:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 875 states have (on average 1.584) internal successors, (1386), 875 states have internal predecessors, (1386), 138 states have call successors, (138), 2 states have call predecessors, (138), 2 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2025-03-17 04:47:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1662 transitions. [2025-03-17 04:47:32,403 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1662 transitions. Word has length 489 [2025-03-17 04:47:32,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:32,404 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1662 transitions. [2025-03-17 04:47:32,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1662 transitions. [2025-03-17 04:47:32,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-03-17 04:47:32,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:32,410 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:47:32,411 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:32,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:32,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1292202443, now seen corresponding path program 1 times [2025-03-17 04:47:32,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:32,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705713155] [2025-03-17 04:47:32,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:32,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:32,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-03-17 04:47:32,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-03-17 04:47:32,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:32,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-17 04:47:33,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:33,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705713155] [2025-03-17 04:47:33,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705713155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:33,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:33,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:47:33,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881682534] [2025-03-17 04:47:33,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:33,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:47:33,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:33,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:47:33,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:33,327 INFO L87 Difference]: Start difference. First operand 1016 states and 1662 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:33,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:33,624 INFO L93 Difference]: Finished difference Result 3009 states and 4919 transitions. [2025-03-17 04:47:33,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:47:33,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 490 [2025-03-17 04:47:33,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:33,635 INFO L225 Difference]: With dead ends: 3009 [2025-03-17 04:47:33,635 INFO L226 Difference]: Without dead ends: 1994 [2025-03-17 04:47:33,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:33,638 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 674 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:33,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1257 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:47:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2025-03-17 04:47:33,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1324. [2025-03-17 04:47:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1183 states have (on average 1.6094674556213018) internal successors, (1904), 1183 states have internal predecessors, (1904), 138 states have call successors, (138), 2 states have call predecessors, (138), 2 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2025-03-17 04:47:33,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 2180 transitions. [2025-03-17 04:47:33,706 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 2180 transitions. Word has length 490 [2025-03-17 04:47:33,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:33,706 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 2180 transitions. [2025-03-17 04:47:33,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:33,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 2180 transitions. [2025-03-17 04:47:33,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-03-17 04:47:33,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:33,710 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:47:33,711 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:33,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:33,711 INFO L85 PathProgramCache]: Analyzing trace with hash -159011850, now seen corresponding path program 1 times [2025-03-17 04:47:33,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:33,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871920973] [2025-03-17 04:47:33,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:33,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:33,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-03-17 04:47:33,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-03-17 04:47:33,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:33,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-17 04:47:34,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:34,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871920973] [2025-03-17 04:47:34,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871920973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:34,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:34,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:47:34,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469514733] [2025-03-17 04:47:34,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:34,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:47:34,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:34,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:47:34,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:34,692 INFO L87 Difference]: Start difference. First operand 1324 states and 2180 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:35,126 INFO L93 Difference]: Finished difference Result 3834 states and 6317 transitions. [2025-03-17 04:47:35,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:47:35,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 490 [2025-03-17 04:47:35,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:35,136 INFO L225 Difference]: With dead ends: 3834 [2025-03-17 04:47:35,136 INFO L226 Difference]: Without dead ends: 2511 [2025-03-17 04:47:35,139 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:35,140 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 406 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:35,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1395 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:47:35,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2025-03-17 04:47:35,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2472. [2025-03-17 04:47:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 2261 states have (on average 1.6218487394957983) internal successors, (3667), 2261 states have internal predecessors, (3667), 207 states have call successors, (207), 3 states have call predecessors, (207), 3 states have return successors, (207), 207 states have call predecessors, (207), 207 states have call successors, (207) [2025-03-17 04:47:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 4081 transitions. [2025-03-17 04:47:35,216 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 4081 transitions. Word has length 490 [2025-03-17 04:47:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:35,216 INFO L471 AbstractCegarLoop]: Abstraction has 2472 states and 4081 transitions. [2025-03-17 04:47:35,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 4081 transitions. [2025-03-17 04:47:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 04:47:35,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:35,220 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:47:35,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:35,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:35,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1967216457, now seen corresponding path program 1 times [2025-03-17 04:47:35,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:35,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618396298] [2025-03-17 04:47:35,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:35,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:35,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 04:47:35,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 04:47:35,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:35,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:37,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-17 04:47:37,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:37,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618396298] [2025-03-17 04:47:37,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618396298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:37,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:37,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 04:47:37,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050768207] [2025-03-17 04:47:37,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:37,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 04:47:37,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:37,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 04:47:37,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:47:37,361 INFO L87 Difference]: Start difference. First operand 2472 states and 4081 transitions. Second operand has 10 states, 10 states have (on average 14.9) internal successors, (149), 10 states have internal predecessors, (149), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-03-17 04:47:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:39,669 INFO L93 Difference]: Finished difference Result 8623 states and 14244 transitions. [2025-03-17 04:47:39,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 04:47:39,669 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.9) internal successors, (149), 10 states have internal predecessors, (149), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) Word has length 491 [2025-03-17 04:47:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:39,693 INFO L225 Difference]: With dead ends: 8623 [2025-03-17 04:47:39,694 INFO L226 Difference]: Without dead ends: 6938 [2025-03-17 04:47:39,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2025-03-17 04:47:39,701 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 1967 mSDsluCounter, 3803 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1967 SdHoareTripleChecker+Valid, 4602 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:39,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1967 Valid, 4602 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 04:47:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6938 states. [2025-03-17 04:47:39,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6938 to 3701. [2025-03-17 04:47:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3701 states, 3376 states have (on average 1.6140402843601895) internal successors, (5449), 3378 states have internal predecessors, (5449), 319 states have call successors, (319), 5 states have call predecessors, (319), 5 states have return successors, (319), 317 states have call predecessors, (319), 319 states have call successors, (319) [2025-03-17 04:47:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 6087 transitions. [2025-03-17 04:47:39,891 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 6087 transitions. Word has length 491 [2025-03-17 04:47:39,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:39,893 INFO L471 AbstractCegarLoop]: Abstraction has 3701 states and 6087 transitions. [2025-03-17 04:47:39,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.9) internal successors, (149), 10 states have internal predecessors, (149), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-03-17 04:47:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 6087 transitions. [2025-03-17 04:47:39,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 04:47:39,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:39,899 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:47:39,899 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:39,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:39,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1758518154, now seen corresponding path program 1 times [2025-03-17 04:47:39,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:39,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029444043] [2025-03-17 04:47:39,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:39,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:39,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 04:47:40,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 04:47:40,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:40,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-17 04:47:40,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:40,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029444043] [2025-03-17 04:47:40,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029444043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:40,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:40,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:47:40,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079563109] [2025-03-17 04:47:40,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:40,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:47:40,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:40,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:47:40,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:40,600 INFO L87 Difference]: Start difference. First operand 3701 states and 6087 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:40,902 INFO L93 Difference]: Finished difference Result 9169 states and 15021 transitions. [2025-03-17 04:47:40,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:47:40,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 491 [2025-03-17 04:47:40,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:40,928 INFO L225 Difference]: With dead ends: 9169 [2025-03-17 04:47:40,929 INFO L226 Difference]: Without dead ends: 6380 [2025-03-17 04:47:40,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:40,938 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 301 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:40,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1735 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:47:40,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6380 states. [2025-03-17 04:47:41,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6380 to 5961. [2025-03-17 04:47:41,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5961 states, 5540 states have (on average 1.601985559566787) internal successors, (8875), 5546 states have internal predecessors, (8875), 411 states have call successors, (411), 9 states have call predecessors, (411), 9 states have return successors, (411), 405 states have call predecessors, (411), 411 states have call successors, (411) [2025-03-17 04:47:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5961 states to 5961 states and 9697 transitions. [2025-03-17 04:47:41,144 INFO L78 Accepts]: Start accepts. Automaton has 5961 states and 9697 transitions. Word has length 491 [2025-03-17 04:47:41,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:41,146 INFO L471 AbstractCegarLoop]: Abstraction has 5961 states and 9697 transitions. [2025-03-17 04:47:41,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:41,147 INFO L276 IsEmpty]: Start isEmpty. Operand 5961 states and 9697 transitions. [2025-03-17 04:47:41,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-03-17 04:47:41,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:41,175 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:47:41,175 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:41,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:41,176 INFO L85 PathProgramCache]: Analyzing trace with hash -548494171, now seen corresponding path program 1 times [2025-03-17 04:47:41,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:41,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112432484] [2025-03-17 04:47:41,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:41,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:41,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-03-17 04:47:41,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-03-17 04:47:41,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:41,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-17 04:47:42,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:42,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112432484] [2025-03-17 04:47:42,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112432484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:42,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:42,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:47:42,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143214874] [2025-03-17 04:47:42,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:42,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:47:42,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:42,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:47:42,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:47:42,016 INFO L87 Difference]: Start difference. First operand 5961 states and 9697 transitions. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:42,748 INFO L93 Difference]: Finished difference Result 11839 states and 19112 transitions. [2025-03-17 04:47:42,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:47:42,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 492 [2025-03-17 04:47:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:42,787 INFO L225 Difference]: With dead ends: 11839 [2025-03-17 04:47:42,788 INFO L226 Difference]: Without dead ends: 8115 [2025-03-17 04:47:42,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:47:42,799 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 1519 mSDsluCounter, 1714 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:42,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 2173 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:47:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8115 states. [2025-03-17 04:47:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8115 to 7637. [2025-03-17 04:47:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7637 states, 7216 states have (on average 1.6079545454545454) internal successors, (11603), 7222 states have internal predecessors, (11603), 411 states have call successors, (411), 9 states have call predecessors, (411), 9 states have return successors, (411), 405 states have call predecessors, (411), 411 states have call successors, (411) [2025-03-17 04:47:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7637 states to 7637 states and 12425 transitions. [2025-03-17 04:47:43,053 INFO L78 Accepts]: Start accepts. Automaton has 7637 states and 12425 transitions. Word has length 492 [2025-03-17 04:47:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:43,054 INFO L471 AbstractCegarLoop]: Abstraction has 7637 states and 12425 transitions. [2025-03-17 04:47:43,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 7637 states and 12425 transitions. [2025-03-17 04:47:43,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2025-03-17 04:47:43,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:43,065 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 04:47:43,065 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:43,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:43,066 INFO L85 PathProgramCache]: Analyzing trace with hash -42044816, now seen corresponding path program 1 times [2025-03-17 04:47:43,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:43,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117534816] [2025-03-17 04:47:43,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:43,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:43,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes. [2025-03-17 04:47:43,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements. [2025-03-17 04:47:43,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:43,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-17 04:47:44,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:44,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117534816] [2025-03-17 04:47:44,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117534816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:44,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:44,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 04:47:44,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509452863] [2025-03-17 04:47:44,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:44,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 04:47:44,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:44,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 04:47:44,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:47:44,427 INFO L87 Difference]: Start difference. First operand 7637 states and 12425 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:45,882 INFO L93 Difference]: Finished difference Result 26927 states and 44056 transitions. [2025-03-17 04:47:45,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 04:47:45,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 493 [2025-03-17 04:47:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:45,931 INFO L225 Difference]: With dead ends: 26927 [2025-03-17 04:47:45,931 INFO L226 Difference]: Without dead ends: 23789 [2025-03-17 04:47:45,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-17 04:47:45,950 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 2024 mSDsluCounter, 2229 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2024 SdHoareTripleChecker+Valid, 2875 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:45,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2024 Valid, 2875 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 04:47:45,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23789 states. [2025-03-17 04:47:46,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23789 to 11165. [2025-03-17 04:47:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11165 states, 10744 states have (on average 1.6257446016381236) internal successors, (17467), 10750 states have internal predecessors, (17467), 411 states have call successors, (411), 9 states have call predecessors, (411), 9 states have return successors, (411), 405 states have call predecessors, (411), 411 states have call successors, (411) [2025-03-17 04:47:46,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11165 states to 11165 states and 18289 transitions. [2025-03-17 04:47:46,296 INFO L78 Accepts]: Start accepts. Automaton has 11165 states and 18289 transitions. Word has length 493 [2025-03-17 04:47:46,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:46,297 INFO L471 AbstractCegarLoop]: Abstraction has 11165 states and 18289 transitions. [2025-03-17 04:47:46,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:46,297 INFO L276 IsEmpty]: Start isEmpty. Operand 11165 states and 18289 transitions. [2025-03-17 04:47:46,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2025-03-17 04:47:46,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:46,312 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 04:47:46,312 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:46,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:46,313 INFO L85 PathProgramCache]: Analyzing trace with hash 401566607, now seen corresponding path program 1 times [2025-03-17 04:47:46,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:46,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708877237] [2025-03-17 04:47:46,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:46,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:46,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes. [2025-03-17 04:47:46,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements. [2025-03-17 04:47:46,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:46,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-17 04:47:47,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:47,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708877237] [2025-03-17 04:47:47,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708877237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:47,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:47,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:47:47,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312995168] [2025-03-17 04:47:47,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:47,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:47:47,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:47,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:47:47,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:47,024 INFO L87 Difference]: Start difference. First operand 11165 states and 18289 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:47,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:47,531 INFO L93 Difference]: Finished difference Result 21949 states and 35955 transitions. [2025-03-17 04:47:47,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:47:47,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 493 [2025-03-17 04:47:47,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:47,556 INFO L225 Difference]: With dead ends: 21949 [2025-03-17 04:47:47,556 INFO L226 Difference]: Without dead ends: 11241 [2025-03-17 04:47:47,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:47:47,572 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 418 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:47,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1417 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:47:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11241 states. [2025-03-17 04:47:47,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11241 to 11165. [2025-03-17 04:47:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11165 states, 10744 states have (on average 1.6223938942665674) internal successors, (17431), 10750 states have internal predecessors, (17431), 411 states have call successors, (411), 9 states have call predecessors, (411), 9 states have return successors, (411), 405 states have call predecessors, (411), 411 states have call successors, (411) [2025-03-17 04:47:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11165 states to 11165 states and 18253 transitions. [2025-03-17 04:47:47,811 INFO L78 Accepts]: Start accepts. Automaton has 11165 states and 18253 transitions. Word has length 493 [2025-03-17 04:47:47,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:47,812 INFO L471 AbstractCegarLoop]: Abstraction has 11165 states and 18253 transitions. [2025-03-17 04:47:47,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:47,812 INFO L276 IsEmpty]: Start isEmpty. Operand 11165 states and 18253 transitions. [2025-03-17 04:47:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-17 04:47:47,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:47,828 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 04:47:47,828 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:47,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:47,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1325117580, now seen corresponding path program 1 times [2025-03-17 04:47:47,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:47,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418056880] [2025-03-17 04:47:47,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:47,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:47,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-17 04:47:47,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-17 04:47:47,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:47,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-17 04:47:48,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:48,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418056880] [2025-03-17 04:47:48,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418056880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:48,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:48,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:47:48,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351833739] [2025-03-17 04:47:48,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:48,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:47:48,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:48,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:47:48,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:48,181 INFO L87 Difference]: Start difference. First operand 11165 states and 18253 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:48,673 INFO L93 Difference]: Finished difference Result 25729 states and 41968 transitions. [2025-03-17 04:47:48,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:47:48,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 494 [2025-03-17 04:47:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:48,709 INFO L225 Difference]: With dead ends: 25729 [2025-03-17 04:47:48,709 INFO L226 Difference]: Without dead ends: 15021 [2025-03-17 04:47:48,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:47:48,728 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 663 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:48,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 1527 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:47:48,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15021 states. [2025-03-17 04:47:49,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15021 to 14839. [2025-03-17 04:47:49,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14839 states, 14068 states have (on average 1.6055587148137618) internal successors, (22587), 14080 states have internal predecessors, (22587), 753 states have call successors, (753), 17 states have call predecessors, (753), 17 states have return successors, (753), 741 states have call predecessors, (753), 753 states have call successors, (753) [2025-03-17 04:47:49,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14839 states to 14839 states and 24093 transitions. [2025-03-17 04:47:49,228 INFO L78 Accepts]: Start accepts. Automaton has 14839 states and 24093 transitions. Word has length 494 [2025-03-17 04:47:49,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:49,229 INFO L471 AbstractCegarLoop]: Abstraction has 14839 states and 24093 transitions. [2025-03-17 04:47:49,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 14839 states and 24093 transitions. [2025-03-17 04:47:49,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2025-03-17 04:47:49,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:49,251 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 04:47:49,251 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:49,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:49,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1286481962, now seen corresponding path program 1 times [2025-03-17 04:47:49,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:49,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660162455] [2025-03-17 04:47:49,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:49,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:49,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-03-17 04:47:49,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-03-17 04:47:49,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:49,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:50,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-17 04:47:50,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:50,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660162455] [2025-03-17 04:47:50,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660162455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:50,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:50,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:47:50,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166519935] [2025-03-17 04:47:50,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:50,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:47:50,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:50,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:47:50,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:47:50,594 INFO L87 Difference]: Start difference. First operand 14839 states and 24093 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:51,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:51,658 INFO L93 Difference]: Finished difference Result 25249 states and 40870 transitions. [2025-03-17 04:47:51,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:47:51,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 495 [2025-03-17 04:47:51,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:51,694 INFO L225 Difference]: With dead ends: 25249 [2025-03-17 04:47:51,695 INFO L226 Difference]: Without dead ends: 18665 [2025-03-17 04:47:51,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:47:51,707 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 913 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:51,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 2048 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 04:47:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18665 states. [2025-03-17 04:47:52,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18665 to 14113. [2025-03-17 04:47:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14113 states, 13342 states have (on average 1.6026832558836757) internal successors, (21383), 13354 states have internal predecessors, (21383), 753 states have call successors, (753), 17 states have call predecessors, (753), 17 states have return successors, (753), 741 states have call predecessors, (753), 753 states have call successors, (753) [2025-03-17 04:47:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14113 states to 14113 states and 22889 transitions. [2025-03-17 04:47:52,162 INFO L78 Accepts]: Start accepts. Automaton has 14113 states and 22889 transitions. Word has length 495 [2025-03-17 04:47:52,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:52,163 INFO L471 AbstractCegarLoop]: Abstraction has 14113 states and 22889 transitions. [2025-03-17 04:47:52,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:52,163 INFO L276 IsEmpty]: Start isEmpty. Operand 14113 states and 22889 transitions. [2025-03-17 04:47:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-17 04:47:52,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:52,181 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 04:47:52,181 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:52,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:52,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1724746319, now seen corresponding path program 1 times [2025-03-17 04:47:52,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:52,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448571560] [2025-03-17 04:47:52,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:52,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:52,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-17 04:47:52,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-17 04:47:52,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:52,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:53,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-17 04:47:53,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:53,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448571560] [2025-03-17 04:47:53,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448571560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:53,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:53,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:47:53,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902429608] [2025-03-17 04:47:53,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:53,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:47:53,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:53,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:47:53,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:47:53,130 INFO L87 Difference]: Start difference. First operand 14113 states and 22889 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:53,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:53,910 INFO L93 Difference]: Finished difference Result 26207 states and 42525 transitions. [2025-03-17 04:47:53,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:47:53,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 496 [2025-03-17 04:47:53,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:53,940 INFO L225 Difference]: With dead ends: 26207 [2025-03-17 04:47:53,941 INFO L226 Difference]: Without dead ends: 12969 [2025-03-17 04:47:53,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:47:53,961 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 773 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:53,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1734 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 04:47:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12969 states. [2025-03-17 04:47:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12969 to 9845. [2025-03-17 04:47:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9845 states, 9236 states have (on average 1.6021004763967086) internal successors, (14797), 9244 states have internal predecessors, (14797), 595 states have call successors, (595), 13 states have call predecessors, (595), 13 states have return successors, (595), 587 states have call predecessors, (595), 595 states have call successors, (595) [2025-03-17 04:47:54,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 15987 transitions. [2025-03-17 04:47:54,231 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 15987 transitions. Word has length 496 [2025-03-17 04:47:54,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:54,231 INFO L471 AbstractCegarLoop]: Abstraction has 9845 states and 15987 transitions. [2025-03-17 04:47:54,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:54,232 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 15987 transitions. [2025-03-17 04:47:54,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-03-17 04:47:54,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:54,241 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 04:47:54,241 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:54,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:54,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1170453198, now seen corresponding path program 1 times [2025-03-17 04:47:54,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:54,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019266060] [2025-03-17 04:47:54,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:54,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:54,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-03-17 04:47:54,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-03-17 04:47:54,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:54,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-17 04:47:55,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:55,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019266060] [2025-03-17 04:47:55,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019266060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:55,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:55,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:47:55,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267333754] [2025-03-17 04:47:55,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:55,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:47:55,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:55,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:47:55,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:55,201 INFO L87 Difference]: Start difference. First operand 9845 states and 15987 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:55,696 INFO L93 Difference]: Finished difference Result 19791 states and 32097 transitions. [2025-03-17 04:47:55,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:47:55,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 497 [2025-03-17 04:47:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:55,721 INFO L225 Difference]: With dead ends: 19791 [2025-03-17 04:47:55,721 INFO L226 Difference]: Without dead ends: 10066 [2025-03-17 04:47:55,736 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:55,736 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 417 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:55,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1411 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:47:55,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10066 states. [2025-03-17 04:47:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10066 to 9844. [2025-03-17 04:47:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9844 states, 9235 states have (on average 1.6019491066594478) internal successors, (14794), 9243 states have internal predecessors, (14794), 595 states have call successors, (595), 13 states have call predecessors, (595), 13 states have return successors, (595), 587 states have call predecessors, (595), 595 states have call successors, (595) [2025-03-17 04:47:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9844 states to 9844 states and 15984 transitions. [2025-03-17 04:47:55,983 INFO L78 Accepts]: Start accepts. Automaton has 9844 states and 15984 transitions. Word has length 497 [2025-03-17 04:47:55,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:55,984 INFO L471 AbstractCegarLoop]: Abstraction has 9844 states and 15984 transitions. [2025-03-17 04:47:55,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-17 04:47:55,985 INFO L276 IsEmpty]: Start isEmpty. Operand 9844 states and 15984 transitions. [2025-03-17 04:47:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-03-17 04:47:55,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:55,991 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 04:47:55,992 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:55,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:55,992 INFO L85 PathProgramCache]: Analyzing trace with hash -5889716, now seen corresponding path program 1 times [2025-03-17 04:47:55,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:55,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630524731] [2025-03-17 04:47:55,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:55,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:56,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-03-17 04:47:57,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-03-17 04:47:57,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:57,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat