./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-25.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a0aa5268274913f166e3439344c11e1f55f1cae222bb90cd734b4386dad3afb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:03:52,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:03:52,826 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:03:52,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:03:52,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:03:52,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:03:52,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:03:52,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:03:52,854 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:03:52,854 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:03:52,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:03:52,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:03:52,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:03:52,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:03:52,855 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:03:52,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:03:52,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:03:52,855 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:03:52,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:03:52,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:03:52,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:03:52,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:03:52,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:03:52,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:03:52,856 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:03:52,856 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:03:52,856 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:03:52,856 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:03:52,856 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:03:52,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:03:52,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:03:52,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:03:52,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:03:52,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:03:52,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:03:52,857 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:03:52,857 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:03:52,857 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:03:52,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:03:52,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:03:52,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:03:52,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:03:52,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:03:52,858 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a0aa5268274913f166e3439344c11e1f55f1cae222bb90cd734b4386dad3afb [2025-03-17 00:03:53,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:03:53,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:03:53,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:03:53,203 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:03:53,204 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:03:53,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-25.i [2025-03-17 00:03:54,472 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c9b6024/3cff19745cd24f5f999da674faa646d8/FLAG5ee1061dc [2025-03-17 00:03:54,769 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:03:54,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-25.i [2025-03-17 00:03:54,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c9b6024/3cff19745cd24f5f999da674faa646d8/FLAG5ee1061dc [2025-03-17 00:03:55,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c9b6024/3cff19745cd24f5f999da674faa646d8 [2025-03-17 00:03:55,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:03:55,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:03:55,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:03:55,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:03:55,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:03:55,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:03:55" (1/1) ... [2025-03-17 00:03:55,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3249ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:55, skipping insertion in model container [2025-03-17 00:03:55,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:03:55" (1/1) ... [2025-03-17 00:03:55,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:03:55,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-25.i[916,929] [2025-03-17 00:03:55,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:03:55,486 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:03:55,503 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-25.i[916,929] [2025-03-17 00:03:55,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:03:55,621 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:03:55,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:55 WrapperNode [2025-03-17 00:03:55,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:03:55,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:03:55,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:03:55,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:03:55,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:55" (1/1) ... [2025-03-17 00:03:55,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:55" (1/1) ... [2025-03-17 00:03:55,744 INFO L138 Inliner]: procedures = 26, calls = 84, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 571 [2025-03-17 00:03:55,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:03:55,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:03:55,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:03:55,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:03:55,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:55" (1/1) ... [2025-03-17 00:03:55,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:55" (1/1) ... [2025-03-17 00:03:55,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:55" (1/1) ... [2025-03-17 00:03:55,817 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:03:55,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:55" (1/1) ... [2025-03-17 00:03:55,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:55" (1/1) ... [2025-03-17 00:03:55,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:55" (1/1) ... [2025-03-17 00:03:55,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:55" (1/1) ... [2025-03-17 00:03:55,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:55" (1/1) ... [2025-03-17 00:03:55,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:55" (1/1) ... [2025-03-17 00:03:55,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:03:55,887 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:03:55,887 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:03:55,887 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:03:55,888 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:55" (1/1) ... [2025-03-17 00:03:55,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:03:55,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:03:55,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:03:55,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:03:55,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:03:55,984 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:03:55,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:03:55,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:03:55,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:03:55,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:03:56,158 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:03:56,164 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:03:57,335 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-17 00:03:57,336 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:03:57,368 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:03:57,370 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:03:57,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:03:57 BoogieIcfgContainer [2025-03-17 00:03:57,371 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:03:57,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:03:57,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:03:57,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:03:57,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:03:55" (1/3) ... [2025-03-17 00:03:57,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62be8b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:03:57, skipping insertion in model container [2025-03-17 00:03:57,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:55" (2/3) ... [2025-03-17 00:03:57,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62be8b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:03:57, skipping insertion in model container [2025-03-17 00:03:57,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:03:57" (3/3) ... [2025-03-17 00:03:57,379 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-25.i [2025-03-17 00:03:57,389 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:03:57,392 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-25.i that has 2 procedures, 228 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:03:57,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:03:57,478 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;@7c32d373, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:03:57,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:03:57,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 154 states have (on average 1.5714285714285714) internal successors, (242), 155 states have internal predecessors, (242), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-17 00:03:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-17 00:03:57,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:03:57,541 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:03:57,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:03:57,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:03:57,551 INFO L85 PathProgramCache]: Analyzing trace with hash 367027415, now seen corresponding path program 1 times [2025-03-17 00:03:57,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:03:57,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224437147] [2025-03-17 00:03:57,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:03:57,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:03:57,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-17 00:03:57,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-17 00:03:57,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:03:57,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:03:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-03-17 00:03:58,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:03:58,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224437147] [2025-03-17 00:03:58,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224437147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:03:58,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441201194] [2025-03-17 00:03:58,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:03:58,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:03:58,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:03:58,523 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:03:58,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:03:58,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-17 00:03:58,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-17 00:03:58,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:03:58,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:03:59,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:03:59,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:03:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-03-17 00:03:59,173 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:03:59,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441201194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:03:59,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:03:59,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:03:59,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568489456] [2025-03-17 00:03:59,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:03:59,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:03:59,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:03:59,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:03:59,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:03:59,237 INFO L87 Difference]: Start difference. First operand has 228 states, 154 states have (on average 1.5714285714285714) internal successors, (242), 155 states have internal predecessors, (242), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-03-17 00:03:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:03:59,363 INFO L93 Difference]: Finished difference Result 453 states and 837 transitions. [2025-03-17 00:03:59,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:03:59,366 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) Word has length 454 [2025-03-17 00:03:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:03:59,377 INFO L225 Difference]: With dead ends: 453 [2025-03-17 00:03:59,384 INFO L226 Difference]: Without dead ends: 226 [2025-03-17 00:03:59,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:03:59,397 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:03:59,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 366 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:03:59,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-17 00:03:59,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2025-03-17 00:03:59,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 153 states have (on average 1.542483660130719) internal successors, (236), 153 states have internal predecessors, (236), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-17 00:03:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 378 transitions. [2025-03-17 00:03:59,525 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 378 transitions. Word has length 454 [2025-03-17 00:03:59,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:03:59,526 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 378 transitions. [2025-03-17 00:03:59,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-03-17 00:03:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 378 transitions. [2025-03-17 00:03:59,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-17 00:03:59,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:03:59,544 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:03:59,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 00:03:59,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:03:59,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:03:59,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:03:59,750 INFO L85 PathProgramCache]: Analyzing trace with hash 486677192, now seen corresponding path program 1 times [2025-03-17 00:03:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:03:59,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649867239] [2025-03-17 00:03:59,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:03:59,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:03:59,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-17 00:03:59,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-17 00:03:59,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:03:59,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-17 00:04:00,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:00,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649867239] [2025-03-17 00:04:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649867239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:04:00,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:04:00,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:04:00,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491829225] [2025-03-17 00:04:00,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:04:00,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:04:00,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:00,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:04:00,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:04:00,493 INFO L87 Difference]: Start difference. First operand 226 states and 378 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-17 00:04:00,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:00,655 INFO L93 Difference]: Finished difference Result 584 states and 980 transitions. [2025-03-17 00:04:00,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:04:00,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 455 [2025-03-17 00:04:00,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:00,662 INFO L225 Difference]: With dead ends: 584 [2025-03-17 00:04:00,668 INFO L226 Difference]: Without dead ends: 359 [2025-03-17 00:04:00,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:04:00,673 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 218 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:00,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 774 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:04:00,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-17 00:04:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2025-03-17 00:04:00,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 270 states have (on average 1.5962962962962963) internal successors, (431), 271 states have internal predecessors, (431), 83 states have call successors, (83), 2 states have call predecessors, (83), 2 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 00:04:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 597 transitions. [2025-03-17 00:04:00,779 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 597 transitions. Word has length 455 [2025-03-17 00:04:00,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:00,780 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 597 transitions. [2025-03-17 00:04:00,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-17 00:04:00,780 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 597 transitions. [2025-03-17 00:04:00,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-17 00:04:00,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:00,791 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:04:00,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:04:00,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:00,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:00,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1443941913, now seen corresponding path program 1 times [2025-03-17 00:04:00,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:00,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635954272] [2025-03-17 00:04:00,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:00,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:00,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-17 00:04:00,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-17 00:04:00,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:00,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-17 00:04:01,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:01,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635954272] [2025-03-17 00:04:01,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635954272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:04:01,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:04:01,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:04:01,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347731786] [2025-03-17 00:04:01,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:04:01,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:04:01,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:01,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:04:01,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:04:01,690 INFO L87 Difference]: Start difference. First operand 356 states and 597 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-17 00:04:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:01,911 INFO L93 Difference]: Finished difference Result 1066 states and 1789 transitions. [2025-03-17 00:04:01,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:04:01,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 455 [2025-03-17 00:04:01,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:01,926 INFO L225 Difference]: With dead ends: 1066 [2025-03-17 00:04:01,926 INFO L226 Difference]: Without dead ends: 711 [2025-03-17 00:04:01,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:04:01,934 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 247 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:01,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 709 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:04:01,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-03-17 00:04:02,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 705. [2025-03-17 00:04:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 534 states have (on average 1.591760299625468) internal successors, (850), 536 states have internal predecessors, (850), 166 states have call successors, (166), 4 states have call predecessors, (166), 4 states have return successors, (166), 164 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-17 00:04:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1182 transitions. [2025-03-17 00:04:02,131 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1182 transitions. Word has length 455 [2025-03-17 00:04:02,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:02,132 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1182 transitions. [2025-03-17 00:04:02,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-17 00:04:02,132 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1182 transitions. [2025-03-17 00:04:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-17 00:04:02,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:02,147 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:04:02,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:04:02,147 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:02,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:02,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1826331462, now seen corresponding path program 1 times [2025-03-17 00:04:02,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:02,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702390149] [2025-03-17 00:04:02,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:02,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:02,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-17 00:04:02,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-17 00:04:02,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:02,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-17 00:04:02,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:02,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702390149] [2025-03-17 00:04:02,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702390149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:04:02,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:04:02,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:04:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841823208] [2025-03-17 00:04:02,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:04:02,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:04:02,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:02,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:04:02,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:04:02,650 INFO L87 Difference]: Start difference. First operand 705 states and 1182 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-17 00:04:02,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:02,815 INFO L93 Difference]: Finished difference Result 1421 states and 2372 transitions. [2025-03-17 00:04:02,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:04:02,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 455 [2025-03-17 00:04:02,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:02,827 INFO L225 Difference]: With dead ends: 1421 [2025-03-17 00:04:02,832 INFO L226 Difference]: Without dead ends: 717 [2025-03-17 00:04:02,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:04:02,837 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 203 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:02,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 760 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:04:02,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-03-17 00:04:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 537. [2025-03-17 00:04:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 390 states have (on average 1.5692307692307692) internal successors, (612), 390 states have internal predecessors, (612), 142 states have call successors, (142), 4 states have call predecessors, (142), 4 states have return successors, (142), 142 states have call predecessors, (142), 142 states have call successors, (142) [2025-03-17 00:04:02,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 896 transitions. [2025-03-17 00:04:02,975 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 896 transitions. Word has length 455 [2025-03-17 00:04:02,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:02,979 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 896 transitions. [2025-03-17 00:04:02,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-17 00:04:02,981 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 896 transitions. [2025-03-17 00:04:02,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-17 00:04:02,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:02,994 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:04:02,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:04:02,995 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:02,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:02,996 INFO L85 PathProgramCache]: Analyzing trace with hash -835831835, now seen corresponding path program 1 times [2025-03-17 00:04:02,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:02,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820431774] [2025-03-17 00:04:03,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:03,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:03,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-17 00:04:03,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-17 00:04:03,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:03,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:03,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-17 00:04:03,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:03,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820431774] [2025-03-17 00:04:03,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820431774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:04:03,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:04:03,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:04:03,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74080289] [2025-03-17 00:04:03,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:04:03,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:04:03,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:03,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:04:03,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:04:03,714 INFO L87 Difference]: Start difference. First operand 537 states and 896 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-17 00:04:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:04,144 INFO L93 Difference]: Finished difference Result 1080 states and 1802 transitions. [2025-03-17 00:04:04,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:04:04,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 455 [2025-03-17 00:04:04,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:04,154 INFO L225 Difference]: With dead ends: 1080 [2025-03-17 00:04:04,155 INFO L226 Difference]: Without dead ends: 544 [2025-03-17 00:04:04,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:04:04,161 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 236 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:04,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 995 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:04:04,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-03-17 00:04:04,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 538. [2025-03-17 00:04:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 391 states have (on average 1.567774936061381) internal successors, (613), 391 states have internal predecessors, (613), 142 states have call successors, (142), 4 states have call predecessors, (142), 4 states have return successors, (142), 142 states have call predecessors, (142), 142 states have call successors, (142) [2025-03-17 00:04:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 897 transitions. [2025-03-17 00:04:04,265 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 897 transitions. Word has length 455 [2025-03-17 00:04:04,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:04,269 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 897 transitions. [2025-03-17 00:04:04,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-17 00:04:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 897 transitions. [2025-03-17 00:04:04,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-17 00:04:04,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:04,284 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:04:04,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:04:04,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:04,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:04,285 INFO L85 PathProgramCache]: Analyzing trace with hash 181512320, now seen corresponding path program 1 times [2025-03-17 00:04:04,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:04,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836345075] [2025-03-17 00:04:04,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:04,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:04,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-17 00:04:04,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-17 00:04:04,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:04,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:04,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-17 00:04:04,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:04,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836345075] [2025-03-17 00:04:04,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836345075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:04:04,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:04:04,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:04:04,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024977595] [2025-03-17 00:04:04,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:04:04,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:04:04,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:04,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:04:04,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:04:04,768 INFO L87 Difference]: Start difference. First operand 538 states and 897 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-17 00:04:05,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:05,079 INFO L93 Difference]: Finished difference Result 1619 states and 2667 transitions. [2025-03-17 00:04:05,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:04:05,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 456 [2025-03-17 00:04:05,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:05,091 INFO L225 Difference]: With dead ends: 1619 [2025-03-17 00:04:05,095 INFO L226 Difference]: Without dead ends: 1082 [2025-03-17 00:04:05,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:04:05,098 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 583 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:05,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1324 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:04:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2025-03-17 00:04:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 805. [2025-03-17 00:04:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 616 states have (on average 1.5795454545454546) internal successors, (973), 618 states have internal predecessors, (973), 180 states have call successors, (180), 8 states have call predecessors, (180), 8 states have return successors, (180), 178 states have call predecessors, (180), 180 states have call successors, (180) [2025-03-17 00:04:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1333 transitions. [2025-03-17 00:04:05,204 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1333 transitions. Word has length 456 [2025-03-17 00:04:05,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:05,208 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1333 transitions. [2025-03-17 00:04:05,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-17 00:04:05,209 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1333 transitions. [2025-03-17 00:04:05,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-17 00:04:05,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:05,217 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:04:05,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:04:05,217 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:05,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash 201849695, now seen corresponding path program 1 times [2025-03-17 00:04:05,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:05,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494828255] [2025-03-17 00:04:05,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:05,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-17 00:04:05,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-17 00:04:05,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:05,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:08,176 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-17 00:04:08,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:08,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494828255] [2025-03-17 00:04:08,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494828255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:04:08,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:04:08,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:04:08,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591707696] [2025-03-17 00:04:08,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:04:08,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:04:08,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:08,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:04:08,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:04:08,186 INFO L87 Difference]: Start difference. First operand 805 states and 1333 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-17 00:04:09,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:09,074 INFO L93 Difference]: Finished difference Result 2571 states and 4195 transitions. [2025-03-17 00:04:09,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:04:09,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 456 [2025-03-17 00:04:09,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:09,085 INFO L225 Difference]: With dead ends: 2571 [2025-03-17 00:04:09,085 INFO L226 Difference]: Without dead ends: 1767 [2025-03-17 00:04:09,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:04:09,092 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 540 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:09,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 925 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 00:04:09,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2025-03-17 00:04:09,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1375. [2025-03-17 00:04:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1052 states have (on average 1.5541825095057034) internal successors, (1635), 1058 states have internal predecessors, (1635), 306 states have call successors, (306), 16 states have call predecessors, (306), 16 states have return successors, (306), 300 states have call predecessors, (306), 306 states have call successors, (306) [2025-03-17 00:04:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2247 transitions. [2025-03-17 00:04:09,241 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2247 transitions. Word has length 456 [2025-03-17 00:04:09,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:09,242 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 2247 transitions. [2025-03-17 00:04:09,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-17 00:04:09,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2247 transitions. [2025-03-17 00:04:09,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-17 00:04:09,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:09,246 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:04:09,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:04:09,247 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:09,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:09,247 INFO L85 PathProgramCache]: Analyzing trace with hash -526559701, now seen corresponding path program 1 times [2025-03-17 00:04:09,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:09,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554015388] [2025-03-17 00:04:09,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:09,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:09,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-17 00:04:09,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-17 00:04:09,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:09,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-17 00:04:10,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:10,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554015388] [2025-03-17 00:04:10,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554015388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:04:10,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:04:10,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:04:10,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130921923] [2025-03-17 00:04:10,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:04:10,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:04:10,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:10,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:04:10,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:04:10,530 INFO L87 Difference]: Start difference. First operand 1375 states and 2247 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-17 00:04:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:10,915 INFO L93 Difference]: Finished difference Result 2749 states and 4493 transitions. [2025-03-17 00:04:10,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:04:10,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 457 [2025-03-17 00:04:10,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:10,927 INFO L225 Difference]: With dead ends: 2749 [2025-03-17 00:04:10,927 INFO L226 Difference]: Without dead ends: 1375 [2025-03-17 00:04:10,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:04:10,932 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 594 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:10,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 354 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:04:10,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-03-17 00:04:11,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1375. [2025-03-17 00:04:11,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1052 states have (on average 1.5389733840304183) internal successors, (1619), 1058 states have internal predecessors, (1619), 306 states have call successors, (306), 16 states have call predecessors, (306), 16 states have return successors, (306), 300 states have call predecessors, (306), 306 states have call successors, (306) [2025-03-17 00:04:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2231 transitions. [2025-03-17 00:04:11,160 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2231 transitions. Word has length 457 [2025-03-17 00:04:11,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:11,161 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 2231 transitions. [2025-03-17 00:04:11,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-17 00:04:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2231 transitions. [2025-03-17 00:04:11,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-17 00:04:11,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:11,169 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:04:11,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:04:11,169 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:11,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:11,169 INFO L85 PathProgramCache]: Analyzing trace with hash 859350554, now seen corresponding path program 1 times [2025-03-17 00:04:11,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:11,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283730624] [2025-03-17 00:04:11,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:11,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:11,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-17 00:04:11,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-17 00:04:11,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:11,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-17 00:04:26,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:26,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283730624] [2025-03-17 00:04:26,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283730624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:04:26,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:04:26,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 00:04:26,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981917097] [2025-03-17 00:04:26,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:04:26,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 00:04:26,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:26,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 00:04:26,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:04:26,260 INFO L87 Difference]: Start difference. First operand 1375 states and 2231 transitions. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 3 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2025-03-17 00:04:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:29,699 INFO L93 Difference]: Finished difference Result 5106 states and 8206 transitions. [2025-03-17 00:04:29,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:04:29,700 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 3 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) Word has length 458 [2025-03-17 00:04:29,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:29,722 INFO L225 Difference]: With dead ends: 5106 [2025-03-17 00:04:29,722 INFO L226 Difference]: Without dead ends: 3732 [2025-03-17 00:04:29,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-03-17 00:04:29,728 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 1953 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 1533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1953 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 2628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1533 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:29,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1953 Valid, 2486 Invalid, 2628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1533 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-17 00:04:29,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3732 states. [2025-03-17 00:04:30,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3732 to 3335. [2025-03-17 00:04:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3335 states, 2503 states have (on average 1.5189772273272073) internal successors, (3802), 2520 states have internal predecessors, (3802), 788 states have call successors, (788), 43 states have call predecessors, (788), 43 states have return successors, (788), 771 states have call predecessors, (788), 788 states have call successors, (788) [2025-03-17 00:04:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 5378 transitions. [2025-03-17 00:04:30,034 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 5378 transitions. Word has length 458 [2025-03-17 00:04:30,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:30,036 INFO L471 AbstractCegarLoop]: Abstraction has 3335 states and 5378 transitions. [2025-03-17 00:04:30,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 3 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2025-03-17 00:04:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 5378 transitions. [2025-03-17 00:04:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-17 00:04:30,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:30,041 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:04:30,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:04:30,042 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:30,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:30,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1324326373, now seen corresponding path program 1 times [2025-03-17 00:04:30,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:30,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344633517] [2025-03-17 00:04:30,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:30,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:30,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-17 00:04:30,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-17 00:04:30,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:30,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-17 00:04:42,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:42,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344633517] [2025-03-17 00:04:42,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344633517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:04:42,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:04:42,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 00:04:42,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000289665] [2025-03-17 00:04:42,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:04:42,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 00:04:42,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:42,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 00:04:42,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:04:42,471 INFO L87 Difference]: Start difference. First operand 3335 states and 5378 transitions. Second operand has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 2 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 2 states have call predecessors, (71), 2 states have call successors, (71) [2025-03-17 00:04:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:51,081 INFO L93 Difference]: Finished difference Result 10772 states and 17206 transitions. [2025-03-17 00:04:51,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 00:04:51,083 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 2 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 2 states have call predecessors, (71), 2 states have call successors, (71) Word has length 458 [2025-03-17 00:04:51,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:51,176 INFO L225 Difference]: With dead ends: 10772 [2025-03-17 00:04:51,177 INFO L226 Difference]: Without dead ends: 8844 [2025-03-17 00:04:51,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2025-03-17 00:04:51,202 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 2473 mSDsluCounter, 2512 mSDsCounter, 0 mSdLazyCounter, 2861 mSolverCounterSat, 907 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2473 SdHoareTripleChecker+Valid, 2970 SdHoareTripleChecker+Invalid, 3768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 907 IncrementalHoareTripleChecker+Valid, 2861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:51,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2473 Valid, 2970 Invalid, 3768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [907 Valid, 2861 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2025-03-17 00:04:51,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8844 states. [2025-03-17 00:04:52,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8844 to 7027. [2025-03-17 00:04:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7027 states, 5448 states have (on average 1.5291850220264318) internal successors, (8331), 5489 states have internal predecessors, (8331), 1479 states have call successors, (1479), 99 states have call predecessors, (1479), 99 states have return successors, (1479), 1438 states have call predecessors, (1479), 1479 states have call successors, (1479) [2025-03-17 00:04:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7027 states to 7027 states and 11289 transitions. [2025-03-17 00:04:52,497 INFO L78 Accepts]: Start accepts. Automaton has 7027 states and 11289 transitions. Word has length 458 [2025-03-17 00:04:52,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:52,501 INFO L471 AbstractCegarLoop]: Abstraction has 7027 states and 11289 transitions. [2025-03-17 00:04:52,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 2 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 2 states have call predecessors, (71), 2 states have call successors, (71) [2025-03-17 00:04:52,507 INFO L276 IsEmpty]: Start isEmpty. Operand 7027 states and 11289 transitions. [2025-03-17 00:04:52,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-17 00:04:52,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:52,529 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:04:52,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:04:52,529 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:52,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:52,530 INFO L85 PathProgramCache]: Analyzing trace with hash 932584634, now seen corresponding path program 1 times [2025-03-17 00:04:52,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:52,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920578664] [2025-03-17 00:04:52,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:52,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:52,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-17 00:04:52,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-17 00:04:52,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:52,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 162 proven. 48 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-03-17 00:04:53,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:53,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920578664] [2025-03-17 00:04:53,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920578664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:04:53,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128564848] [2025-03-17 00:04:53,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:53,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:04:53,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:04:53,563 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:04:53,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 00:04:53,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-17 00:04:53,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-17 00:04:53,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:53,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:53,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 00:04:54,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:04:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 5020 proven. 111 refuted. 0 times theorem prover too weak. 4809 trivial. 0 not checked. [2025-03-17 00:04:54,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:04:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 99 proven. 111 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-03-17 00:04:55,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128564848] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:04:55,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:04:55,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2025-03-17 00:04:55,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50630174] [2025-03-17 00:04:55,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:04:55,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 00:04:55,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:55,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 00:04:55,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:04:55,662 INFO L87 Difference]: Start difference. First operand 7027 states and 11289 transitions. Second operand has 11 states, 11 states have (on average 21.0) internal successors, (231), 11 states have internal predecessors, (231), 4 states have call successors, (145), 2 states have call predecessors, (145), 4 states have return successors, (147), 4 states have call predecessors, (147), 4 states have call successors, (147) [2025-03-17 00:04:58,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:58,835 INFO L93 Difference]: Finished difference Result 20519 states and 32529 transitions. [2025-03-17 00:04:58,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 00:04:58,836 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 21.0) internal successors, (231), 11 states have internal predecessors, (231), 4 states have call successors, (145), 2 states have call predecessors, (145), 4 states have return successors, (147), 4 states have call predecessors, (147), 4 states have call successors, (147) Word has length 458 [2025-03-17 00:04:58,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:58,951 INFO L225 Difference]: With dead ends: 20519 [2025-03-17 00:04:58,951 INFO L226 Difference]: Without dead ends: 13577 [2025-03-17 00:04:58,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 938 GetRequests, 912 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=467, Unknown=0, NotChecked=0, Total=702 [2025-03-17 00:04:58,997 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 1007 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:58,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 896 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 00:04:59,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13577 states. [2025-03-17 00:05:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13577 to 12818. [2025-03-17 00:05:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12818 states, 10026 states have (on average 1.4849391581887093) internal successors, (14888), 10113 states have internal predecessors, (14888), 2555 states have call successors, (2555), 236 states have call predecessors, (2555), 236 states have return successors, (2555), 2468 states have call predecessors, (2555), 2555 states have call successors, (2555) [2025-03-17 00:05:01,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12818 states to 12818 states and 19998 transitions. [2025-03-17 00:05:01,157 INFO L78 Accepts]: Start accepts. Automaton has 12818 states and 19998 transitions. Word has length 458 [2025-03-17 00:05:01,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:05:01,162 INFO L471 AbstractCegarLoop]: Abstraction has 12818 states and 19998 transitions. [2025-03-17 00:05:01,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.0) internal successors, (231), 11 states have internal predecessors, (231), 4 states have call successors, (145), 2 states have call predecessors, (145), 4 states have return successors, (147), 4 states have call predecessors, (147), 4 states have call successors, (147) [2025-03-17 00:05:01,163 INFO L276 IsEmpty]: Start isEmpty. Operand 12818 states and 19998 transitions. [2025-03-17 00:05:01,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-17 00:05:01,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:05:01,195 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:05:01,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 00:05:01,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 00:05:01,397 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:05:01,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:05:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash -768721023, now seen corresponding path program 1 times [2025-03-17 00:05:01,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:05:01,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336689433] [2025-03-17 00:05:01,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:05:01,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:05:01,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-17 00:05:01,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-17 00:05:01,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:05:01,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:05:19,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-17 00:05:19,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:05:19,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336689433] [2025-03-17 00:05:19,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336689433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:05:19,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:05:19,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:05:19,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794919382] [2025-03-17 00:05:19,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:05:19,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:05:19,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:05:19,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:05:19,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:05:19,773 INFO L87 Difference]: Start difference. First operand 12818 states and 19998 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 2 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 2 states have call predecessors, (71), 2 states have call successors, (71) [2025-03-17 00:05:27,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:05:27,166 INFO L93 Difference]: Finished difference Result 22834 states and 35500 transitions. [2025-03-17 00:05:27,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:05:27,166 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 2 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 2 states have call predecessors, (71), 2 states have call successors, (71) Word has length 461 [2025-03-17 00:05:27,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:05:27,304 INFO L225 Difference]: With dead ends: 22834 [2025-03-17 00:05:27,307 INFO L226 Difference]: Without dead ends: 14670 [2025-03-17 00:05:27,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:05:27,361 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 1340 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 666 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 2049 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 666 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:05:27,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 2049 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [666 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-17 00:05:27,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14670 states. [2025-03-17 00:05:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14670 to 13607. [2025-03-17 00:05:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13607 states, 10651 states have (on average 1.480142709604732) internal successors, (15765), 10744 states have internal predecessors, (15765), 2702 states have call successors, (2702), 253 states have call predecessors, (2702), 253 states have return successors, (2702), 2609 states have call predecessors, (2702), 2702 states have call successors, (2702) [2025-03-17 00:05:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13607 states to 13607 states and 21169 transitions. [2025-03-17 00:05:29,700 INFO L78 Accepts]: Start accepts. Automaton has 13607 states and 21169 transitions. Word has length 461 [2025-03-17 00:05:29,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:05:29,704 INFO L471 AbstractCegarLoop]: Abstraction has 13607 states and 21169 transitions. [2025-03-17 00:05:29,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 2 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 2 states have call predecessors, (71), 2 states have call successors, (71) [2025-03-17 00:05:29,705 INFO L276 IsEmpty]: Start isEmpty. Operand 13607 states and 21169 transitions. [2025-03-17 00:05:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-17 00:05:29,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:05:29,730 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:05:29,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 00:05:29,734 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:05:29,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:05:29,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1449036930, now seen corresponding path program 1 times [2025-03-17 00:05:29,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:05:29,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696179292] [2025-03-17 00:05:29,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:05:29,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:05:29,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-17 00:05:29,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-17 00:05:29,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:05:29,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:05:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-17 00:05:30,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:05:30,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696179292] [2025-03-17 00:05:30,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696179292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:05:30,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:05:30,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:05:30,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218748308] [2025-03-17 00:05:30,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:05:30,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:05:30,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:05:30,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:05:30,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:05:30,336 INFO L87 Difference]: Start difference. First operand 13607 states and 21169 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71)