./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-14.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 fc4d3fa2ecedd768012cc7751a736db9e672ba88ad0e6eb887b83762ab048578 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:43:33,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:43:34,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:43:34,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:43:34,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:43:34,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:43:34,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:43:34,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:43:34,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:43:34,038 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:43:34,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:43:34,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:43:34,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:43:34,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:43:34,039 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:43:34,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:43:34,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:43:34,040 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:43:34,040 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:43:34,040 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:43:34,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:43:34,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:43:34,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:43:34,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:43:34,041 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:43:34,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:43:34,041 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:43:34,041 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:43:34,041 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:43:34,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:43:34,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:43:34,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:43:34,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:43:34,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:43:34,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:43:34,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:43:34,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:43:34,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:43:34,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:43:34,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:43:34,042 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:43:34,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:43:34,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:43:34,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:43:34,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:43:34,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:43:34,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:43:34,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:43:34,043 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 -> fc4d3fa2ecedd768012cc7751a736db9e672ba88ad0e6eb887b83762ab048578 [2025-01-09 14:43:34,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:43:34,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:43:34,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:43:34,262 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:43:34,262 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:43:34,263 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-14.i [2025-01-09 14:43:35,387 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18bc22357/7643293500cb4a4e89d05c080d90c761/FLAG6dda83f52 [2025-01-09 14:43:35,660 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:43:35,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-14.i [2025-01-09 14:43:35,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18bc22357/7643293500cb4a4e89d05c080d90c761/FLAG6dda83f52 [2025-01-09 14:43:35,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18bc22357/7643293500cb4a4e89d05c080d90c761 [2025-01-09 14:43:35,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:43:35,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:43:35,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:43:35,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:43:35,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:43:35,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:43:35" (1/1) ... [2025-01-09 14:43:35,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a33c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:35, skipping insertion in model container [2025-01-09 14:43:35,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:43:35" (1/1) ... [2025-01-09 14:43:35,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:43:35,855 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-14.i[916,929] [2025-01-09 14:43:36,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:43:36,093 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:43:36,102 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-14.i[916,929] [2025-01-09 14:43:36,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:43:36,219 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:43:36,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:36 WrapperNode [2025-01-09 14:43:36,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:43:36,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:43:36,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:43:36,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:43:36,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:36" (1/1) ... [2025-01-09 14:43:36,247 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:36" (1/1) ... [2025-01-09 14:43:36,347 INFO L138 Inliner]: procedures = 26, calls = 97, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 874 [2025-01-09 14:43:36,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:43:36,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:43:36,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:43:36,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:43:36,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:36" (1/1) ... [2025-01-09 14:43:36,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:36" (1/1) ... [2025-01-09 14:43:36,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:36" (1/1) ... [2025-01-09 14:43:36,449 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-01-09 14:43:36,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:36" (1/1) ... [2025-01-09 14:43:36,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:36" (1/1) ... [2025-01-09 14:43:36,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:36" (1/1) ... [2025-01-09 14:43:36,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:36" (1/1) ... [2025-01-09 14:43:36,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:36" (1/1) ... [2025-01-09 14:43:36,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:36" (1/1) ... [2025-01-09 14:43:36,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:36" (1/1) ... [2025-01-09 14:43:36,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:43:36,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:43:36,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:43:36,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:43:36,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:36" (1/1) ... [2025-01-09 14:43:36,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:43:36,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:43:36,579 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-01-09 14:43:36,581 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-01-09 14:43:36,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:43:36,600 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:43:36,600 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:43:36,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:43:36,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:43:36,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:43:36,732 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:43:36,735 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:43:37,863 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-01-09 14:43:37,863 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:43:37,878 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:43:37,878 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:43:37,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:43:37 BoogieIcfgContainer [2025-01-09 14:43:37,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:43:37,882 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:43:37,882 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:43:37,885 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:43:37,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:43:35" (1/3) ... [2025-01-09 14:43:37,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54540126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:43:37, skipping insertion in model container [2025-01-09 14:43:37,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:36" (2/3) ... [2025-01-09 14:43:37,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54540126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:43:37, skipping insertion in model container [2025-01-09 14:43:37,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:43:37" (3/3) ... [2025-01-09 14:43:37,886 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-14.i [2025-01-09 14:43:37,896 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:43:37,900 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-14.i that has 2 procedures, 359 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:43:37,951 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:43:37,961 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;@c0725e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:43:37,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:43:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 359 states, 272 states have (on average 1.525735294117647) internal successors, (415), 273 states have internal predecessors, (415), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 14:43:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-01-09 14:43:37,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:37,989 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:43:37,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:37,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:37,993 INFO L85 PathProgramCache]: Analyzing trace with hash -500476885, now seen corresponding path program 1 times [2025-01-09 14:43:37,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:38,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488305021] [2025-01-09 14:43:38,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:38,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:38,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-01-09 14:43:38,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-01-09 14:43:38,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:38,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 13778 trivial. 0 not checked. [2025-01-09 14:43:38,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:38,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488305021] [2025-01-09 14:43:38,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488305021] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:43:38,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579098999] [2025-01-09 14:43:38,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:38,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:43:38,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:43:38,604 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-01-09 14:43:38,608 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-01-09 14:43:38,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-01-09 14:43:38,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-01-09 14:43:38,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:38,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:38,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 1368 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:43:39,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:43:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 13778 trivial. 0 not checked. [2025-01-09 14:43:39,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:43:39,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579098999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:39,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:43:39,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:43:39,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758859048] [2025-01-09 14:43:39,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:39,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:43:39,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:39,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:43:39,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:43:39,107 INFO L87 Difference]: Start difference. First operand has 359 states, 272 states have (on average 1.525735294117647) internal successors, (415), 273 states have internal predecessors, (415), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) Second operand has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (84), 2 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 2 states have call successors, (84) [2025-01-09 14:43:39,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:39,154 INFO L93 Difference]: Finished difference Result 712 states and 1245 transitions. [2025-01-09 14:43:39,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:43:39,156 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (84), 2 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 2 states have call successors, (84) Word has length 574 [2025-01-09 14:43:39,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:39,162 INFO L225 Difference]: With dead ends: 712 [2025-01-09 14:43:39,162 INFO L226 Difference]: Without dead ends: 356 [2025-01-09 14:43:39,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 575 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-01-09 14:43:39,167 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:39,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:43:39,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-01-09 14:43:39,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-01-09 14:43:39,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 270 states have (on average 1.5185185185185186) internal successors, (410), 270 states have internal predecessors, (410), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 14:43:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 578 transitions. [2025-01-09 14:43:39,218 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 578 transitions. Word has length 574 [2025-01-09 14:43:39,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:39,218 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 578 transitions. [2025-01-09 14:43:39,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (84), 2 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 2 states have call successors, (84) [2025-01-09 14:43:39,219 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 578 transitions. [2025-01-09 14:43:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-01-09 14:43:39,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:39,228 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:43:39,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:43:39,432 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-01-09 14:43:39,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:39,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:39,433 INFO L85 PathProgramCache]: Analyzing trace with hash 364896775, now seen corresponding path program 1 times [2025-01-09 14:43:39,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:39,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121909562] [2025-01-09 14:43:39,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:39,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:39,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-01-09 14:43:39,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-01-09 14:43:39,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:39,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-01-09 14:43:40,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:40,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121909562] [2025-01-09 14:43:40,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121909562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:40,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:40,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:43:40,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181747980] [2025-01-09 14:43:40,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:40,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:43:40,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:40,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:43:40,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:40,019 INFO L87 Difference]: Start difference. First operand 356 states and 578 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-01-09 14:43:40,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:40,181 INFO L93 Difference]: Finished difference Result 967 states and 1570 transitions. [2025-01-09 14:43:40,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:43:40,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 574 [2025-01-09 14:43:40,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:40,189 INFO L225 Difference]: With dead ends: 967 [2025-01-09 14:43:40,191 INFO L226 Difference]: Without dead ends: 614 [2025-01-09 14:43:40,192 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-01-09 14:43:40,193 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 411 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:40,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 1130 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:43:40,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-01-09 14:43:40,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 611. [2025-01-09 14:43:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 489 states have (on average 1.539877300613497) internal successors, (753), 490 states have internal predecessors, (753), 119 states have call successors, (119), 2 states have call predecessors, (119), 2 states have return successors, (119), 118 states have call predecessors, (119), 119 states have call successors, (119) [2025-01-09 14:43:40,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 991 transitions. [2025-01-09 14:43:40,254 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 991 transitions. Word has length 574 [2025-01-09 14:43:40,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:40,258 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 991 transitions. [2025-01-09 14:43:40,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-01-09 14:43:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 991 transitions. [2025-01-09 14:43:40,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-01-09 14:43:40,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:40,268 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:43:40,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:43:40,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:40,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:40,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2050939575, now seen corresponding path program 1 times [2025-01-09 14:43:40,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:40,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230005710] [2025-01-09 14:43:40,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:40,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:40,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-01-09 14:43:40,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-01-09 14:43:40,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:40,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-01-09 14:43:40,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:40,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230005710] [2025-01-09 14:43:40,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230005710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:40,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:40,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:43:40,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134429822] [2025-01-09 14:43:40,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:40,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:43:40,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:40,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:43:40,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:40,633 INFO L87 Difference]: Start difference. First operand 611 states and 991 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-01-09 14:43:40,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:40,722 INFO L93 Difference]: Finished difference Result 1715 states and 2780 transitions. [2025-01-09 14:43:40,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:43:40,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 574 [2025-01-09 14:43:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:40,734 INFO L225 Difference]: With dead ends: 1715 [2025-01-09 14:43:40,734 INFO L226 Difference]: Without dead ends: 1107 [2025-01-09 14:43:40,736 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-01-09 14:43:40,737 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 395 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:40,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1395 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:43:40,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-01-09 14:43:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1104. [2025-01-09 14:43:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 908 states have (on average 1.5484581497797356) internal successors, (1406), 911 states have internal predecessors, (1406), 191 states have call successors, (191), 4 states have call predecessors, (191), 4 states have return successors, (191), 188 states have call predecessors, (191), 191 states have call successors, (191) [2025-01-09 14:43:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1788 transitions. [2025-01-09 14:43:40,816 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1788 transitions. Word has length 574 [2025-01-09 14:43:40,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:40,817 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1788 transitions. [2025-01-09 14:43:40,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-01-09 14:43:40,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1788 transitions. [2025-01-09 14:43:40,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-01-09 14:43:40,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:40,821 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:43:40,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:43:40,821 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:40,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:40,822 INFO L85 PathProgramCache]: Analyzing trace with hash -484181625, now seen corresponding path program 1 times [2025-01-09 14:43:40,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:40,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050456799] [2025-01-09 14:43:40,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:40,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:40,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-01-09 14:43:40,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-01-09 14:43:40,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:40,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-01-09 14:43:41,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:41,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050456799] [2025-01-09 14:43:41,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050456799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:41,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:41,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:43:41,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383264819] [2025-01-09 14:43:41,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:41,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:43:41,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:41,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:43:41,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:41,082 INFO L87 Difference]: Start difference. First operand 1104 states and 1788 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-01-09 14:43:41,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:41,220 INFO L93 Difference]: Finished difference Result 3199 states and 5172 transitions. [2025-01-09 14:43:41,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:43:41,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 574 [2025-01-09 14:43:41,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:41,231 INFO L225 Difference]: With dead ends: 3199 [2025-01-09 14:43:41,231 INFO L226 Difference]: Without dead ends: 2098 [2025-01-09 14:43:41,234 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-01-09 14:43:41,235 INFO L435 NwaCegarLoop]: 961 mSDtfsCounter, 483 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:41,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1484 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:43:41,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2025-01-09 14:43:41,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 1536. [2025-01-09 14:43:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1340 states have (on average 1.5850746268656717) internal successors, (2124), 1343 states have internal predecessors, (2124), 191 states have call successors, (191), 4 states have call predecessors, (191), 4 states have return successors, (191), 188 states have call predecessors, (191), 191 states have call successors, (191) [2025-01-09 14:43:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 2506 transitions. [2025-01-09 14:43:41,311 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 2506 transitions. Word has length 574 [2025-01-09 14:43:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:41,311 INFO L471 AbstractCegarLoop]: Abstraction has 1536 states and 2506 transitions. [2025-01-09 14:43:41,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-01-09 14:43:41,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 2506 transitions. [2025-01-09 14:43:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-01-09 14:43:41,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:41,316 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:43:41,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:43:41,316 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:41,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:41,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1542019703, now seen corresponding path program 1 times [2025-01-09 14:43:41,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:41,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281908552] [2025-01-09 14:43:41,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:41,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:41,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-01-09 14:43:41,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-01-09 14:43:41,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:41,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:41,578 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-01-09 14:43:41,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:41,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281908552] [2025-01-09 14:43:41,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281908552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:41,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:41,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:43:41,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286077586] [2025-01-09 14:43:41,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:41,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:43:41,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:41,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:43:41,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:41,580 INFO L87 Difference]: Start difference. First operand 1536 states and 2506 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-01-09 14:43:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:41,677 INFO L93 Difference]: Finished difference Result 4492 states and 7329 transitions. [2025-01-09 14:43:41,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:43:41,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 574 [2025-01-09 14:43:41,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:41,692 INFO L225 Difference]: With dead ends: 4492 [2025-01-09 14:43:41,692 INFO L226 Difference]: Without dead ends: 2959 [2025-01-09 14:43:41,695 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-01-09 14:43:41,696 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 422 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:41,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1447 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:43:41,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2025-01-09 14:43:41,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2956. [2025-01-09 14:43:41,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2956 states, 2588 states have (on average 1.5819165378670788) internal successors, (4094), 2595 states have internal predecessors, (4094), 359 states have call successors, (359), 8 states have call predecessors, (359), 8 states have return successors, (359), 352 states have call predecessors, (359), 359 states have call successors, (359) [2025-01-09 14:43:41,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 4812 transitions. [2025-01-09 14:43:41,816 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 4812 transitions. Word has length 574 [2025-01-09 14:43:41,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:41,818 INFO L471 AbstractCegarLoop]: Abstraction has 2956 states and 4812 transitions. [2025-01-09 14:43:41,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-01-09 14:43:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 4812 transitions. [2025-01-09 14:43:41,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-01-09 14:43:41,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:41,829 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:43:41,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:43:41,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:41,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:41,831 INFO L85 PathProgramCache]: Analyzing trace with hash -217163509, now seen corresponding path program 1 times [2025-01-09 14:43:41,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:41,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278114101] [2025-01-09 14:43:41,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:41,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:41,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-01-09 14:43:41,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-01-09 14:43:41,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:41,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-01-09 14:43:42,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:42,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278114101] [2025-01-09 14:43:42,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278114101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:42,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:42,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:43:42,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795963278] [2025-01-09 14:43:42,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:42,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:43:42,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:42,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:43:42,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:43:42,285 INFO L87 Difference]: Start difference. First operand 2956 states and 4812 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-01-09 14:43:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:43,130 INFO L93 Difference]: Finished difference Result 19044 states and 31026 transitions. [2025-01-09 14:43:43,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:43:43,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 574 [2025-01-09 14:43:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:43,193 INFO L225 Difference]: With dead ends: 19044 [2025-01-09 14:43:43,193 INFO L226 Difference]: Without dead ends: 16091 [2025-01-09 14:43:43,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:43:43,204 INFO L435 NwaCegarLoop]: 1727 mSDtfsCounter, 1816 mSDsluCounter, 2986 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1816 SdHoareTripleChecker+Valid, 4713 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:43,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1816 Valid, 4713 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:43:43,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16091 states. [2025-01-09 14:43:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16091 to 11809. [2025-01-09 14:43:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11809 states, 10340 states have (on average 1.5733075435203094) internal successors, (16268), 10368 states have internal predecessors, (16268), 1436 states have call successors, (1436), 32 states have call predecessors, (1436), 32 states have return successors, (1436), 1408 states have call predecessors, (1436), 1436 states have call successors, (1436) [2025-01-09 14:43:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11809 states to 11809 states and 19140 transitions. [2025-01-09 14:43:43,754 INFO L78 Accepts]: Start accepts. Automaton has 11809 states and 19140 transitions. Word has length 574 [2025-01-09 14:43:43,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:43,755 INFO L471 AbstractCegarLoop]: Abstraction has 11809 states and 19140 transitions. [2025-01-09 14:43:43,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-01-09 14:43:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 11809 states and 19140 transitions. [2025-01-09 14:43:43,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-01-09 14:43:43,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:43,769 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:43:43,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:43:43,769 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:43,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:43,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1680333257, now seen corresponding path program 1 times [2025-01-09 14:43:43,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:43,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992175372] [2025-01-09 14:43:43,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:43,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:43,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-01-09 14:43:43,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-01-09 14:43:43,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:43,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-01-09 14:43:44,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:44,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992175372] [2025-01-09 14:43:44,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992175372] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:44,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:44,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:43:44,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54138564] [2025-01-09 14:43:44,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:44,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:43:44,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:44,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:43:44,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:44,014 INFO L87 Difference]: Start difference. First operand 11809 states and 19140 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-01-09 14:43:44,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:44,352 INFO L93 Difference]: Finished difference Result 26568 states and 43086 transitions. [2025-01-09 14:43:44,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:43:44,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 574 [2025-01-09 14:43:44,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:44,393 INFO L225 Difference]: With dead ends: 26568 [2025-01-09 14:43:44,393 INFO L226 Difference]: Without dead ends: 14762 [2025-01-09 14:43:44,414 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-01-09 14:43:44,415 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 393 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:44,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1445 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:43:44,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14762 states. [2025-01-09 14:43:44,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14762 to 8858. [2025-01-09 14:43:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8858 states, 7756 states have (on average 1.5701392470345539) internal successors, (12178), 7777 states have internal predecessors, (12178), 1077 states have call successors, (1077), 24 states have call predecessors, (1077), 24 states have return successors, (1077), 1056 states have call predecessors, (1077), 1077 states have call successors, (1077) [2025-01-09 14:43:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8858 states to 8858 states and 14332 transitions. [2025-01-09 14:43:44,913 INFO L78 Accepts]: Start accepts. Automaton has 8858 states and 14332 transitions. Word has length 574 [2025-01-09 14:43:44,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:44,914 INFO L471 AbstractCegarLoop]: Abstraction has 8858 states and 14332 transitions. [2025-01-09 14:43:44,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-01-09 14:43:44,918 INFO L276 IsEmpty]: Start isEmpty. Operand 8858 states and 14332 transitions. [2025-01-09 14:43:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-01-09 14:43:44,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:44,931 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:43:44,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:43:44,931 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:44,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:44,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1865822584, now seen corresponding path program 1 times [2025-01-09 14:43:44,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:44,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45927279] [2025-01-09 14:43:44,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:44,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:44,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-01-09 14:43:45,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-01-09 14:43:45,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:45,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:45,789 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-01-09 14:43:45,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:45,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45927279] [2025-01-09 14:43:45,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45927279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:45,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:45,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:43:45,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118691900] [2025-01-09 14:43:45,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:45,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:43:45,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:45,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:43:45,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:43:45,792 INFO L87 Difference]: Start difference. First operand 8858 states and 14332 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-01-09 14:43:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:46,770 INFO L93 Difference]: Finished difference Result 24175 states and 38872 transitions. [2025-01-09 14:43:46,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:43:46,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 575 [2025-01-09 14:43:46,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:46,818 INFO L225 Difference]: With dead ends: 24175 [2025-01-09 14:43:46,819 INFO L226 Difference]: Without dead ends: 15320 [2025-01-09 14:43:46,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:43:46,840 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 1365 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:46,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 2369 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:43:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15320 states. [2025-01-09 14:43:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15320 to 11630. [2025-01-09 14:43:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11630 states, 10528 states have (on average 1.5856762917933132) internal successors, (16694), 10549 states have internal predecessors, (16694), 1077 states have call successors, (1077), 24 states have call predecessors, (1077), 24 states have return successors, (1077), 1056 states have call predecessors, (1077), 1077 states have call successors, (1077) [2025-01-09 14:43:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11630 states to 11630 states and 18848 transitions. [2025-01-09 14:43:47,288 INFO L78 Accepts]: Start accepts. Automaton has 11630 states and 18848 transitions. Word has length 575 [2025-01-09 14:43:47,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:47,289 INFO L471 AbstractCegarLoop]: Abstraction has 11630 states and 18848 transitions. [2025-01-09 14:43:47,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-01-09 14:43:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 11630 states and 18848 transitions. [2025-01-09 14:43:47,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-01-09 14:43:47,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:47,300 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:43:47,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:43:47,301 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:47,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:47,301 INFO L85 PathProgramCache]: Analyzing trace with hash -560125992, now seen corresponding path program 1 times [2025-01-09 14:43:47,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:47,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105217324] [2025-01-09 14:43:47,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:47,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:47,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-01-09 14:43:47,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-01-09 14:43:47,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:47,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-01-09 14:43:47,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:47,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105217324] [2025-01-09 14:43:47,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105217324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:47,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:47,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:43:47,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921907591] [2025-01-09 14:43:47,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:47,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:43:47,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:47,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:43:47,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:43:47,838 INFO L87 Difference]: Start difference. First operand 11630 states and 18848 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-01-09 14:43:48,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:48,513 INFO L93 Difference]: Finished difference Result 29731 states and 48161 transitions. [2025-01-09 14:43:48,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:43:48,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 575 [2025-01-09 14:43:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:48,560 INFO L225 Difference]: With dead ends: 29731 [2025-01-09 14:43:48,561 INFO L226 Difference]: Without dead ends: 18104 [2025-01-09 14:43:48,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:43:48,592 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 428 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:48,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1693 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:43:48,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18104 states. [2025-01-09 14:43:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18104 to 17606. [2025-01-09 14:43:49,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17606 states, 16417 states have (on average 1.6022415788511908) internal successors, (26304), 16438 states have internal predecessors, (26304), 1161 states have call successors, (1161), 27 states have call predecessors, (1161), 27 states have return successors, (1161), 1140 states have call predecessors, (1161), 1161 states have call successors, (1161) [2025-01-09 14:43:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17606 states to 17606 states and 28626 transitions. [2025-01-09 14:43:49,246 INFO L78 Accepts]: Start accepts. Automaton has 17606 states and 28626 transitions. Word has length 575 [2025-01-09 14:43:49,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:49,246 INFO L471 AbstractCegarLoop]: Abstraction has 17606 states and 28626 transitions. [2025-01-09 14:43:49,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-01-09 14:43:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 17606 states and 28626 transitions. [2025-01-09 14:43:49,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-01-09 14:43:49,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:49,261 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:43:49,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:43:49,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:49,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:49,262 INFO L85 PathProgramCache]: Analyzing trace with hash 416881772, now seen corresponding path program 1 times [2025-01-09 14:43:49,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:49,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669027204] [2025-01-09 14:43:49,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:49,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:49,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 14:43:49,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 14:43:49,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:49,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:53,518 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-01-09 14:43:53,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:53,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669027204] [2025-01-09 14:43:53,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669027204] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:53,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:53,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 14:43:53,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050293966] [2025-01-09 14:43:53,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:53,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 14:43:53,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:53,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 14:43:53,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:43:53,521 INFO L87 Difference]: Start difference. First operand 17606 states and 28626 transitions. Second operand has 18 states, 18 states have (on average 8.833333333333334) internal successors, (159), 18 states have internal predecessors, (159), 3 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 3 states have call predecessors, (84), 3 states have call successors, (84) [2025-01-09 14:44:04,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:04,162 INFO L93 Difference]: Finished difference Result 68324 states and 109380 transitions. [2025-01-09 14:44:04,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 14:44:04,163 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.833333333333334) internal successors, (159), 18 states have internal predecessors, (159), 3 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 3 states have call predecessors, (84), 3 states have call successors, (84) Word has length 576 [2025-01-09 14:44:04,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:04,282 INFO L225 Difference]: With dead ends: 68324 [2025-01-09 14:44:04,283 INFO L226 Difference]: Without dead ends: 55577 [2025-01-09 14:44:04,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=478, Invalid=1502, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 14:44:04,314 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 6308 mSDsluCounter, 6579 mSDsCounter, 0 mSdLazyCounter, 4793 mSolverCounterSat, 817 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6308 SdHoareTripleChecker+Valid, 7301 SdHoareTripleChecker+Invalid, 5610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 817 IncrementalHoareTripleChecker+Valid, 4793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:04,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6308 Valid, 7301 Invalid, 5610 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [817 Valid, 4793 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-01-09 14:44:04,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55577 states. [2025-01-09 14:44:05,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55577 to 31045. [2025-01-09 14:44:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31045 states, 29503 states have (on average 1.6012947835813307) internal successors, (47243), 29556 states have internal predecessors, (47243), 1481 states have call successors, (1481), 60 states have call predecessors, (1481), 60 states have return successors, (1481), 1428 states have call predecessors, (1481), 1481 states have call successors, (1481) [2025-01-09 14:44:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31045 states to 31045 states and 50205 transitions. [2025-01-09 14:44:05,688 INFO L78 Accepts]: Start accepts. Automaton has 31045 states and 50205 transitions. Word has length 576 [2025-01-09 14:44:05,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:05,689 INFO L471 AbstractCegarLoop]: Abstraction has 31045 states and 50205 transitions. [2025-01-09 14:44:05,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.833333333333334) internal successors, (159), 18 states have internal predecessors, (159), 3 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 3 states have call predecessors, (84), 3 states have call successors, (84) [2025-01-09 14:44:05,689 INFO L276 IsEmpty]: Start isEmpty. Operand 31045 states and 50205 transitions. [2025-01-09 14:44:05,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-01-09 14:44:05,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:05,755 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:05,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:44:05,756 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:05,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:05,756 INFO L85 PathProgramCache]: Analyzing trace with hash -969321622, now seen corresponding path program 1 times [2025-01-09 14:44:05,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:05,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588179015] [2025-01-09 14:44:05,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:05,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:05,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 14:44:06,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 14:44:06,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:06,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-01-09 14:44:06,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:06,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588179015] [2025-01-09 14:44:06,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588179015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:06,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:06,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:44:06,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953450181] [2025-01-09 14:44:06,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:06,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:44:06,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:06,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:44:06,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:44:06,712 INFO L87 Difference]: Start difference. First operand 31045 states and 50205 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 2 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) [2025-01-09 14:44:07,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:07,454 INFO L93 Difference]: Finished difference Result 61608 states and 99586 transitions. [2025-01-09 14:44:07,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:07,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 2 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) Word has length 576 [2025-01-09 14:44:07,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:07,511 INFO L225 Difference]: With dead ends: 61608 [2025-01-09 14:44:07,511 INFO L226 Difference]: Without dead ends: 31045 [2025-01-09 14:44:07,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:44:07,537 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 1113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:07,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 567 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:44:07,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31045 states. [2025-01-09 14:44:08,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31045 to 31045. [2025-01-09 14:44:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31045 states, 29503 states have (on average 1.598040877198929) internal successors, (47147), 29556 states have internal predecessors, (47147), 1481 states have call successors, (1481), 60 states have call predecessors, (1481), 60 states have return successors, (1481), 1428 states have call predecessors, (1481), 1481 states have call successors, (1481) [2025-01-09 14:44:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31045 states to 31045 states and 50109 transitions. [2025-01-09 14:44:08,531 INFO L78 Accepts]: Start accepts. Automaton has 31045 states and 50109 transitions. Word has length 576 [2025-01-09 14:44:08,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:08,532 INFO L471 AbstractCegarLoop]: Abstraction has 31045 states and 50109 transitions. [2025-01-09 14:44:08,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 2 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) [2025-01-09 14:44:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 31045 states and 50109 transitions. [2025-01-09 14:44:08,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-01-09 14:44:08,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:08,556 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:08,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:44:08,557 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:08,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:08,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1047428276, now seen corresponding path program 1 times [2025-01-09 14:44:08,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:08,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299731369] [2025-01-09 14:44:08,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:08,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:08,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-01-09 14:44:08,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-01-09 14:44:08,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:08,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-01-09 14:44:14,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:14,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299731369] [2025-01-09 14:44:14,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299731369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:14,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:14,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-01-09 14:44:14,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365764573] [2025-01-09 14:44:14,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:14,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 14:44:14,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:14,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 14:44:14,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2025-01-09 14:44:14,729 INFO L87 Difference]: Start difference. First operand 31045 states and 50109 transitions. Second operand has 24 states, 24 states have (on average 6.666666666666667) internal successors, (160), 24 states have internal predecessors, (160), 5 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 5 states have call predecessors, (84), 5 states have call successors, (84) [2025-01-09 14:44:31,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:31,528 INFO L93 Difference]: Finished difference Result 402048 states and 647974 transitions. [2025-01-09 14:44:31,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 14:44:31,528 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 6.666666666666667) internal successors, (160), 24 states have internal predecessors, (160), 5 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 5 states have call predecessors, (84), 5 states have call successors, (84) Word has length 577 [2025-01-09 14:44:31,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:32,453 INFO L225 Difference]: With dead ends: 402048 [2025-01-09 14:44:32,454 INFO L226 Difference]: Without dead ends: 372349 [2025-01-09 14:44:32,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=594, Invalid=1956, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 14:44:32,569 INFO L435 NwaCegarLoop]: 1011 mSDtfsCounter, 11778 mSDsluCounter, 13747 mSDsCounter, 0 mSdLazyCounter, 8988 mSolverCounterSat, 1028 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11778 SdHoareTripleChecker+Valid, 14758 SdHoareTripleChecker+Invalid, 10016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1028 IncrementalHoareTripleChecker+Valid, 8988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:32,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11778 Valid, 14758 Invalid, 10016 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1028 Valid, 8988 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2025-01-09 14:44:32,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372349 states. [2025-01-09 14:44:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372349 to 150905. [2025-01-09 14:44:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150905 states, 147717 states have (on average 1.6084472335614723) internal successors, (237595), 147847 states have internal predecessors, (237595), 3046 states have call successors, (3046), 141 states have call predecessors, (3046), 141 states have return successors, (3046), 2916 states have call predecessors, (3046), 3046 states have call successors, (3046) [2025-01-09 14:44:37,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150905 states to 150905 states and 243687 transitions. [2025-01-09 14:44:37,290 INFO L78 Accepts]: Start accepts. Automaton has 150905 states and 243687 transitions. Word has length 577 [2025-01-09 14:44:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:37,292 INFO L471 AbstractCegarLoop]: Abstraction has 150905 states and 243687 transitions. [2025-01-09 14:44:37,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.666666666666667) internal successors, (160), 24 states have internal predecessors, (160), 5 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 5 states have call predecessors, (84), 5 states have call successors, (84) [2025-01-09 14:44:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 150905 states and 243687 transitions. [2025-01-09 14:44:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-01-09 14:44:37,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:37,755 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:37,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:44:37,755 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:37,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:37,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1217477944, now seen corresponding path program 1 times [2025-01-09 14:44:37,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:37,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454133801] [2025-01-09 14:44:37,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:37,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:37,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-01-09 14:44:38,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-01-09 14:44:38,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:38,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-01-09 14:44:40,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:40,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454133801] [2025-01-09 14:44:40,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454133801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:40,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:40,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:44:40,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99159899] [2025-01-09 14:44:40,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:40,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:44:40,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:40,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:44:40,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:44:40,558 INFO L87 Difference]: Start difference. First operand 150905 states and 243687 transitions. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 3 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 3 states have call predecessors, (84), 3 states have call successors, (84) [2025-01-09 14:44:46,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:46,958 INFO L93 Difference]: Finished difference Result 359242 states and 576812 transitions. [2025-01-09 14:44:46,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:44:46,959 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 3 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 3 states have call predecessors, (84), 3 states have call successors, (84) Word has length 577 [2025-01-09 14:44:46,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:47,529 INFO L225 Difference]: With dead ends: 359242 [2025-01-09 14:44:47,529 INFO L226 Difference]: Without dead ends: 290091 [2025-01-09 14:44:47,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:44:47,596 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 1762 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:47,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1762 Valid, 2487 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 14:44:47,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290091 states.