./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-26.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 efdf1b64b72144bc512d85f167c8c53d14c070e676801a1f37bb17c76e61f00f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:38:38,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:38:38,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:38:38,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:38:38,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:38:38,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:38:38,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:38:38,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:38:38,421 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:38:38,421 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:38:38,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:38:38,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:38:38,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:38:38,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:38:38,422 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:38:38,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:38:38,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:38:38,422 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:38:38,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:38:38,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:38:38,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:38:38,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:38:38,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:38:38,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:38:38,422 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:38:38,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:38:38,423 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:38:38,423 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:38:38,423 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:38:38,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:38:38,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:38:38,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:38:38,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:38:38,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:38:38,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:38:38,423 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:38:38,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:38:38,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:38:38,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:38:38,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:38:38,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:38:38,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:38:38,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:38:38,423 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-jdk21/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 -> efdf1b64b72144bc512d85f167c8c53d14c070e676801a1f37bb17c76e61f00f [2025-02-06 02:38:38,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:38:38,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:38:38,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:38:38,668 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:38:38,668 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:38:38,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-26.i [2025-02-06 02:38:39,999 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f21a6ec89/34f46cbd03d74e1684c42ff7443e11d2/FLAG36b8737ab [2025-02-06 02:38:40,339 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:38:40,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-26.i [2025-02-06 02:38:40,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f21a6ec89/34f46cbd03d74e1684c42ff7443e11d2/FLAG36b8737ab [2025-02-06 02:38:40,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f21a6ec89/34f46cbd03d74e1684c42ff7443e11d2 [2025-02-06 02:38:40,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:38:40,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:38:40,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:38:40,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:38:40,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:38:40,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:38:40" (1/1) ... [2025-02-06 02:38:40,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a9ddebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:40, skipping insertion in model container [2025-02-06 02:38:40,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:38:40" (1/1) ... [2025-02-06 02:38:40,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:38:40,528 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-26.i[916,929] [2025-02-06 02:38:40,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:38:40,683 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:38:40,693 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-26.i[916,929] [2025-02-06 02:38:40,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:38:40,795 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:38:40,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:40 WrapperNode [2025-02-06 02:38:40,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:38:40,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:38:40,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:38:40,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:38:40,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:40" (1/1) ... [2025-02-06 02:38:40,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:40" (1/1) ... [2025-02-06 02:38:40,888 INFO L138 Inliner]: procedures = 26, calls = 95, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 799 [2025-02-06 02:38:40,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:38:40,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:38:40,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:38:40,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:38:40,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:40" (1/1) ... [2025-02-06 02:38:40,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:40" (1/1) ... [2025-02-06 02:38:40,908 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:40" (1/1) ... [2025-02-06 02:38:41,000 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-02-06 02:38:41,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:40" (1/1) ... [2025-02-06 02:38:41,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:40" (1/1) ... [2025-02-06 02:38:41,025 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:40" (1/1) ... [2025-02-06 02:38:41,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:40" (1/1) ... [2025-02-06 02:38:41,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:40" (1/1) ... [2025-02-06 02:38:41,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:40" (1/1) ... [2025-02-06 02:38:41,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:38:41,072 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:38:41,072 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:38:41,073 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:38:41,073 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:40" (1/1) ... [2025-02-06 02:38:41,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:38:41,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:41,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:38:41,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:38:41,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:38:41,127 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:38:41,127 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:38:41,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:38:41,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:38:41,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:38:41,249 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:38:41,251 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:38:42,105 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L678: havoc property_#t~ite56#1;havoc property_#t~bitwise55#1;havoc property_#t~short57#1;havoc property_#t~ite59#1;havoc property_#t~bitwise58#1;havoc property_#t~short60#1;havoc property_#t~ite62#1;havoc property_#t~bitwise61#1;havoc property_#t~short63#1;havoc property_#t~bitwise64#1;havoc property_#t~short65#1;havoc property_#t~ite67#1;havoc property_#t~bitwise66#1;havoc property_#t~short68#1;havoc property_#t~ite73#1;havoc property_#t~ite72#1;havoc property_#t~ite71#1;havoc property_#t~ite70#1;havoc property_#t~bitwise69#1;havoc property_#t~short74#1; [2025-02-06 02:38:42,223 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-02-06 02:38:42,223 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:38:42,242 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:38:42,243 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:38:42,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:38:42 BoogieIcfgContainer [2025-02-06 02:38:42,243 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:38:42,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:38:42,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:38:42,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:38:42,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:38:40" (1/3) ... [2025-02-06 02:38:42,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f91f6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:38:42, skipping insertion in model container [2025-02-06 02:38:42,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:40" (2/3) ... [2025-02-06 02:38:42,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f91f6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:38:42, skipping insertion in model container [2025-02-06 02:38:42,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:38:42" (3/3) ... [2025-02-06 02:38:42,249 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-26.i [2025-02-06 02:38:42,260 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:38:42,262 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-26.i that has 2 procedures, 326 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:38:42,304 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:38:42,313 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;@407a8265, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:38:42,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:38:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 241 states have (on average 1.5560165975103735) internal successors, (375), 242 states have internal predecessors, (375), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 02:38:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-02-06 02:38:42,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:42,336 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:38:42,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:42,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:42,340 INFO L85 PathProgramCache]: Analyzing trace with hash 667765109, now seen corresponding path program 1 times [2025-02-06 02:38:42,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:42,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433188293] [2025-02-06 02:38:42,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:42,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:42,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-02-06 02:38:42,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-02-06 02:38:42,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:42,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2025-02-06 02:38:42,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:42,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433188293] [2025-02-06 02:38:42,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433188293] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:38:42,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203602890] [2025-02-06 02:38:42,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:42,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:42,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:42,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:38:42,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:38:43,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-02-06 02:38:43,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-02-06 02:38:43,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:43,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:43,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 1315 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:38:43,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:38:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2025-02-06 02:38:43,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:38:43,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203602890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:43,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:38:43,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:38:43,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300081311] [2025-02-06 02:38:43,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:43,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:38:43,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:43,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:38:43,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:38:43,446 INFO L87 Difference]: Start difference. First operand has 326 states, 241 states have (on average 1.5560165975103735) internal successors, (375), 242 states have internal predecessors, (375), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) Second operand has 2 states, 2 states have (on average 70.5) internal successors, (141), 2 states have internal predecessors, (141), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-06 02:38:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:43,544 INFO L93 Difference]: Finished difference Result 646 states and 1155 transitions. [2025-02-06 02:38:43,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:38:43,547 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 70.5) internal successors, (141), 2 states have internal predecessors, (141), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) Word has length 546 [2025-02-06 02:38:43,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:43,558 INFO L225 Difference]: With dead ends: 646 [2025-02-06 02:38:43,559 INFO L226 Difference]: Without dead ends: 323 [2025-02-06 02:38:43,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 547 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-02-06 02:38:43,569 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:43,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 520 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:38:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-02-06 02:38:43,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2025-02-06 02:38:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 239 states have (on average 1.5397489539748954) internal successors, (368), 239 states have internal predecessors, (368), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 02:38:43,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 532 transitions. [2025-02-06 02:38:43,649 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 532 transitions. Word has length 546 [2025-02-06 02:38:43,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:43,651 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 532 transitions. [2025-02-06 02:38:43,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 70.5) internal successors, (141), 2 states have internal predecessors, (141), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-06 02:38:43,652 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 532 transitions. [2025-02-06 02:38:43,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-02-06 02:38:43,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:43,663 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:38:43,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 02:38:43,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:38:43,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:43,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:43,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1929001399, now seen corresponding path program 1 times [2025-02-06 02:38:43,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:43,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544945638] [2025-02-06 02:38:43,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:43,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:43,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-02-06 02:38:44,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-02-06 02:38:44,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:44,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-06 02:38:44,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:44,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544945638] [2025-02-06 02:38:44,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544945638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:44,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:44,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:44,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079549147] [2025-02-06 02:38:44,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:44,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:44,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:44,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:44,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:44,500 INFO L87 Difference]: Start difference. First operand 323 states and 532 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:44,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:44,652 INFO L93 Difference]: Finished difference Result 960 states and 1584 transitions. [2025-02-06 02:38:44,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:44,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 546 [2025-02-06 02:38:44,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:44,662 INFO L225 Difference]: With dead ends: 960 [2025-02-06 02:38:44,662 INFO L226 Difference]: Without dead ends: 640 [2025-02-06 02:38:44,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:44,666 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 517 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:44,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1000 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-02-06 02:38:44,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 637. [2025-02-06 02:38:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 470 states have (on average 1.525531914893617) internal successors, (717), 470 states have internal predecessors, (717), 164 states have call successors, (164), 2 states have call predecessors, (164), 2 states have return successors, (164), 164 states have call predecessors, (164), 164 states have call successors, (164) [2025-02-06 02:38:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1045 transitions. [2025-02-06 02:38:44,777 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1045 transitions. Word has length 546 [2025-02-06 02:38:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:44,778 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 1045 transitions. [2025-02-06 02:38:44,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1045 transitions. [2025-02-06 02:38:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2025-02-06 02:38:44,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:44,784 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:38:44,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:38:44,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:44,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:44,785 INFO L85 PathProgramCache]: Analyzing trace with hash -654553285, now seen corresponding path program 1 times [2025-02-06 02:38:44,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:44,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106183261] [2025-02-06 02:38:44,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:44,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:44,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-02-06 02:38:44,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-02-06 02:38:44,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:44,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-06 02:38:45,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:45,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106183261] [2025-02-06 02:38:45,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106183261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:45,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:45,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:45,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118059094] [2025-02-06 02:38:45,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:45,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:45,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:45,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:45,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:45,288 INFO L87 Difference]: Start difference. First operand 637 states and 1045 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:45,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:45,505 INFO L93 Difference]: Finished difference Result 1851 states and 3034 transitions. [2025-02-06 02:38:45,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:45,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 547 [2025-02-06 02:38:45,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:45,516 INFO L225 Difference]: With dead ends: 1851 [2025-02-06 02:38:45,518 INFO L226 Difference]: Without dead ends: 1217 [2025-02-06 02:38:45,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:45,524 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 470 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:45,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1296 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-02-06 02:38:45,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 900. [2025-02-06 02:38:45,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 733 states have (on average 1.5457025920873124) internal successors, (1133), 733 states have internal predecessors, (1133), 164 states have call successors, (164), 2 states have call predecessors, (164), 2 states have return successors, (164), 164 states have call predecessors, (164), 164 states have call successors, (164) [2025-02-06 02:38:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1461 transitions. [2025-02-06 02:38:45,620 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1461 transitions. Word has length 547 [2025-02-06 02:38:45,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:45,621 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1461 transitions. [2025-02-06 02:38:45,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1461 transitions. [2025-02-06 02:38:45,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-02-06 02:38:45,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:45,628 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:38:45,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:38:45,628 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:45,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:45,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1208981568, now seen corresponding path program 1 times [2025-02-06 02:38:45,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:45,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585182570] [2025-02-06 02:38:45,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:45,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:45,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-02-06 02:38:45,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-02-06 02:38:45,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:45,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-06 02:38:46,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:46,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585182570] [2025-02-06 02:38:46,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585182570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:46,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:46,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:46,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072756876] [2025-02-06 02:38:46,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:46,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:46,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:46,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:46,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:46,011 INFO L87 Difference]: Start difference. First operand 900 states and 1461 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:46,144 INFO L93 Difference]: Finished difference Result 2620 states and 4255 transitions. [2025-02-06 02:38:46,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:46,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 548 [2025-02-06 02:38:46,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:46,153 INFO L225 Difference]: With dead ends: 2620 [2025-02-06 02:38:46,154 INFO L226 Difference]: Without dead ends: 1723 [2025-02-06 02:38:46,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:46,157 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 471 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:46,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1259 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:46,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2025-02-06 02:38:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1164. [2025-02-06 02:38:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 997 states have (on average 1.571715145436309) internal successors, (1567), 997 states have internal predecessors, (1567), 164 states have call successors, (164), 2 states have call predecessors, (164), 2 states have return successors, (164), 164 states have call predecessors, (164), 164 states have call successors, (164) [2025-02-06 02:38:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1895 transitions. [2025-02-06 02:38:46,259 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1895 transitions. Word has length 548 [2025-02-06 02:38:46,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:46,260 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1895 transitions. [2025-02-06 02:38:46,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:46,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1895 transitions. [2025-02-06 02:38:46,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2025-02-06 02:38:46,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:46,269 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:38:46,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:38:46,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:46,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:46,270 INFO L85 PathProgramCache]: Analyzing trace with hash -8185477, now seen corresponding path program 1 times [2025-02-06 02:38:46,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:46,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000279625] [2025-02-06 02:38:46,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:46,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:46,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes. [2025-02-06 02:38:46,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-02-06 02:38:46,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:46,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-06 02:38:46,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:46,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000279625] [2025-02-06 02:38:46,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000279625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:46,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:46,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:46,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45066062] [2025-02-06 02:38:46,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:46,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:46,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:46,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:46,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:46,543 INFO L87 Difference]: Start difference. First operand 1164 states and 1895 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:46,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:46,683 INFO L93 Difference]: Finished difference Result 2946 states and 4765 transitions. [2025-02-06 02:38:46,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:46,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 550 [2025-02-06 02:38:46,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:46,692 INFO L225 Difference]: With dead ends: 2946 [2025-02-06 02:38:46,692 INFO L226 Difference]: Without dead ends: 1785 [2025-02-06 02:38:46,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:46,695 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 500 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:46,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1150 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:46,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2025-02-06 02:38:46,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1226. [2025-02-06 02:38:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 1059 states have (on average 1.551463644948064) internal successors, (1643), 1059 states have internal predecessors, (1643), 164 states have call successors, (164), 2 states have call predecessors, (164), 2 states have return successors, (164), 164 states have call predecessors, (164), 164 states have call successors, (164) [2025-02-06 02:38:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1971 transitions. [2025-02-06 02:38:46,778 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1971 transitions. Word has length 550 [2025-02-06 02:38:46,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:46,779 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1971 transitions. [2025-02-06 02:38:46,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1971 transitions. [2025-02-06 02:38:46,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2025-02-06 02:38:46,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:46,786 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:38:46,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:38:46,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:46,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash -955486321, now seen corresponding path program 1 times [2025-02-06 02:38:46,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:46,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048402681] [2025-02-06 02:38:46,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:46,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:46,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes. [2025-02-06 02:38:46,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-02-06 02:38:46,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:46,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-06 02:38:47,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:47,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048402681] [2025-02-06 02:38:47,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048402681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:47,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:47,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:47,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075627572] [2025-02-06 02:38:47,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:47,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:47,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:47,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:47,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:47,023 INFO L87 Difference]: Start difference. First operand 1226 states and 1971 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:47,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:47,195 INFO L93 Difference]: Finished difference Result 2768 states and 4450 transitions. [2025-02-06 02:38:47,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:47,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 550 [2025-02-06 02:38:47,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:47,203 INFO L225 Difference]: With dead ends: 2768 [2025-02-06 02:38:47,203 INFO L226 Difference]: Without dead ends: 1545 [2025-02-06 02:38:47,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:47,206 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 457 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:47,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 980 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:47,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2025-02-06 02:38:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1226. [2025-02-06 02:38:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 1059 states have (on average 1.5099150141643058) internal successors, (1599), 1059 states have internal predecessors, (1599), 164 states have call successors, (164), 2 states have call predecessors, (164), 2 states have return successors, (164), 164 states have call predecessors, (164), 164 states have call successors, (164) [2025-02-06 02:38:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1927 transitions. [2025-02-06 02:38:47,288 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1927 transitions. Word has length 550 [2025-02-06 02:38:47,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:47,289 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1927 transitions. [2025-02-06 02:38:47,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:47,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1927 transitions. [2025-02-06 02:38:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2025-02-06 02:38:47,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:47,296 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:38:47,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:38:47,296 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:47,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:47,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1560873294, now seen corresponding path program 1 times [2025-02-06 02:38:47,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:47,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118085425] [2025-02-06 02:38:47,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:47,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:47,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes. [2025-02-06 02:38:47,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements. [2025-02-06 02:38:47,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:47,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:48,171 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-06 02:38:48,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:48,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118085425] [2025-02-06 02:38:48,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118085425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:48,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:48,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:48,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423047913] [2025-02-06 02:38:48,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:48,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:48,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:48,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:48,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:48,174 INFO L87 Difference]: Start difference. First operand 1226 states and 1927 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:48,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:48,337 INFO L93 Difference]: Finished difference Result 2889 states and 4513 transitions. [2025-02-06 02:38:48,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:48,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 551 [2025-02-06 02:38:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:48,345 INFO L225 Difference]: With dead ends: 2889 [2025-02-06 02:38:48,345 INFO L226 Difference]: Without dead ends: 1666 [2025-02-06 02:38:48,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:48,348 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 186 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:48,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1043 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:48,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2025-02-06 02:38:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1662. [2025-02-06 02:38:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1463 states have (on average 1.49419002050581) internal successors, (2186), 1465 states have internal predecessors, (2186), 194 states have call successors, (194), 4 states have call predecessors, (194), 4 states have return successors, (194), 192 states have call predecessors, (194), 194 states have call successors, (194) [2025-02-06 02:38:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2574 transitions. [2025-02-06 02:38:48,422 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2574 transitions. Word has length 551 [2025-02-06 02:38:48,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:48,422 INFO L471 AbstractCegarLoop]: Abstraction has 1662 states and 2574 transitions. [2025-02-06 02:38:48,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2574 transitions. [2025-02-06 02:38:48,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2025-02-06 02:38:48,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:48,430 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:38:48,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:38:48,430 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:48,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:48,430 INFO L85 PathProgramCache]: Analyzing trace with hash 985182019, now seen corresponding path program 1 times [2025-02-06 02:38:48,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:48,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244149525] [2025-02-06 02:38:48,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:48,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:48,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes. [2025-02-06 02:38:48,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements. [2025-02-06 02:38:48,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:48,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:48,820 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-06 02:38:48,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:48,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244149525] [2025-02-06 02:38:48,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244149525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:48,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:48,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:38:48,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19402926] [2025-02-06 02:38:48,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:48,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:38:48,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:48,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:38:48,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:38:48,822 INFO L87 Difference]: Start difference. First operand 1662 states and 2574 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-06 02:38:49,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:49,419 INFO L93 Difference]: Finished difference Result 5398 states and 8311 transitions. [2025-02-06 02:38:49,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:38:49,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 551 [2025-02-06 02:38:49,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:49,438 INFO L225 Difference]: With dead ends: 5398 [2025-02-06 02:38:49,438 INFO L226 Difference]: Without dead ends: 3739 [2025-02-06 02:38:49,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:38:49,443 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 1204 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:49,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 1949 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:38:49,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2025-02-06 02:38:49,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3327. [2025-02-06 02:38:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 2928 states have (on average 1.4931693989071038) internal successors, (4372), 2932 states have internal predecessors, (4372), 388 states have call successors, (388), 10 states have call predecessors, (388), 10 states have return successors, (388), 384 states have call predecessors, (388), 388 states have call successors, (388) [2025-02-06 02:38:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 5148 transitions. [2025-02-06 02:38:49,617 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 5148 transitions. Word has length 551 [2025-02-06 02:38:49,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:49,618 INFO L471 AbstractCegarLoop]: Abstraction has 3327 states and 5148 transitions. [2025-02-06 02:38:49,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-06 02:38:49,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 5148 transitions. [2025-02-06 02:38:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2025-02-06 02:38:49,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:49,623 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:38:49,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:38:49,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:49,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash 599815236, now seen corresponding path program 1 times [2025-02-06 02:38:49,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:49,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83920695] [2025-02-06 02:38:49,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:49,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:49,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes. [2025-02-06 02:38:49,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements. [2025-02-06 02:38:49,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:49,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:50,176 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-06 02:38:50,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:50,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83920695] [2025-02-06 02:38:50,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83920695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:50,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:50,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:38:50,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220726687] [2025-02-06 02:38:50,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:50,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:38:50,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:50,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:38:50,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:50,179 INFO L87 Difference]: Start difference. First operand 3327 states and 5148 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-06 02:38:50,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:50,749 INFO L93 Difference]: Finished difference Result 9459 states and 14582 transitions. [2025-02-06 02:38:50,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:38:50,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 551 [2025-02-06 02:38:50,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:50,772 INFO L225 Difference]: With dead ends: 9459 [2025-02-06 02:38:50,772 INFO L226 Difference]: Without dead ends: 6135 [2025-02-06 02:38:50,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:38:50,780 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 967 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:50,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 814 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:38:50,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6135 states. [2025-02-06 02:38:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6135 to 6129. [2025-02-06 02:38:51,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6129 states, 5594 states have (on average 1.4958884519127638) internal successors, (8368), 5606 states have internal predecessors, (8368), 516 states have call successors, (516), 18 states have call predecessors, (516), 18 states have return successors, (516), 504 states have call predecessors, (516), 516 states have call successors, (516) [2025-02-06 02:38:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6129 states to 6129 states and 9400 transitions. [2025-02-06 02:38:51,055 INFO L78 Accepts]: Start accepts. Automaton has 6129 states and 9400 transitions. Word has length 551 [2025-02-06 02:38:51,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:51,056 INFO L471 AbstractCegarLoop]: Abstraction has 6129 states and 9400 transitions. [2025-02-06 02:38:51,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-06 02:38:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 6129 states and 9400 transitions. [2025-02-06 02:38:51,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2025-02-06 02:38:51,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:51,067 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:38:51,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:38:51,067 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:51,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:51,068 INFO L85 PathProgramCache]: Analyzing trace with hash 489015732, now seen corresponding path program 1 times [2025-02-06 02:38:51,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:51,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501253459] [2025-02-06 02:38:51,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:51,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:51,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-02-06 02:38:51,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-02-06 02:38:51,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:51,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-06 02:38:52,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:52,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501253459] [2025-02-06 02:38:52,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501253459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:52,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:52,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:38:52,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400925364] [2025-02-06 02:38:52,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:52,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:38:52,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:52,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:38:52,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:52,346 INFO L87 Difference]: Start difference. First operand 6129 states and 9400 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:53,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:53,013 INFO L93 Difference]: Finished difference Result 25121 states and 38404 transitions. [2025-02-06 02:38:53,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:38:53,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 552 [2025-02-06 02:38:53,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:53,074 INFO L225 Difference]: With dead ends: 25121 [2025-02-06 02:38:53,074 INFO L226 Difference]: Without dead ends: 18995 [2025-02-06 02:38:53,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:38:53,095 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 943 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:53,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 2014 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:38:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18995 states. [2025-02-06 02:38:53,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18995 to 10469. [2025-02-06 02:38:53,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10469 states, 9400 states have (on average 1.4859574468085106) internal successors, (13968), 9424 states have internal predecessors, (13968), 1032 states have call successors, (1032), 36 states have call predecessors, (1032), 36 states have return successors, (1032), 1008 states have call predecessors, (1032), 1032 states have call successors, (1032) [2025-02-06 02:38:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10469 states to 10469 states and 16032 transitions. [2025-02-06 02:38:53,627 INFO L78 Accepts]: Start accepts. Automaton has 10469 states and 16032 transitions. Word has length 552 [2025-02-06 02:38:53,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:53,627 INFO L471 AbstractCegarLoop]: Abstraction has 10469 states and 16032 transitions. [2025-02-06 02:38:53,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:53,628 INFO L276 IsEmpty]: Start isEmpty. Operand 10469 states and 16032 transitions. [2025-02-06 02:38:53,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2025-02-06 02:38:53,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:53,640 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:38:53,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:38:53,640 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:53,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:53,641 INFO L85 PathProgramCache]: Analyzing trace with hash -96485646, now seen corresponding path program 1 times [2025-02-06 02:38:53,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:53,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793309955] [2025-02-06 02:38:53,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:53,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:53,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-02-06 02:38:53,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-02-06 02:38:53,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:53,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-06 02:38:54,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:54,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793309955] [2025-02-06 02:38:54,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793309955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:54,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:54,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:38:54,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917545669] [2025-02-06 02:38:54,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:54,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:38:54,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:54,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:38:54,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:54,225 INFO L87 Difference]: Start difference. First operand 10469 states and 16032 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:54,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:54,912 INFO L93 Difference]: Finished difference Result 23580 states and 36080 transitions. [2025-02-06 02:38:54,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:38:54,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 552 [2025-02-06 02:38:54,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:54,953 INFO L225 Difference]: With dead ends: 23580 [2025-02-06 02:38:54,953 INFO L226 Difference]: Without dead ends: 13114 [2025-02-06 02:38:54,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:38:54,980 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 797 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:54,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1799 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:38:54,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13114 states. [2025-02-06 02:38:55,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13114 to 10477. [2025-02-06 02:38:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10477 states, 9408 states have (on average 1.4855442176870748) internal successors, (13976), 9432 states have internal predecessors, (13976), 1032 states have call successors, (1032), 36 states have call predecessors, (1032), 36 states have return successors, (1032), 1008 states have call predecessors, (1032), 1032 states have call successors, (1032) [2025-02-06 02:38:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10477 states to 10477 states and 16040 transitions. [2025-02-06 02:38:55,491 INFO L78 Accepts]: Start accepts. Automaton has 10477 states and 16040 transitions. Word has length 552 [2025-02-06 02:38:55,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:55,493 INFO L471 AbstractCegarLoop]: Abstraction has 10477 states and 16040 transitions. [2025-02-06 02:38:55,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 10477 states and 16040 transitions. [2025-02-06 02:38:55,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2025-02-06 02:38:55,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:55,502 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:38:55,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:38:55,503 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:55,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:55,503 INFO L85 PathProgramCache]: Analyzing trace with hash -625404685, now seen corresponding path program 1 times [2025-02-06 02:38:55,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:55,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759826723] [2025-02-06 02:38:55,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:55,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:55,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-02-06 02:38:55,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-02-06 02:38:55,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:55,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-06 02:38:56,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:56,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759826723] [2025-02-06 02:38:56,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759826723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:56,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:56,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:38:56,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943196257] [2025-02-06 02:38:56,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:56,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:38:56,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:56,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:38:56,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:56,101 INFO L87 Difference]: Start difference. First operand 10477 states and 16040 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:56,559 INFO L93 Difference]: Finished difference Result 30587 states and 46655 transitions. [2025-02-06 02:38:56,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:38:56,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 552 [2025-02-06 02:38:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:56,608 INFO L225 Difference]: With dead ends: 30587 [2025-02-06 02:38:56,608 INFO L226 Difference]: Without dead ends: 20113 [2025-02-06 02:38:56,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:56,637 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 491 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:56,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1351 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:38:56,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20113 states. [2025-02-06 02:38:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20113 to 14117. [2025-02-06 02:38:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14117 states, 13048 states have (on average 1.5076640098099325) internal successors, (19672), 13072 states have internal predecessors, (19672), 1032 states have call successors, (1032), 36 states have call predecessors, (1032), 36 states have return successors, (1032), 1008 states have call predecessors, (1032), 1032 states have call successors, (1032) [2025-02-06 02:38:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14117 states to 14117 states and 21736 transitions. [2025-02-06 02:38:57,170 INFO L78 Accepts]: Start accepts. Automaton has 14117 states and 21736 transitions. Word has length 552 [2025-02-06 02:38:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:57,171 INFO L471 AbstractCegarLoop]: Abstraction has 14117 states and 21736 transitions. [2025-02-06 02:38:57,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 14117 states and 21736 transitions. [2025-02-06 02:38:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-02-06 02:38:57,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:57,182 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:38:57,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:38:57,182 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:57,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:57,183 INFO L85 PathProgramCache]: Analyzing trace with hash -634393763, now seen corresponding path program 1 times [2025-02-06 02:38:57,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:57,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287546495] [2025-02-06 02:38:57,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:57,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:57,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-02-06 02:38:57,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-02-06 02:38:57,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:57,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:58,095 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-06 02:38:58,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:58,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287546495] [2025-02-06 02:38:58,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287546495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:58,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:58,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:38:58,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074197587] [2025-02-06 02:38:58,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:58,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:38:58,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:58,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:38:58,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:58,097 INFO L87 Difference]: Start difference. First operand 14117 states and 21736 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:58,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:58,671 INFO L93 Difference]: Finished difference Result 31741 states and 48830 transitions. [2025-02-06 02:38:58,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:38:58,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 553 [2025-02-06 02:38:58,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:58,718 INFO L225 Difference]: With dead ends: 31741 [2025-02-06 02:38:58,718 INFO L226 Difference]: Without dead ends: 17627 [2025-02-06 02:38:58,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:58,749 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 894 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:58,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 1200 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:38:58,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17627 states. [2025-02-06 02:38:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17627 to 17525. [2025-02-06 02:38:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17525 states, 15918 states have (on average 1.496544792059304) internal successors, (23822), 15958 states have internal predecessors, (23822), 1548 states have call successors, (1548), 58 states have call predecessors, (1548), 58 states have return successors, (1548), 1508 states have call predecessors, (1548), 1548 states have call successors, (1548) [2025-02-06 02:38:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17525 states to 17525 states and 26918 transitions. [2025-02-06 02:38:59,539 INFO L78 Accepts]: Start accepts. Automaton has 17525 states and 26918 transitions. Word has length 553 [2025-02-06 02:38:59,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:59,540 INFO L471 AbstractCegarLoop]: Abstraction has 17525 states and 26918 transitions. [2025-02-06 02:38:59,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:38:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 17525 states and 26918 transitions. [2025-02-06 02:38:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-02-06 02:38:59,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:59,555 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:38:59,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:38:59,556 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:59,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:59,556 INFO L85 PathProgramCache]: Analyzing trace with hash -514273890, now seen corresponding path program 1 times [2025-02-06 02:38:59,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:59,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872028338] [2025-02-06 02:38:59,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:59,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:59,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-02-06 02:38:59,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-02-06 02:38:59,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:59,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:00,300 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-06 02:39:00,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:00,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872028338] [2025-02-06 02:39:00,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872028338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:00,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:00,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:39:00,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313979816] [2025-02-06 02:39:00,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:00,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:39:00,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:00,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:39:00,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:00,305 INFO L87 Difference]: Start difference. First operand 17525 states and 26918 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:39:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:00,682 INFO L93 Difference]: Finished difference Result 35055 states and 53849 transitions. [2025-02-06 02:39:00,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:39:00,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 553 [2025-02-06 02:39:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:00,724 INFO L225 Difference]: With dead ends: 35055 [2025-02-06 02:39:00,725 INFO L226 Difference]: Without dead ends: 17533 [2025-02-06 02:39:00,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:00,743 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 0 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:00,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1031 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:39:00,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17533 states. [2025-02-06 02:39:01,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17533 to 17533. [2025-02-06 02:39:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17533 states, 15926 states have (on average 1.496295366068065) internal successors, (23830), 15966 states have internal predecessors, (23830), 1548 states have call successors, (1548), 58 states have call predecessors, (1548), 58 states have return successors, (1548), 1508 states have call predecessors, (1548), 1548 states have call successors, (1548) [2025-02-06 02:39:01,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17533 states to 17533 states and 26926 transitions. [2025-02-06 02:39:01,167 INFO L78 Accepts]: Start accepts. Automaton has 17533 states and 26926 transitions. Word has length 553 [2025-02-06 02:39:01,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:01,168 INFO L471 AbstractCegarLoop]: Abstraction has 17533 states and 26926 transitions. [2025-02-06 02:39:01,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-06 02:39:01,168 INFO L276 IsEmpty]: Start isEmpty. Operand 17533 states and 26926 transitions. [2025-02-06 02:39:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2025-02-06 02:39:01,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:01,181 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:39:01,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:39:01,182 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:01,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:01,183 INFO L85 PathProgramCache]: Analyzing trace with hash 557195008, now seen corresponding path program 1 times [2025-02-06 02:39:01,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:01,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272908840] [2025-02-06 02:39:01,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:01,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:01,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 554 statements into 1 equivalence classes. [2025-02-06 02:39:03,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 554 of 554 statements. [2025-02-06 02:39:03,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:03,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat