./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-58.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 282ae36df5695e27b909a2bf93e33671def0076fbd602d7ca03e88eb2683530d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:24:23,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:24:23,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:24:23,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:24:23,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:24:23,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:24:23,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:24:23,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:24:23,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:24:23,778 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:24:23,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:24:23,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:24:23,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:24:23,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:24:23,779 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:24:23,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:24:23,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:24:23,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:24:23,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:24:23,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:24:23,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:24:23,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:24:23,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:24:23,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:24:23,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:24:23,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:24:23,781 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:24:23,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:24:23,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:24:23,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:24:23,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:24:23,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:24:23,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:24:23,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:24:23,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:24:23,782 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:24:23,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:24:23,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:24:23,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:24:23,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:24:23,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:24:23,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:24:23,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:24:23,782 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 -> 282ae36df5695e27b909a2bf93e33671def0076fbd602d7ca03e88eb2683530d [2025-03-08 15:24:24,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:24:24,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:24:24,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:24:24,016 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:24:24,017 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:24:24,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-58.i [2025-03-08 15:24:25,089 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a9d6ce6f/5f77564a8df04dea99bc88bee1bd3012/FLAG719fa4e17 [2025-03-08 15:24:25,312 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:24:25,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-58.i [2025-03-08 15:24:25,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a9d6ce6f/5f77564a8df04dea99bc88bee1bd3012/FLAG719fa4e17 [2025-03-08 15:24:25,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a9d6ce6f/5f77564a8df04dea99bc88bee1bd3012 [2025-03-08 15:24:25,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:24:25,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:24:25,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:24:25,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:24:25,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:24:25,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:24:25" (1/1) ... [2025-03-08 15:24:25,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:25, skipping insertion in model container [2025-03-08 15:24:25,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:24:25" (1/1) ... [2025-03-08 15:24:25,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:24:25,779 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-58.i[916,929] [2025-03-08 15:24:25,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:24:25,935 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:24:25,942 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-58.i[916,929] [2025-03-08 15:24:26,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:24:26,017 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:24:26,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:26 WrapperNode [2025-03-08 15:24:26,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:24:26,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:24:26,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:24:26,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:24:26,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:26" (1/1) ... [2025-03-08 15:24:26,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:26" (1/1) ... [2025-03-08 15:24:26,108 INFO L138 Inliner]: procedures = 26, calls = 77, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 449 [2025-03-08 15:24:26,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:24:26,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:24:26,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:24:26,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:24:26,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:26" (1/1) ... [2025-03-08 15:24:26,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:26" (1/1) ... [2025-03-08 15:24:26,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:26" (1/1) ... [2025-03-08 15:24:26,204 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:24:26,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:26" (1/1) ... [2025-03-08 15:24:26,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:26" (1/1) ... [2025-03-08 15:24:26,225 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:26" (1/1) ... [2025-03-08 15:24:26,228 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:26" (1/1) ... [2025-03-08 15:24:26,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:26" (1/1) ... [2025-03-08 15:24:26,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:26" (1/1) ... [2025-03-08 15:24:26,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:24:26,260 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:24:26,261 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:24:26,261 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:24:26,262 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:26" (1/1) ... [2025-03-08 15:24:26,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:24:26,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:26,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:24:26,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:24:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:24:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:24:26,307 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:24:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:24:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:24:26,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:24:26,397 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:24:26,399 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:24:27,010 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L402: havoc property_#t~bitwise42#1;havoc property_#t~short43#1;havoc property_#t~bitwise44#1;havoc property_#t~short45#1; [2025-03-08 15:24:27,094 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-08 15:24:27,094 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:24:27,113 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:24:27,114 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:24:27,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:24:27 BoogieIcfgContainer [2025-03-08 15:24:27,114 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:24:27,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:24:27,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:24:27,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:24:27,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:24:25" (1/3) ... [2025-03-08 15:24:27,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e810e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:24:27, skipping insertion in model container [2025-03-08 15:24:27,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:26" (2/3) ... [2025-03-08 15:24:27,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e810e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:24:27, skipping insertion in model container [2025-03-08 15:24:27,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:24:27" (3/3) ... [2025-03-08 15:24:27,125 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-58.i [2025-03-08 15:24:27,136 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:24:27,139 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-58.i that has 2 procedures, 187 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:24:27,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:24:27,197 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;@16d6164f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:24:27,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:24:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 120 states have (on average 1.4583333333333333) internal successors, (175), 121 states have internal predecessors, (175), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 15:24:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-03-08 15:24:27,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:27,224 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:27,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:27,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:27,229 INFO L85 PathProgramCache]: Analyzing trace with hash 625853053, now seen corresponding path program 1 times [2025-03-08 15:24:27,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:27,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713275162] [2025-03-08 15:24:27,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:27,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:27,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-08 15:24:27,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-08 15:24:27,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:27,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2025-03-08 15:24:27,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:27,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713275162] [2025-03-08 15:24:27,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713275162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:24:27,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347362348] [2025-03-08 15:24:27,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:27,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:27,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:27,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:24:27,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:24:27,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-08 15:24:27,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-08 15:24:27,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:27,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:27,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:24:27,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:24:28,029 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2025-03-08 15:24:28,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:24:28,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347362348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:28,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:24:28,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:24:28,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462044315] [2025-03-08 15:24:28,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:28,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:24:28,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:28,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:24:28,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:24:28,059 INFO L87 Difference]: Start difference. First operand has 187 states, 120 states have (on average 1.4583333333333333) internal successors, (175), 121 states have internal predecessors, (175), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) Second operand has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (64), 2 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) [2025-03-08 15:24:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:28,098 INFO L93 Difference]: Finished difference Result 368 states and 665 transitions. [2025-03-08 15:24:28,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:24:28,100 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (64), 2 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) Word has length 402 [2025-03-08 15:24:28,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:28,107 INFO L225 Difference]: With dead ends: 368 [2025-03-08 15:24:28,109 INFO L226 Difference]: Without dead ends: 184 [2025-03-08 15:24:28,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:24:28,117 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:28,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:24:28,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-08 15:24:28,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-03-08 15:24:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 118 states have (on average 1.4406779661016949) internal successors, (170), 118 states have internal predecessors, (170), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 15:24:28,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 298 transitions. [2025-03-08 15:24:28,175 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 298 transitions. Word has length 402 [2025-03-08 15:24:28,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:28,176 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 298 transitions. [2025-03-08 15:24:28,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (64), 2 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) [2025-03-08 15:24:28,177 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 298 transitions. [2025-03-08 15:24:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-03-08 15:24:28,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:28,186 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:28,195 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-08 15:24:28,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:24:28,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:28,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:28,390 INFO L85 PathProgramCache]: Analyzing trace with hash 392710119, now seen corresponding path program 1 times [2025-03-08 15:24:28,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:28,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539748654] [2025-03-08 15:24:28,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:28,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:28,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-08 15:24:28,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-08 15:24:28,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:28,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-08 15:24:28,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:28,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539748654] [2025-03-08 15:24:28,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539748654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:28,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:28,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:24:28,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885898987] [2025-03-08 15:24:28,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:28,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:24:28,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:28,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:24:28,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:24:28,754 INFO L87 Difference]: Start difference. First operand 184 states and 298 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-08 15:24:28,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:28,858 INFO L93 Difference]: Finished difference Result 425 states and 689 transitions. [2025-03-08 15:24:28,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:24:28,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 402 [2025-03-08 15:24:28,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:28,867 INFO L225 Difference]: With dead ends: 425 [2025-03-08 15:24:28,867 INFO L226 Difference]: Without dead ends: 244 [2025-03-08 15:24:28,868 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-08 15:24:28,868 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 102 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:28,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 546 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:24:28,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-08 15:24:28,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 197. [2025-03-08 15:24:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 131 states have (on average 1.450381679389313) internal successors, (190), 131 states have internal predecessors, (190), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 15:24:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 318 transitions. [2025-03-08 15:24:28,897 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 318 transitions. Word has length 402 [2025-03-08 15:24:28,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:28,898 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 318 transitions. [2025-03-08 15:24:28,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-08 15:24:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 318 transitions. [2025-03-08 15:24:28,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-03-08 15:24:28,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:28,903 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:28,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:24:28,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:28,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:28,904 INFO L85 PathProgramCache]: Analyzing trace with hash -788768501, now seen corresponding path program 1 times [2025-03-08 15:24:28,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:28,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315148234] [2025-03-08 15:24:28,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:28,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:28,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-08 15:24:28,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-08 15:24:28,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:28,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:29,208 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-08 15:24:29,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:29,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315148234] [2025-03-08 15:24:29,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315148234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:29,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:29,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:24:29,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535413274] [2025-03-08 15:24:29,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:29,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:24:29,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:29,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:24:29,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:24:29,212 INFO L87 Difference]: Start difference. First operand 197 states and 318 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-08 15:24:29,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:29,302 INFO L93 Difference]: Finished difference Result 582 states and 942 transitions. [2025-03-08 15:24:29,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:24:29,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 402 [2025-03-08 15:24:29,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:29,308 INFO L225 Difference]: With dead ends: 582 [2025-03-08 15:24:29,308 INFO L226 Difference]: Without dead ends: 388 [2025-03-08 15:24:29,309 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-08 15:24:29,310 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 279 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:29,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 581 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:24:29,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-08 15:24:29,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2025-03-08 15:24:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 255 states have (on average 1.4352941176470588) internal successors, (366), 255 states have internal predecessors, (366), 128 states have call successors, (128), 2 states have call predecessors, (128), 2 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-08 15:24:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 622 transitions. [2025-03-08 15:24:29,355 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 622 transitions. Word has length 402 [2025-03-08 15:24:29,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:29,357 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 622 transitions. [2025-03-08 15:24:29,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-08 15:24:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 622 transitions. [2025-03-08 15:24:29,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-08 15:24:29,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:29,364 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:29,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:24:29,364 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:29,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:29,365 INFO L85 PathProgramCache]: Analyzing trace with hash 997192620, now seen corresponding path program 1 times [2025-03-08 15:24:29,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:29,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593905150] [2025-03-08 15:24:29,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:29,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:29,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-08 15:24:29,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-08 15:24:29,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:29,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-08 15:24:29,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:29,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593905150] [2025-03-08 15:24:29,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593905150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:29,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:29,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:24:29,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116859189] [2025-03-08 15:24:29,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:29,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:24:29,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:29,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:24:29,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:24:29,960 INFO L87 Difference]: Start difference. First operand 386 states and 622 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-08 15:24:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:30,319 INFO L93 Difference]: Finished difference Result 1020 states and 1631 transitions. [2025-03-08 15:24:30,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:24:30,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 403 [2025-03-08 15:24:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:30,324 INFO L225 Difference]: With dead ends: 1020 [2025-03-08 15:24:30,325 INFO L226 Difference]: Without dead ends: 637 [2025-03-08 15:24:30,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:24:30,327 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 248 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:30,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 863 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:24:30,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-08 15:24:30,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 558. [2025-03-08 15:24:30,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 362 states have (on average 1.4005524861878453) internal successors, (507), 362 states have internal predecessors, (507), 192 states have call successors, (192), 3 states have call predecessors, (192), 3 states have return successors, (192), 192 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-08 15:24:30,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 891 transitions. [2025-03-08 15:24:30,384 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 891 transitions. Word has length 403 [2025-03-08 15:24:30,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:30,386 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 891 transitions. [2025-03-08 15:24:30,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-08 15:24:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 891 transitions. [2025-03-08 15:24:30,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-03-08 15:24:30,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:30,392 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:30,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:24:30,392 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:30,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:30,393 INFO L85 PathProgramCache]: Analyzing trace with hash 480042642, now seen corresponding path program 1 times [2025-03-08 15:24:30,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:30,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413424164] [2025-03-08 15:24:30,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:30,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:30,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-08 15:24:30,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-08 15:24:30,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:30,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-08 15:24:31,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:31,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413424164] [2025-03-08 15:24:31,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413424164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:31,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:31,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:24:31,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433483925] [2025-03-08 15:24:31,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:31,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:24:31,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:31,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:24:31,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:24:31,297 INFO L87 Difference]: Start difference. First operand 558 states and 891 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-08 15:24:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:31,845 INFO L93 Difference]: Finished difference Result 1363 states and 2162 transitions. [2025-03-08 15:24:31,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:24:31,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 406 [2025-03-08 15:24:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:31,852 INFO L225 Difference]: With dead ends: 1363 [2025-03-08 15:24:31,852 INFO L226 Difference]: Without dead ends: 808 [2025-03-08 15:24:31,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:24:31,855 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 148 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:31,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 948 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:24:31,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-03-08 15:24:31,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 685. [2025-03-08 15:24:31,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 424 states have (on average 1.3679245283018868) internal successors, (580), 424 states have internal predecessors, (580), 256 states have call successors, (256), 4 states have call predecessors, (256), 4 states have return successors, (256), 256 states have call predecessors, (256), 256 states have call successors, (256) [2025-03-08 15:24:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1092 transitions. [2025-03-08 15:24:31,939 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1092 transitions. Word has length 406 [2025-03-08 15:24:31,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:31,940 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1092 transitions. [2025-03-08 15:24:31,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-08 15:24:31,941 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1092 transitions. [2025-03-08 15:24:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-03-08 15:24:31,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:31,945 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:31,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:24:31,946 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:31,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1530061199, now seen corresponding path program 1 times [2025-03-08 15:24:31,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:31,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139055229] [2025-03-08 15:24:31,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:31,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:31,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-08 15:24:32,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-08 15:24:32,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:32,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-08 15:24:36,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:36,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139055229] [2025-03-08 15:24:36,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139055229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:36,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:36,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:24:36,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528060777] [2025-03-08 15:24:36,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:36,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:24:36,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:36,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:24:36,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:24:36,640 INFO L87 Difference]: Start difference. First operand 685 states and 1092 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-08 15:24:39,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:39,804 INFO L93 Difference]: Finished difference Result 1377 states and 2156 transitions. [2025-03-08 15:24:39,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 15:24:39,805 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 406 [2025-03-08 15:24:39,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:39,812 INFO L225 Difference]: With dead ends: 1377 [2025-03-08 15:24:39,812 INFO L226 Difference]: Without dead ends: 994 [2025-03-08 15:24:39,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:24:39,814 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 807 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:39,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1292 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 15:24:39,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-03-08 15:24:39,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 751. [2025-03-08 15:24:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 488 states have (on average 1.389344262295082) internal successors, (678), 488 states have internal predecessors, (678), 256 states have call successors, (256), 6 states have call predecessors, (256), 6 states have return successors, (256), 256 states have call predecessors, (256), 256 states have call successors, (256) [2025-03-08 15:24:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1190 transitions. [2025-03-08 15:24:39,894 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1190 transitions. Word has length 406 [2025-03-08 15:24:39,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:39,894 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1190 transitions. [2025-03-08 15:24:39,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-08 15:24:39,895 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1190 transitions. [2025-03-08 15:24:39,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-03-08 15:24:39,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:39,900 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:39,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:24:39,900 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:39,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:39,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2035619824, now seen corresponding path program 1 times [2025-03-08 15:24:39,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:39,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843568076] [2025-03-08 15:24:39,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:39,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:39,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-08 15:24:40,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-08 15:24:40,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:40,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 6 proven. 183 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-08 15:24:40,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:40,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843568076] [2025-03-08 15:24:40,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843568076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:24:40,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848528916] [2025-03-08 15:24:40,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:40,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:40,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:40,629 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:24:40,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:24:40,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-08 15:24:40,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-08 15:24:40,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:40,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:40,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 15:24:40,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:24:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 555 proven. 183 refuted. 0 times theorem prover too weak. 7326 trivial. 0 not checked. [2025-03-08 15:24:42,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:24:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 6 proven. 183 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-08 15:24:42,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848528916] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:24:42,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:24:42,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2025-03-08 15:24:42,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329763382] [2025-03-08 15:24:42,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:24:42,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 15:24:42,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:42,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 15:24:42,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:24:42,761 INFO L87 Difference]: Start difference. First operand 751 states and 1190 transitions. Second operand has 12 states, 12 states have (on average 14.5) internal successors, (174), 12 states have internal predecessors, (174), 4 states have call successors, (192), 3 states have call predecessors, (192), 6 states have return successors, (192), 4 states have call predecessors, (192), 4 states have call successors, (192) [2025-03-08 15:24:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:44,791 INFO L93 Difference]: Finished difference Result 3575 states and 5675 transitions. [2025-03-08 15:24:44,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 15:24:44,792 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.5) internal successors, (174), 12 states have internal predecessors, (174), 4 states have call successors, (192), 3 states have call predecessors, (192), 6 states have return successors, (192), 4 states have call predecessors, (192), 4 states have call successors, (192) Word has length 406 [2025-03-08 15:24:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:44,811 INFO L225 Difference]: With dead ends: 3575 [2025-03-08 15:24:44,811 INFO L226 Difference]: Without dead ends: 3014 [2025-03-08 15:24:44,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 808 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-03-08 15:24:44,816 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 1029 mSDsluCounter, 2197 mSDsCounter, 0 mSdLazyCounter, 2620 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 2655 SdHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 2620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:44,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 2655 Invalid, 2917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 2620 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 15:24:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2025-03-08 15:24:45,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 1699. [2025-03-08 15:24:45,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1101 states have (on average 1.3905540417801998) internal successors, (1531), 1103 states have internal predecessors, (1531), 580 states have call successors, (580), 17 states have call predecessors, (580), 17 states have return successors, (580), 578 states have call predecessors, (580), 580 states have call successors, (580) [2025-03-08 15:24:45,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2691 transitions. [2025-03-08 15:24:45,026 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2691 transitions. Word has length 406 [2025-03-08 15:24:45,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:45,027 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 2691 transitions. [2025-03-08 15:24:45,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.5) internal successors, (174), 12 states have internal predecessors, (174), 4 states have call successors, (192), 3 states have call predecessors, (192), 6 states have return successors, (192), 4 states have call predecessors, (192), 4 states have call successors, (192) [2025-03-08 15:24:45,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2691 transitions. [2025-03-08 15:24:45,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-08 15:24:45,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:45,031 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:45,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:24:45,233 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,SelfDestructingSolverStorable6 [2025-03-08 15:24:45,233 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:45,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:45,234 INFO L85 PathProgramCache]: Analyzing trace with hash 559589734, now seen corresponding path program 1 times [2025-03-08 15:24:45,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:45,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459013936] [2025-03-08 15:24:45,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:45,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:45,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-08 15:24:45,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-08 15:24:45,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:45,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-08 15:24:46,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:46,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459013936] [2025-03-08 15:24:46,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459013936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:46,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:46,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:24:46,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483426165] [2025-03-08 15:24:46,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:46,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:24:46,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:46,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:24:46,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:24:46,909 INFO L87 Difference]: Start difference. First operand 1699 states and 2691 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-08 15:24:47,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:47,880 INFO L93 Difference]: Finished difference Result 3724 states and 5769 transitions. [2025-03-08 15:24:47,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:24:47,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 407 [2025-03-08 15:24:47,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:47,896 INFO L225 Difference]: With dead ends: 3724 [2025-03-08 15:24:47,897 INFO L226 Difference]: Without dead ends: 2560 [2025-03-08 15:24:47,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:24:47,901 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 466 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:47,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1366 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 15:24:47,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2025-03-08 15:24:48,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 1740. [2025-03-08 15:24:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1142 states have (on average 1.394045534150613) internal successors, (1592), 1144 states have internal predecessors, (1592), 580 states have call successors, (580), 17 states have call predecessors, (580), 17 states have return successors, (580), 578 states have call predecessors, (580), 580 states have call successors, (580) [2025-03-08 15:24:48,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2752 transitions. [2025-03-08 15:24:48,038 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2752 transitions. Word has length 407 [2025-03-08 15:24:48,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:48,039 INFO L471 AbstractCegarLoop]: Abstraction has 1740 states and 2752 transitions. [2025-03-08 15:24:48,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-08 15:24:48,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2752 transitions. [2025-03-08 15:24:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-08 15:24:48,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:48,042 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:48,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:24:48,042 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:48,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:48,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2067141543, now seen corresponding path program 1 times [2025-03-08 15:24:48,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:48,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980933366] [2025-03-08 15:24:48,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:48,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:48,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-08 15:24:48,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-08 15:24:48,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:48,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 6 proven. 183 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-08 15:24:48,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:48,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980933366] [2025-03-08 15:24:48,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980933366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:24:48,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045590802] [2025-03-08 15:24:48,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:48,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:48,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:48,532 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:24:48,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:24:48,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-08 15:24:48,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-08 15:24:48,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:48,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:48,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 15:24:48,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:24:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 555 proven. 183 refuted. 0 times theorem prover too weak. 7326 trivial. 0 not checked. [2025-03-08 15:24:49,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:24:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 6 proven. 183 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-08 15:24:49,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045590802] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:24:49,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:24:49,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-08 15:24:49,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662607996] [2025-03-08 15:24:49,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:24:49,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:24:49,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:49,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:24:49,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:24:49,600 INFO L87 Difference]: Start difference. First operand 1740 states and 2752 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 2 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (126), 2 states have call predecessors, (126), 2 states have call successors, (126) [2025-03-08 15:24:50,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:50,191 INFO L93 Difference]: Finished difference Result 2991 states and 4676 transitions. [2025-03-08 15:24:50,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 15:24:50,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 2 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (126), 2 states have call predecessors, (126), 2 states have call successors, (126) Word has length 407 [2025-03-08 15:24:50,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:50,202 INFO L225 Difference]: With dead ends: 2991 [2025-03-08 15:24:50,203 INFO L226 Difference]: Without dead ends: 1821 [2025-03-08 15:24:50,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 811 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2025-03-08 15:24:50,207 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 316 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:50,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 815 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:24:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2025-03-08 15:24:50,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1670. [2025-03-08 15:24:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1068 states have (on average 1.3773408239700375) internal successors, (1471), 1068 states have internal predecessors, (1471), 576 states have call successors, (576), 25 states have call predecessors, (576), 25 states have return successors, (576), 576 states have call predecessors, (576), 576 states have call successors, (576) [2025-03-08 15:24:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2623 transitions. [2025-03-08 15:24:50,367 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2623 transitions. Word has length 407 [2025-03-08 15:24:50,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:50,367 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2623 transitions. [2025-03-08 15:24:50,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 2 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (126), 2 states have call predecessors, (126), 2 states have call successors, (126) [2025-03-08 15:24:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2623 transitions. [2025-03-08 15:24:50,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-08 15:24:50,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:50,370 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:50,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 15:24:50,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:50,570 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:50,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:50,571 INFO L85 PathProgramCache]: Analyzing trace with hash 770940647, now seen corresponding path program 1 times [2025-03-08 15:24:50,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:50,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29508771] [2025-03-08 15:24:50,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:50,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:50,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-08 15:24:50,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-08 15:24:50,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:50,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 162 proven. 27 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-08 15:24:51,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:51,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29508771] [2025-03-08 15:24:51,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29508771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:24:51,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363585506] [2025-03-08 15:24:51,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:51,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:51,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:51,722 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:24:51,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 15:24:51,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-08 15:24:51,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-08 15:24:51,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:51,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:51,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 15:24:51,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:24:52,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 1788 proven. 30 refuted. 0 times theorem prover too weak. 6246 trivial. 0 not checked. [2025-03-08 15:24:52,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:24:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 342 proven. 33 refuted. 0 times theorem prover too weak. 7689 trivial. 0 not checked. [2025-03-08 15:24:53,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363585506] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:24:53,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:24:53,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 29 [2025-03-08 15:24:53,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234666784] [2025-03-08 15:24:53,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:24:53,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 15:24:53,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:53,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 15:24:53,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2025-03-08 15:24:53,112 INFO L87 Difference]: Start difference. First operand 1670 states and 2623 transitions. Second operand has 29 states, 29 states have (on average 8.172413793103448) internal successors, (237), 29 states have internal predecessors, (237), 9 states have call successors, (192), 4 states have call predecessors, (192), 9 states have return successors, (192), 9 states have call predecessors, (192), 9 states have call successors, (192) [2025-03-08 15:25:00,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:00,331 INFO L93 Difference]: Finished difference Result 6213 states and 9480 transitions. [2025-03-08 15:25:00,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-03-08 15:25:00,334 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.172413793103448) internal successors, (237), 29 states have internal predecessors, (237), 9 states have call successors, (192), 4 states have call predecessors, (192), 9 states have return successors, (192), 9 states have call predecessors, (192), 9 states have call successors, (192) Word has length 407 [2025-03-08 15:25:00,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:00,355 INFO L225 Difference]: With dead ends: 6213 [2025-03-08 15:25:00,355 INFO L226 Difference]: Without dead ends: 4692 [2025-03-08 15:25:00,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 935 GetRequests, 808 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5833 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2426, Invalid=13830, Unknown=0, NotChecked=0, Total=16256 [2025-03-08 15:25:00,363 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 6220 mSDsluCounter, 5069 mSDsCounter, 0 mSdLazyCounter, 4663 mSolverCounterSat, 5120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6277 SdHoareTripleChecker+Valid, 5529 SdHoareTripleChecker+Invalid, 9783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5120 IncrementalHoareTripleChecker+Valid, 4663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:00,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6277 Valid, 5529 Invalid, 9783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5120 Valid, 4663 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-08 15:25:00,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4692 states. [2025-03-08 15:25:00,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4692 to 2238. [2025-03-08 15:25:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2238 states, 1434 states have (on average 1.3179916317991631) internal successors, (1890), 1441 states have internal predecessors, (1890), 750 states have call successors, (750), 53 states have call predecessors, (750), 53 states have return successors, (750), 743 states have call predecessors, (750), 750 states have call successors, (750) [2025-03-08 15:25:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 3390 transitions. [2025-03-08 15:25:00,700 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 3390 transitions. Word has length 407 [2025-03-08 15:25:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:00,701 INFO L471 AbstractCegarLoop]: Abstraction has 2238 states and 3390 transitions. [2025-03-08 15:25:00,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.172413793103448) internal successors, (237), 29 states have internal predecessors, (237), 9 states have call successors, (192), 4 states have call predecessors, (192), 9 states have return successors, (192), 9 states have call predecessors, (192), 9 states have call successors, (192) [2025-03-08 15:25:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 3390 transitions. [2025-03-08 15:25:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-08 15:25:00,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:00,704 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:00,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 15:25:00,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:25:00,905 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:00,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:00,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1688979567, now seen corresponding path program 1 times [2025-03-08 15:25:00,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:00,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495592208] [2025-03-08 15:25:00,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:00,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:00,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-08 15:25:01,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-08 15:25:01,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:01,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat