./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-67.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6953ac45278a08a3cd7aa6bba766924b380e26c77e34faa3b5c408a0e5b4f283 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:25:15,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:25:15,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:25:15,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:25:15,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:25:15,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:25:15,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:25:15,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:25:15,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:25:15,805 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:25:15,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:25:15,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:25:15,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:25:15,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:25:15,806 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:25:15,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:25:15,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:25:15,807 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:25:15,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:25:15,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:25:15,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:25:15,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:25:15,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:25:15,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:25:15,807 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:25:15,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:25:15,808 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:25:15,808 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:25:15,808 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:25:15,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:25:15,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:25:15,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:25:15,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:25:15,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:25:15,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:25:15,808 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:25:15,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:25:15,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:25:15,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:25:15,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:25:15,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:25:15,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:25:15,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:25:15,808 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 -> 6953ac45278a08a3cd7aa6bba766924b380e26c77e34faa3b5c408a0e5b4f283 [2025-03-08 15:25:16,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:25:16,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:25:16,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:25:16,055 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:25:16,056 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:25:16,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-67.i [2025-03-08 15:25:17,214 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38b356df/db5043127bcd43f4b39bbc405e5ab135/FLAG881d53b26 [2025-03-08 15:25:17,460 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:25:17,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-67.i [2025-03-08 15:25:17,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38b356df/db5043127bcd43f4b39bbc405e5ab135/FLAG881d53b26 [2025-03-08 15:25:17,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38b356df/db5043127bcd43f4b39bbc405e5ab135 [2025-03-08 15:25:17,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:25:17,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:25:17,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:25:17,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:25:17,483 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:25:17,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:25:17" (1/1) ... [2025-03-08 15:25:17,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d463407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:25:17, skipping insertion in model container [2025-03-08 15:25:17,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:25:17" (1/1) ... [2025-03-08 15:25:17,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:25:17,604 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-67.i[916,929] [2025-03-08 15:25:17,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:25:17,711 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:25:17,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-67.i[916,929] [2025-03-08 15:25:17,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:25:17,786 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:25:17,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:25:17 WrapperNode [2025-03-08 15:25:17,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:25:17,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:25:17,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:25:17,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:25:17,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:25:17" (1/1) ... [2025-03-08 15:25:17,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:25:17" (1/1) ... [2025-03-08 15:25:17,836 INFO L138 Inliner]: procedures = 26, calls = 65, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 540 [2025-03-08 15:25:17,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:25:17,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:25:17,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:25:17,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:25:17,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:25:17" (1/1) ... [2025-03-08 15:25:17,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:25:17" (1/1) ... [2025-03-08 15:25:17,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:25:17" (1/1) ... [2025-03-08 15:25:17,883 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:25:17,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:25:17" (1/1) ... [2025-03-08 15:25:17,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:25:17" (1/1) ... [2025-03-08 15:25:17,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:25:17" (1/1) ... [2025-03-08 15:25:17,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:25:17" (1/1) ... [2025-03-08 15:25:17,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:25:17" (1/1) ... [2025-03-08 15:25:17,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:25:17" (1/1) ... [2025-03-08 15:25:17,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:25:17,929 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:25:17,930 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:25:17,930 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:25:17,931 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:25:17" (1/1) ... [2025-03-08 15:25:17,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:25:17,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:25:17,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:25:17,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:25:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:25:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:25:17,987 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:25:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:25:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:25:17,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:25:18,071 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:25:18,072 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:25:18,715 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L365: havoc property_#t~bitwise43#1;havoc property_#t~bitwise44#1;havoc property_#t~short45#1;havoc property_#t~bitwise46#1;havoc property_#t~bitwise47#1;havoc property_#t~ite50#1;havoc property_#t~bitwise48#1;havoc property_#t~bitwise49#1;havoc property_#t~short51#1;havoc property_#t~bitwise52#1;havoc property_#t~bitwise53#1;havoc property_#t~short54#1;havoc property_#t~ite56#1;havoc property_#t~bitwise55#1;havoc property_#t~short57#1; [2025-03-08 15:25:18,793 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-03-08 15:25:18,794 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:25:18,827 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:25:18,830 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:25:18,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:25:18 BoogieIcfgContainer [2025-03-08 15:25:18,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:25:18,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:25:18,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:25:18,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:25:18,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:25:17" (1/3) ... [2025-03-08 15:25:18,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646a2eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:25:18, skipping insertion in model container [2025-03-08 15:25:18,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:25:17" (2/3) ... [2025-03-08 15:25:18,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646a2eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:25:18, skipping insertion in model container [2025-03-08 15:25:18,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:25:18" (3/3) ... [2025-03-08 15:25:18,839 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-67.i [2025-03-08 15:25:18,850 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:25:18,853 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-67.i that has 2 procedures, 214 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:25:18,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:25:18,922 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;@3a44967, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:25:18,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:25:18,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 214 states, 159 states have (on average 1.490566037735849) internal successors, (237), 160 states have internal predecessors, (237), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 15:25:18,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-08 15:25:18,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:18,949 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:18,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:18,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:18,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2120410671, now seen corresponding path program 1 times [2025-03-08 15:25:18,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:18,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195931342] [2025-03-08 15:25:18,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:18,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:19,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-08 15:25:19,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-08 15:25:19,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:19,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:19,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2025-03-08 15:25:19,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:19,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195931342] [2025-03-08 15:25:19,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195931342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:25:19,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270355847] [2025-03-08 15:25:19,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:19,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:25:19,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:25:19,377 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:25:19,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:25:19,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-08 15:25:19,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-08 15:25:19,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:19,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:19,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:25:19,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:25:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2025-03-08 15:25:19,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:25:19,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270355847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:25:19,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:25:19,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:25:19,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123382430] [2025-03-08 15:25:19,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:25:19,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:25:19,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:19,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:25:19,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:25:19,698 INFO L87 Difference]: Start difference. First operand has 214 states, 159 states have (on average 1.490566037735849) internal successors, (237), 160 states have internal predecessors, (237), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) [2025-03-08 15:25:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:19,759 INFO L93 Difference]: Finished difference Result 418 states and 723 transitions. [2025-03-08 15:25:19,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:25:19,761 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) Word has length 350 [2025-03-08 15:25:19,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:19,768 INFO L225 Difference]: With dead ends: 418 [2025-03-08 15:25:19,768 INFO L226 Difference]: Without dead ends: 207 [2025-03-08 15:25:19,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:25:19,777 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:19,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:25:19,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-08 15:25:19,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-03-08 15:25:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 153 states have (on average 1.457516339869281) internal successors, (223), 153 states have internal predecessors, (223), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 15:25:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 327 transitions. [2025-03-08 15:25:19,831 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 327 transitions. Word has length 350 [2025-03-08 15:25:19,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:19,831 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 327 transitions. [2025-03-08 15:25:19,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) [2025-03-08 15:25:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 327 transitions. [2025-03-08 15:25:19,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-08 15:25:19,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:19,841 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:19,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:25:20,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:25:20,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:20,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:20,043 INFO L85 PathProgramCache]: Analyzing trace with hash -858372892, now seen corresponding path program 1 times [2025-03-08 15:25:20,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:20,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628333434] [2025-03-08 15:25:20,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:20,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:20,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-08 15:25:20,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-08 15:25:20,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:20,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 45 proven. 108 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-03-08 15:25:20,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:20,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628333434] [2025-03-08 15:25:20,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628333434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:25:20,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48747763] [2025-03-08 15:25:20,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:20,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:25:21,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:25:21,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:25:21,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:25:21,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-08 15:25:21,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-08 15:25:21,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:21,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:21,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 15:25:21,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:25:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-08 15:25:21,305 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:25:21,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48747763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:25:21,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:25:21,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-08 15:25:21,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523846195] [2025-03-08 15:25:21,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:25:21,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:25:21,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:21,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:25:21,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:25:21,309 INFO L87 Difference]: Start difference. First operand 207 states and 327 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:21,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:21,396 INFO L93 Difference]: Finished difference Result 521 states and 824 transitions. [2025-03-08 15:25:21,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:25:21,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 350 [2025-03-08 15:25:21,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:21,401 INFO L225 Difference]: With dead ends: 521 [2025-03-08 15:25:21,401 INFO L226 Difference]: Without dead ends: 317 [2025-03-08 15:25:21,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:25:21,406 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 167 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:21,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 609 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:25:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-08 15:25:21,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 221. [2025-03-08 15:25:21,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 167 states have (on average 1.467065868263473) internal successors, (245), 167 states have internal predecessors, (245), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 15:25:21,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 349 transitions. [2025-03-08 15:25:21,434 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 349 transitions. Word has length 350 [2025-03-08 15:25:21,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:21,437 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 349 transitions. [2025-03-08 15:25:21,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:21,437 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 349 transitions. [2025-03-08 15:25:21,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-08 15:25:21,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:21,440 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:21,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:25:21,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 15:25:21,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:21,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:21,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2041720189, now seen corresponding path program 1 times [2025-03-08 15:25:21,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:21,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239295845] [2025-03-08 15:25:21,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:21,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:21,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-08 15:25:21,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-08 15:25:21,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:21,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 45 proven. 108 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-03-08 15:25:22,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:22,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239295845] [2025-03-08 15:25:22,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239295845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:25:22,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137003398] [2025-03-08 15:25:22,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:22,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:25:22,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:25:22,236 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:25:22,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:25:22,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-08 15:25:22,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-08 15:25:22,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:22,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:22,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 15:25:22,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:25:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-08 15:25:22,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:25:22,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137003398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:25:22,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:25:22,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-08 15:25:22,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48245951] [2025-03-08 15:25:22,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:25:22,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:25:22,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:22,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:25:22,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:25:22,508 INFO L87 Difference]: Start difference. First operand 221 states and 349 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:22,616 INFO L93 Difference]: Finished difference Result 655 states and 1037 transitions. [2025-03-08 15:25:22,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:25:22,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 350 [2025-03-08 15:25:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:22,621 INFO L225 Difference]: With dead ends: 655 [2025-03-08 15:25:22,621 INFO L226 Difference]: Without dead ends: 437 [2025-03-08 15:25:22,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:25:22,622 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 320 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:22,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 805 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:25:22,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-08 15:25:22,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 435. [2025-03-08 15:25:22,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 328 states have (on average 1.4634146341463414) internal successors, (480), 328 states have internal predecessors, (480), 104 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 15:25:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 688 transitions. [2025-03-08 15:25:22,666 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 688 transitions. Word has length 350 [2025-03-08 15:25:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:22,666 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 688 transitions. [2025-03-08 15:25:22,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 688 transitions. [2025-03-08 15:25:22,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-08 15:25:22,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:22,670 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:22,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 15:25:22,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:25:22,871 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:22,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:22,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1411961148, now seen corresponding path program 1 times [2025-03-08 15:25:22,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:22,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102888060] [2025-03-08 15:25:22,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:22,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:22,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-08 15:25:22,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-08 15:25:22,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:22,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 45 proven. 108 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-03-08 15:25:23,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:23,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102888060] [2025-03-08 15:25:23,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102888060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:25:23,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005979550] [2025-03-08 15:25:23,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:23,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:25:23,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:25:23,302 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:25:23,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 15:25:23,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-08 15:25:23,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-08 15:25:23,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:23,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:23,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:25:23,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:25:24,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-08 15:25:24,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:25:24,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005979550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:25:24,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:25:24,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-03-08 15:25:24,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656996071] [2025-03-08 15:25:24,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:25:24,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:25:24,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:24,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:25:24,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:25:24,482 INFO L87 Difference]: Start difference. First operand 435 states and 688 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:24,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:24,955 INFO L93 Difference]: Finished difference Result 1443 states and 2279 transitions. [2025-03-08 15:25:24,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:25:24,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 351 [2025-03-08 15:25:24,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:24,965 INFO L225 Difference]: With dead ends: 1443 [2025-03-08 15:25:24,966 INFO L226 Difference]: Without dead ends: 1011 [2025-03-08 15:25:24,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:25:24,968 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 403 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:24,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1195 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:25:24,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-03-08 15:25:25,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 865. [2025-03-08 15:25:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 652 states have (on average 1.460122699386503) internal successors, (952), 652 states have internal predecessors, (952), 208 states have call successors, (208), 4 states have call predecessors, (208), 4 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) [2025-03-08 15:25:25,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1368 transitions. [2025-03-08 15:25:25,073 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1368 transitions. Word has length 351 [2025-03-08 15:25:25,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:25,074 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1368 transitions. [2025-03-08 15:25:25,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:25,074 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1368 transitions. [2025-03-08 15:25:25,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-08 15:25:25,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:25,077 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:25,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 15:25:25,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:25:25,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:25,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:25,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1668477129, now seen corresponding path program 1 times [2025-03-08 15:25:25,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:25,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997478757] [2025-03-08 15:25:25,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:25,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:25,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-08 15:25:25,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-08 15:25:25,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:25,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-08 15:25:26,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:26,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997478757] [2025-03-08 15:25:26,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997478757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:25:26,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:25:26,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 15:25:26,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203899245] [2025-03-08 15:25:26,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:25:26,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 15:25:26,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:26,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 15:25:26,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:25:26,381 INFO L87 Difference]: Start difference. First operand 865 states and 1368 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:27,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:27,932 INFO L93 Difference]: Finished difference Result 3968 states and 6208 transitions. [2025-03-08 15:25:27,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 15:25:27,933 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 352 [2025-03-08 15:25:27,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:27,948 INFO L225 Difference]: With dead ends: 3968 [2025-03-08 15:25:27,949 INFO L226 Difference]: Without dead ends: 3106 [2025-03-08 15:25:27,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-08 15:25:27,956 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 1376 mSDsluCounter, 2516 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 2917 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:27,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 2917 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 15:25:27,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2025-03-08 15:25:28,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 1989. [2025-03-08 15:25:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1989 states, 1564 states have (on average 1.5012787723785166) internal successors, (2348), 1564 states have internal predecessors, (2348), 416 states have call successors, (416), 8 states have call predecessors, (416), 8 states have return successors, (416), 416 states have call predecessors, (416), 416 states have call successors, (416) [2025-03-08 15:25:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 3180 transitions. [2025-03-08 15:25:28,143 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 3180 transitions. Word has length 352 [2025-03-08 15:25:28,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:28,144 INFO L471 AbstractCegarLoop]: Abstraction has 1989 states and 3180 transitions. [2025-03-08 15:25:28,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:28,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 3180 transitions. [2025-03-08 15:25:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-08 15:25:28,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:28,148 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:28,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:25:28,148 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:28,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:28,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1250316996, now seen corresponding path program 1 times [2025-03-08 15:25:28,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:28,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873896327] [2025-03-08 15:25:28,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:28,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:28,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-08 15:25:28,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-08 15:25:28,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:28,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-08 15:25:29,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:29,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873896327] [2025-03-08 15:25:29,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873896327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:25:29,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:25:29,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:25:29,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381803325] [2025-03-08 15:25:29,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:25:29,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:25:29,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:29,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:25:29,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:25:29,152 INFO L87 Difference]: Start difference. First operand 1989 states and 3180 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:30,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:30,593 INFO L93 Difference]: Finished difference Result 4536 states and 7164 transitions. [2025-03-08 15:25:30,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:25:30,593 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 353 [2025-03-08 15:25:30,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:30,615 INFO L225 Difference]: With dead ends: 4536 [2025-03-08 15:25:30,615 INFO L226 Difference]: Without dead ends: 3674 [2025-03-08 15:25:30,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:25:30,621 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 2035 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2035 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:30,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2035 Valid, 2169 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 15:25:30,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2025-03-08 15:25:30,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 2045. [2025-03-08 15:25:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2045 states, 1620 states have (on average 1.5037037037037038) internal successors, (2436), 1620 states have internal predecessors, (2436), 416 states have call successors, (416), 8 states have call predecessors, (416), 8 states have return successors, (416), 416 states have call predecessors, (416), 416 states have call successors, (416) [2025-03-08 15:25:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 3268 transitions. [2025-03-08 15:25:30,803 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 3268 transitions. Word has length 353 [2025-03-08 15:25:30,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:30,805 INFO L471 AbstractCegarLoop]: Abstraction has 2045 states and 3268 transitions. [2025-03-08 15:25:30,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:30,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 3268 transitions. [2025-03-08 15:25:30,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-08 15:25:30,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:30,812 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:30,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:25:30,813 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:30,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:30,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1202386792, now seen corresponding path program 1 times [2025-03-08 15:25:30,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:30,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17042803] [2025-03-08 15:25:30,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:30,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:30,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-08 15:25:31,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-08 15:25:31,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:31,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-08 15:25:31,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:31,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17042803] [2025-03-08 15:25:31,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17042803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:25:31,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:25:31,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:25:31,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865773147] [2025-03-08 15:25:31,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:25:31,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:25:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:31,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:25:31,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:25:31,358 INFO L87 Difference]: Start difference. First operand 2045 states and 3268 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:31,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:31,881 INFO L93 Difference]: Finished difference Result 5961 states and 9538 transitions. [2025-03-08 15:25:31,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:25:31,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 353 [2025-03-08 15:25:31,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:31,900 INFO L225 Difference]: With dead ends: 5961 [2025-03-08 15:25:31,900 INFO L226 Difference]: Without dead ends: 3919 [2025-03-08 15:25:31,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:25:31,907 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 510 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:31,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1000 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:25:31,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2025-03-08 15:25:32,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3917. [2025-03-08 15:25:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3917 states, 3068 states have (on average 1.4967405475880051) internal successors, (4592), 3068 states have internal predecessors, (4592), 832 states have call successors, (832), 16 states have call predecessors, (832), 16 states have return successors, (832), 832 states have call predecessors, (832), 832 states have call successors, (832) [2025-03-08 15:25:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3917 states to 3917 states and 6256 transitions. [2025-03-08 15:25:32,103 INFO L78 Accepts]: Start accepts. Automaton has 3917 states and 6256 transitions. Word has length 353 [2025-03-08 15:25:32,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:32,103 INFO L471 AbstractCegarLoop]: Abstraction has 3917 states and 6256 transitions. [2025-03-08 15:25:32,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:32,104 INFO L276 IsEmpty]: Start isEmpty. Operand 3917 states and 6256 transitions. [2025-03-08 15:25:32,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-08 15:25:32,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:32,109 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:32,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:25:32,109 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:32,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:32,110 INFO L85 PathProgramCache]: Analyzing trace with hash 914082133, now seen corresponding path program 1 times [2025-03-08 15:25:32,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:32,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340992217] [2025-03-08 15:25:32,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:32,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:32,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-08 15:25:32,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-08 15:25:32,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:32,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-08 15:25:32,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:32,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340992217] [2025-03-08 15:25:32,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340992217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:25:32,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:25:32,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:25:32,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030426851] [2025-03-08 15:25:32,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:25:32,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:25:32,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:32,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:25:32,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:25:32,868 INFO L87 Difference]: Start difference. First operand 3917 states and 6256 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:34,897 INFO L93 Difference]: Finished difference Result 14988 states and 23887 transitions. [2025-03-08 15:25:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:25:34,897 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 354 [2025-03-08 15:25:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:34,959 INFO L225 Difference]: With dead ends: 14988 [2025-03-08 15:25:34,961 INFO L226 Difference]: Without dead ends: 11074 [2025-03-08 15:25:34,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:25:34,978 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 1860 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 626 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1860 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 2028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 626 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:34,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1860 Valid, 1847 Invalid, 2028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [626 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 15:25:34,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11074 states. [2025-03-08 15:25:35,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11074 to 9813. [2025-03-08 15:25:35,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9813 states, 7692 states have (on average 1.499739989599584) internal successors, (11536), 7692 states have internal predecessors, (11536), 2080 states have call successors, (2080), 40 states have call predecessors, (2080), 40 states have return successors, (2080), 2080 states have call predecessors, (2080), 2080 states have call successors, (2080) [2025-03-08 15:25:35,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9813 states to 9813 states and 15696 transitions. [2025-03-08 15:25:35,621 INFO L78 Accepts]: Start accepts. Automaton has 9813 states and 15696 transitions. Word has length 354 [2025-03-08 15:25:35,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:35,621 INFO L471 AbstractCegarLoop]: Abstraction has 9813 states and 15696 transitions. [2025-03-08 15:25:35,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 9813 states and 15696 transitions. [2025-03-08 15:25:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-08 15:25:35,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:35,630 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:35,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:25:35,630 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:35,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:35,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2027575466, now seen corresponding path program 1 times [2025-03-08 15:25:35,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:35,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485803620] [2025-03-08 15:25:35,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:35,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:35,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-08 15:25:35,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-08 15:25:35,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:35,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-08 15:25:36,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:36,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485803620] [2025-03-08 15:25:36,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485803620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:25:36,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:25:36,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:25:36,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002962530] [2025-03-08 15:25:36,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:25:36,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:25:36,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:36,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:25:36,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:25:36,041 INFO L87 Difference]: Start difference. First operand 9813 states and 15696 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:37,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:37,436 INFO L93 Difference]: Finished difference Result 33163 states and 53067 transitions. [2025-03-08 15:25:37,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:25:37,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 354 [2025-03-08 15:25:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:37,527 INFO L225 Difference]: With dead ends: 33163 [2025-03-08 15:25:37,528 INFO L226 Difference]: Without dead ends: 23353 [2025-03-08 15:25:37,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:25:37,559 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 512 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:37,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1145 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:25:37,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23353 states. [2025-03-08 15:25:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23353 to 23349. [2025-03-08 15:25:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23349 states, 18260 states have (on average 1.4955093099671413) internal successors, (27308), 18260 states have internal predecessors, (27308), 4992 states have call successors, (4992), 96 states have call predecessors, (4992), 96 states have return successors, (4992), 4992 states have call predecessors, (4992), 4992 states have call successors, (4992) [2025-03-08 15:25:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23349 states to 23349 states and 37292 transitions. [2025-03-08 15:25:38,779 INFO L78 Accepts]: Start accepts. Automaton has 23349 states and 37292 transitions. Word has length 354 [2025-03-08 15:25:38,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:38,781 INFO L471 AbstractCegarLoop]: Abstraction has 23349 states and 37292 transitions. [2025-03-08 15:25:38,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:38,781 INFO L276 IsEmpty]: Start isEmpty. Operand 23349 states and 37292 transitions. [2025-03-08 15:25:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-08 15:25:38,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:38,795 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:38,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:25:38,795 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:38,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:38,796 INFO L85 PathProgramCache]: Analyzing trace with hash 573075529, now seen corresponding path program 1 times [2025-03-08 15:25:38,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:38,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920268333] [2025-03-08 15:25:38,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:38,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:38,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-08 15:25:38,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-08 15:25:38,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:38,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-08 15:25:40,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:40,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920268333] [2025-03-08 15:25:40,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920268333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:25:40,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:25:40,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 15:25:40,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000727490] [2025-03-08 15:25:40,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:25:40,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 15:25:40,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:40,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 15:25:40,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:25:40,572 INFO L87 Difference]: Start difference. First operand 23349 states and 37292 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:43,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:43,498 INFO L93 Difference]: Finished difference Result 40218 states and 63433 transitions. [2025-03-08 15:25:43,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:25:43,499 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 354 [2025-03-08 15:25:43,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:43,609 INFO L225 Difference]: With dead ends: 40218 [2025-03-08 15:25:43,609 INFO L226 Difference]: Without dead ends: 30268 [2025-03-08 15:25:43,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-08 15:25:43,649 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 1198 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 1854 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:43,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 2473 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1854 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 15:25:43,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30268 states. [2025-03-08 15:25:45,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30268 to 23321. [2025-03-08 15:25:45,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23321 states, 18232 states have (on average 1.4951733216322949) internal successors, (27260), 18232 states have internal predecessors, (27260), 4992 states have call successors, (4992), 96 states have call predecessors, (4992), 96 states have return successors, (4992), 4992 states have call predecessors, (4992), 4992 states have call successors, (4992) [2025-03-08 15:25:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23321 states to 23321 states and 37244 transitions. [2025-03-08 15:25:45,487 INFO L78 Accepts]: Start accepts. Automaton has 23321 states and 37244 transitions. Word has length 354 [2025-03-08 15:25:45,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:45,488 INFO L471 AbstractCegarLoop]: Abstraction has 23321 states and 37244 transitions. [2025-03-08 15:25:45,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:45,488 INFO L276 IsEmpty]: Start isEmpty. Operand 23321 states and 37244 transitions. [2025-03-08 15:25:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-08 15:25:45,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:45,500 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:45,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:25:45,501 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:45,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:45,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1504133814, now seen corresponding path program 1 times [2025-03-08 15:25:45,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:45,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471873866] [2025-03-08 15:25:45,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:45,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:45,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-08 15:25:45,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-08 15:25:45,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:45,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-08 15:25:46,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:46,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471873866] [2025-03-08 15:25:46,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471873866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:25:46,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:25:46,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:25:46,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933123846] [2025-03-08 15:25:46,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:25:46,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:25:46,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:46,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:25:46,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:25:46,303 INFO L87 Difference]: Start difference. First operand 23321 states and 37244 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:48,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:48,633 INFO L93 Difference]: Finished difference Result 44679 states and 70343 transitions. [2025-03-08 15:25:48,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:25:48,634 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 354 [2025-03-08 15:25:48,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:48,746 INFO L225 Difference]: With dead ends: 44679 [2025-03-08 15:25:48,747 INFO L226 Difference]: Without dead ends: 36333 [2025-03-08 15:25:48,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:25:48,781 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 1107 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:48,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 1739 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 15:25:48,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36333 states. [2025-03-08 15:25:50,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36333 to 23477. [2025-03-08 15:25:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23477 states, 18335 states have (on average 1.4946823016089446) internal successors, (27405), 18335 states have internal predecessors, (27405), 5044 states have call successors, (5044), 97 states have call predecessors, (5044), 97 states have return successors, (5044), 5044 states have call predecessors, (5044), 5044 states have call successors, (5044) [2025-03-08 15:25:50,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23477 states to 23477 states and 37493 transitions. [2025-03-08 15:25:50,795 INFO L78 Accepts]: Start accepts. Automaton has 23477 states and 37493 transitions. Word has length 354 [2025-03-08 15:25:50,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:50,796 INFO L471 AbstractCegarLoop]: Abstraction has 23477 states and 37493 transitions. [2025-03-08 15:25:50,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:50,796 INFO L276 IsEmpty]: Start isEmpty. Operand 23477 states and 37493 transitions. [2025-03-08 15:25:50,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-08 15:25:50,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:50,809 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:50,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:25:50,810 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:50,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1269187979, now seen corresponding path program 1 times [2025-03-08 15:25:50,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:50,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882946873] [2025-03-08 15:25:50,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:50,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:50,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-08 15:25:50,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-08 15:25:50,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:50,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-08 15:25:51,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:51,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882946873] [2025-03-08 15:25:51,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882946873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:25:51,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:25:51,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:25:51,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782801000] [2025-03-08 15:25:51,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:25:51,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:25:51,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:51,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:25:51,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:25:51,250 INFO L87 Difference]: Start difference. First operand 23477 states and 37493 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:52,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:52,506 INFO L93 Difference]: Finished difference Result 52465 states and 83571 transitions. [2025-03-08 15:25:52,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:25:52,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 354 [2025-03-08 15:25:52,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:52,614 INFO L225 Difference]: With dead ends: 52465 [2025-03-08 15:25:52,614 INFO L226 Difference]: Without dead ends: 29085 [2025-03-08 15:25:52,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:25:52,669 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 377 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:52,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 999 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:25:52,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29085 states. [2025-03-08 15:25:54,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29085 to 23335. [2025-03-08 15:25:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23335 states, 18246 states have (on average 1.4837224597171983) internal successors, (27072), 18246 states have internal predecessors, (27072), 4992 states have call successors, (4992), 96 states have call predecessors, (4992), 96 states have return successors, (4992), 4992 states have call predecessors, (4992), 4992 states have call successors, (4992) [2025-03-08 15:25:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23335 states to 23335 states and 37056 transitions. [2025-03-08 15:25:54,711 INFO L78 Accepts]: Start accepts. Automaton has 23335 states and 37056 transitions. Word has length 354 [2025-03-08 15:25:54,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:54,711 INFO L471 AbstractCegarLoop]: Abstraction has 23335 states and 37056 transitions. [2025-03-08 15:25:54,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-08 15:25:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 23335 states and 37056 transitions. [2025-03-08 15:25:54,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-08 15:25:54,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:54,719 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:54,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:25:54,719 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:54,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:54,720 INFO L85 PathProgramCache]: Analyzing trace with hash 529342860, now seen corresponding path program 1 times [2025-03-08 15:25:54,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:54,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344859854] [2025-03-08 15:25:54,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:54,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:54,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-08 15:25:54,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-08 15:25:54,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:54,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-08 15:25:55,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:55,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344859854] [2025-03-08 15:25:55,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344859854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:25:55,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:25:55,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:25:55,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550028469] [2025-03-08 15:25:55,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:25:55,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:25:55,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:55,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:25:55,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:25:55,498 INFO L87 Difference]: Start difference. First operand 23335 states and 37056 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 2 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2025-03-08 15:25:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:56,648 INFO L93 Difference]: Finished difference Result 49304 states and 78169 transitions. [2025-03-08 15:25:56,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:25:56,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 2 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 355 [2025-03-08 15:25:56,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:56,738 INFO L225 Difference]: With dead ends: 49304 [2025-03-08 15:25:56,738 INFO L226 Difference]: Without dead ends: 25972 [2025-03-08 15:25:56,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:25:56,788 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 259 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:56,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1360 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:25:56,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25972 states. [2025-03-08 15:25:58,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25972 to 23424. [2025-03-08 15:25:58,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23424 states, 18282 states have (on average 1.482769937643584) internal successors, (27108), 18282 states have internal predecessors, (27108), 5044 states have call successors, (5044), 97 states have call predecessors, (5044), 97 states have return successors, (5044), 5044 states have call predecessors, (5044), 5044 states have call successors, (5044) [2025-03-08 15:25:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23424 states to 23424 states and 37196 transitions. [2025-03-08 15:25:58,278 INFO L78 Accepts]: Start accepts. Automaton has 23424 states and 37196 transitions. Word has length 355 [2025-03-08 15:25:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:58,278 INFO L471 AbstractCegarLoop]: Abstraction has 23424 states and 37196 transitions. [2025-03-08 15:25:58,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 2 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2025-03-08 15:25:58,278 INFO L276 IsEmpty]: Start isEmpty. Operand 23424 states and 37196 transitions. [2025-03-08 15:25:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-08 15:25:58,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:58,282 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:58,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:25:58,282 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:58,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:58,283 INFO L85 PathProgramCache]: Analyzing trace with hash 522599344, now seen corresponding path program 1 times [2025-03-08 15:25:58,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:58,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024590757] [2025-03-08 15:25:58,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:58,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:58,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-08 15:25:58,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-08 15:25:58,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:58,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 54 proven. 99 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-03-08 15:25:59,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:59,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024590757] [2025-03-08 15:25:59,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024590757] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:25:59,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017787055] [2025-03-08 15:25:59,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:59,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:25:59,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:25:59,734 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:25:59,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 15:25:59,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-08 15:25:59,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-08 15:25:59,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:59,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:59,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 15:25:59,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:26:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 1773 proven. 30 refuted. 0 times theorem prover too weak. 3501 trivial. 0 not checked. [2025-03-08 15:26:00,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:26:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 123 proven. 30 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-03-08 15:26:00,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017787055] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:26:00,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:26:00,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 22 [2025-03-08 15:26:00,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982496656] [2025-03-08 15:26:00,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:26:00,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 15:26:00,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:26:00,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 15:26:00,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-03-08 15:26:00,927 INFO L87 Difference]: Start difference. First operand 23424 states and 37196 transitions. Second operand has 22 states, 21 states have (on average 11.285714285714286) internal successors, (237), 22 states have internal predecessors, (237), 7 states have call successors, (156), 3 states have call predecessors, (156), 6 states have return successors, (156), 6 states have call predecessors, (156), 7 states have call successors, (156) [2025-03-08 15:26:09,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:26:09,427 INFO L93 Difference]: Finished difference Result 91686 states and 143119 transitions. [2025-03-08 15:26:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-08 15:26:09,428 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 11.285714285714286) internal successors, (237), 22 states have internal predecessors, (237), 7 states have call successors, (156), 3 states have call predecessors, (156), 6 states have return successors, (156), 6 states have call predecessors, (156), 7 states have call successors, (156) Word has length 355 [2025-03-08 15:26:09,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:26:09,605 INFO L225 Difference]: With dead ends: 91686 [2025-03-08 15:26:09,605 INFO L226 Difference]: Without dead ends: 68354 [2025-03-08 15:26:09,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 823 GetRequests, 717 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4220 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2144, Invalid=9412, Unknown=0, NotChecked=0, Total=11556 [2025-03-08 15:26:09,662 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 8901 mSDsluCounter, 2540 mSDsCounter, 0 mSdLazyCounter, 3740 mSolverCounterSat, 1909 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8970 SdHoareTripleChecker+Valid, 2928 SdHoareTripleChecker+Invalid, 5649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1909 IncrementalHoareTripleChecker+Valid, 3740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:26:09,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8970 Valid, 2928 Invalid, 5649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1909 Valid, 3740 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-08 15:26:09,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68354 states. [2025-03-08 15:26:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68354 to 33900. [2025-03-08 15:26:12,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33900 states, 27643 states have (on average 1.4756357848279853) internal successors, (40791), 27703 states have internal predecessors, (40791), 5972 states have call successors, (5972), 284 states have call predecessors, (5972), 284 states have return successors, (5972), 5912 states have call predecessors, (5972), 5972 states have call successors, (5972) [2025-03-08 15:26:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33900 states to 33900 states and 52735 transitions. [2025-03-08 15:26:12,974 INFO L78 Accepts]: Start accepts. Automaton has 33900 states and 52735 transitions. Word has length 355 [2025-03-08 15:26:12,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:26:12,974 INFO L471 AbstractCegarLoop]: Abstraction has 33900 states and 52735 transitions. [2025-03-08 15:26:12,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 11.285714285714286) internal successors, (237), 22 states have internal predecessors, (237), 7 states have call successors, (156), 3 states have call predecessors, (156), 6 states have return successors, (156), 6 states have call predecessors, (156), 7 states have call successors, (156) [2025-03-08 15:26:12,974 INFO L276 IsEmpty]: Start isEmpty. Operand 33900 states and 52735 transitions. [2025-03-08 15:26:12,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-08 15:26:12,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:26:12,980 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:26:12,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 15:26:13,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 15:26:13,181 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:26:13,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:26:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1678116343, now seen corresponding path program 1 times [2025-03-08 15:26:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:26:13,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563629931] [2025-03-08 15:26:13,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:13,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:26:13,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-08 15:26:13,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-08 15:26:13,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:26:13,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:26:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 105 proven. 48 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-03-08 15:26:13,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:26:13,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563629931] [2025-03-08 15:26:13,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563629931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:26:13,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812783698] [2025-03-08 15:26:13,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:13,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:26:13,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:26:13,555 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:26:13,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 15:26:13,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-08 15:26:13,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-08 15:26:13,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:26:13,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:26:13,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 15:26:13,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:26:14,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 1863 proven. 45 refuted. 0 times theorem prover too weak. 3396 trivial. 0 not checked. [2025-03-08 15:26:14,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:26:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 255 proven. 48 refuted. 0 times theorem prover too weak. 5001 trivial. 0 not checked. [2025-03-08 15:26:14,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812783698] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:26:14,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:26:14,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 12] total 23 [2025-03-08 15:26:14,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762407076] [2025-03-08 15:26:14,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:26:14,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 15:26:14,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:26:14,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 15:26:14,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2025-03-08 15:26:14,912 INFO L87 Difference]: Start difference. First operand 33900 states and 52735 transitions. Second operand has 23 states, 23 states have (on average 9.608695652173912) internal successors, (221), 23 states have internal predecessors, (221), 6 states have call successors, (78), 3 states have call predecessors, (78), 7 states have return successors, (80), 6 states have call predecessors, (80), 6 states have call successors, (80) [2025-03-08 15:26:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:26:24,819 INFO L93 Difference]: Finished difference Result 119198 states and 179594 transitions. [2025-03-08 15:26:24,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-08 15:26:24,820 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.608695652173912) internal successors, (221), 23 states have internal predecessors, (221), 6 states have call successors, (78), 3 states have call predecessors, (78), 7 states have return successors, (80), 6 states have call predecessors, (80), 6 states have call successors, (80) Word has length 355 [2025-03-08 15:26:24,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:26:25,108 INFO L225 Difference]: With dead ends: 119198 [2025-03-08 15:26:25,108 INFO L226 Difference]: Without dead ends: 85402 [2025-03-08 15:26:25,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4386 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2369, Invalid=9841, Unknown=0, NotChecked=0, Total=12210 [2025-03-08 15:26:25,176 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 2968 mSDsluCounter, 2401 mSDsCounter, 0 mSdLazyCounter, 3792 mSolverCounterSat, 1686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2968 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 5478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1686 IncrementalHoareTripleChecker+Valid, 3792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:26:25,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2968 Valid, 2890 Invalid, 5478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1686 Valid, 3792 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 15:26:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85402 states. [2025-03-08 15:26:29,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85402 to 50778. [2025-03-08 15:26:30,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50778 states, 38877 states have (on average 1.40635851531754) internal successors, (54675), 39037 states have internal predecessors, (54675), 10792 states have call successors, (10792), 1108 states have call predecessors, (10792), 1108 states have return successors, (10792), 10632 states have call predecessors, (10792), 10792 states have call successors, (10792) [2025-03-08 15:26:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50778 states to 50778 states and 76259 transitions. [2025-03-08 15:26:30,236 INFO L78 Accepts]: Start accepts. Automaton has 50778 states and 76259 transitions. Word has length 355 [2025-03-08 15:26:30,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:26:30,236 INFO L471 AbstractCegarLoop]: Abstraction has 50778 states and 76259 transitions. [2025-03-08 15:26:30,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.608695652173912) internal successors, (221), 23 states have internal predecessors, (221), 6 states have call successors, (78), 3 states have call predecessors, (78), 7 states have return successors, (80), 6 states have call predecessors, (80), 6 states have call successors, (80) [2025-03-08 15:26:30,236 INFO L276 IsEmpty]: Start isEmpty. Operand 50778 states and 76259 transitions. [2025-03-08 15:26:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-08 15:26:30,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:26:30,243 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:26:30,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 15:26:30,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 15:26:30,444 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:26:30,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:26:30,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1013716540, now seen corresponding path program 1 times [2025-03-08 15:26:30,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:26:30,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177801458] [2025-03-08 15:26:30,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:30,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:26:30,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-08 15:26:30,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-08 15:26:30,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:26:30,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:26:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 54 proven. 99 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-03-08 15:26:31,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:26:31,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177801458] [2025-03-08 15:26:31,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177801458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:26:31,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977193169] [2025-03-08 15:26:31,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:31,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:26:31,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:26:31,852 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:26:31,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 15:26:31,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes.