./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-59.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 55ef89218ca5703ca4bd9b4f4c9cb048907ae080294c44af1e1fe0026c4ad918 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:40:43,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:40:43,897 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:40:43,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:40:43,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:40:43,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:40:43,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:40:43,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:40:43,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:40:43,917 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:40:43,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:40:43,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:40:43,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:40:43,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:40:43,917 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:40:43,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:40:43,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:40:43,918 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:40:43,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:40:43,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:40:43,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:40:43,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:40:43,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:40:43,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:40:43,918 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:40:43,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:40:43,918 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:40:43,918 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:40:43,918 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:40:43,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:40:43,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:40:43,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:40:43,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:40:43,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:40:43,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:40:43,918 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:40:43,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:40:43,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:40:43,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:40:43,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:40:43,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:40:43,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:40:43,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:40:43,919 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 -> 55ef89218ca5703ca4bd9b4f4c9cb048907ae080294c44af1e1fe0026c4ad918 [2025-03-03 21:40:44,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:40:44,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:40:44,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:40:44,171 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:40:44,172 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:40:44,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-59.i [2025-03-03 21:40:45,308 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f0c7165/74739a3ae1b8421e9c4e3294d94e475e/FLAG8c14ed065 [2025-03-03 21:40:45,563 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:40:45,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-59.i [2025-03-03 21:40:45,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f0c7165/74739a3ae1b8421e9c4e3294d94e475e/FLAG8c14ed065 [2025-03-03 21:40:45,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f0c7165/74739a3ae1b8421e9c4e3294d94e475e [2025-03-03 21:40:45,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:40:45,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:40:45,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:40:45,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:40:45,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:40:45,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:40:45" (1/1) ... [2025-03-03 21:40:45,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb92a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:45, skipping insertion in model container [2025-03-03 21:40:45,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:40:45" (1/1) ... [2025-03-03 21:40:45,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:40:46,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-59.i[919,932] [2025-03-03 21:40:46,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:40:46,104 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:40:46,114 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-59.i[919,932] [2025-03-03 21:40:46,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:40:46,163 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:40:46,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:46 WrapperNode [2025-03-03 21:40:46,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:40:46,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:40:46,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:40:46,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:40:46,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:46" (1/1) ... [2025-03-03 21:40:46,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:46" (1/1) ... [2025-03-03 21:40:46,197 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2025-03-03 21:40:46,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:40:46,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:40:46,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:40:46,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:40:46,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:46" (1/1) ... [2025-03-03 21:40:46,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:46" (1/1) ... [2025-03-03 21:40:46,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:46" (1/1) ... [2025-03-03 21:40:46,227 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-03 21:40:46,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:46" (1/1) ... [2025-03-03 21:40:46,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:46" (1/1) ... [2025-03-03 21:40:46,234 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:46" (1/1) ... [2025-03-03 21:40:46,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:46" (1/1) ... [2025-03-03 21:40:46,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:46" (1/1) ... [2025-03-03 21:40:46,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:46" (1/1) ... [2025-03-03 21:40:46,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:40:46,246 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:40:46,246 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:40:46,246 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:40:46,247 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:46" (1/1) ... [2025-03-03 21:40:46,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:40:46,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:40:46,271 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-03 21:40:46,275 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-03 21:40:46,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:40:46,289 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:40:46,289 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:40:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:40:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:40:46,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:40:46,349 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:40:46,350 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:40:46,652 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 21:40:46,652 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:40:46,667 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:40:46,668 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:40:46,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:40:46 BoogieIcfgContainer [2025-03-03 21:40:46,669 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:40:46,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:40:46,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:40:46,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:40:46,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:40:45" (1/3) ... [2025-03-03 21:40:46,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb4c2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:40:46, skipping insertion in model container [2025-03-03 21:40:46,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:46" (2/3) ... [2025-03-03 21:40:46,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb4c2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:40:46, skipping insertion in model container [2025-03-03 21:40:46,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:40:46" (3/3) ... [2025-03-03 21:40:46,677 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-59.i [2025-03-03 21:40:46,687 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:40:46,690 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-59.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:40:46,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:40:46,740 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;@1bcc94d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:40:46,740 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:40:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 59 states have internal predecessors, (88), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 21:40:46,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 21:40:46,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:40:46,753 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:40:46,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:40:46,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:40:46,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1801900593, now seen corresponding path program 1 times [2025-03-03 21:40:46,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:40:46,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563012216] [2025-03-03 21:40:46,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:40:46,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:40:46,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:40:46,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:40:46,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:40:46,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:40:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 21:40:47,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:40:47,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563012216] [2025-03-03 21:40:47,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563012216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:40:47,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127464463] [2025-03-03 21:40:47,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:40:47,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:40:47,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:40:47,034 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-03 21:40:47,036 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-03 21:40:47,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:40:47,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:40:47,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:40:47,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:40:47,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:40:47,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:40:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 21:40:47,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:40:47,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127464463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:40:47,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:40:47,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:40:47,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801957202] [2025-03-03 21:40:47,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:40:47,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:40:47,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:40:47,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:40:47,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:40:47,220 INFO L87 Difference]: Start difference. First operand has 81 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 59 states have internal predecessors, (88), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 21:40:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:40:47,250 INFO L93 Difference]: Finished difference Result 153 states and 265 transitions. [2025-03-03 21:40:47,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:40:47,252 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 137 [2025-03-03 21:40:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:40:47,257 INFO L225 Difference]: With dead ends: 153 [2025-03-03 21:40:47,258 INFO L226 Difference]: Without dead ends: 75 [2025-03-03 21:40:47,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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-03 21:40:47,264 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:40:47,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:40:47,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-03 21:40:47,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-03 21:40:47,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 21:40:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 114 transitions. [2025-03-03 21:40:47,305 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 114 transitions. Word has length 137 [2025-03-03 21:40:47,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:40:47,306 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 114 transitions. [2025-03-03 21:40:47,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 21:40:47,307 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 114 transitions. [2025-03-03 21:40:47,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 21:40:47,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:40:47,310 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:40:47,316 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-03 21:40:47,514 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-03 21:40:47,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:40:47,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:40:47,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1919798731, now seen corresponding path program 1 times [2025-03-03 21:40:47,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:40:47,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220687660] [2025-03-03 21:40:47,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:40:47,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:40:47,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:40:47,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:40:47,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:40:47,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:40:47,783 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:40:47,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:40:47,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220687660] [2025-03-03 21:40:47,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220687660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:40:47,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:40:47,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:40:47,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859649456] [2025-03-03 21:40:47,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:40:47,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:40:47,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:40:47,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:40:47,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:40:47,787 INFO L87 Difference]: Start difference. First operand 75 states and 114 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:40:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:40:47,823 INFO L93 Difference]: Finished difference Result 147 states and 225 transitions. [2025-03-03 21:40:47,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:40:47,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2025-03-03 21:40:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:40:47,826 INFO L225 Difference]: With dead ends: 147 [2025-03-03 21:40:47,826 INFO L226 Difference]: Without dead ends: 75 [2025-03-03 21:40:47,827 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-03 21:40:47,827 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:40:47,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:40:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-03 21:40:47,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-03 21:40:47,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 21:40:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2025-03-03 21:40:47,834 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 137 [2025-03-03 21:40:47,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:40:47,836 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2025-03-03 21:40:47,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:40:47,837 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2025-03-03 21:40:47,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 21:40:47,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:40:47,840 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:40:47,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:40:47,840 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:40:47,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:40:47,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1409264554, now seen corresponding path program 1 times [2025-03-03 21:40:47,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:40:47,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348947829] [2025-03-03 21:40:47,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:40:47,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:40:47,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:40:47,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:40:47,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:40:47,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:40:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:40:48,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:40:48,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348947829] [2025-03-03 21:40:48,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348947829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:40:48,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:40:48,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:40:48,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487500757] [2025-03-03 21:40:48,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:40:48,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:40:48,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:40:48,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:40:48,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:40:48,144 INFO L87 Difference]: Start difference. First operand 75 states and 113 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:40:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:40:48,256 INFO L93 Difference]: Finished difference Result 220 states and 334 transitions. [2025-03-03 21:40:48,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:40:48,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2025-03-03 21:40:48,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:40:48,259 INFO L225 Difference]: With dead ends: 220 [2025-03-03 21:40:48,259 INFO L226 Difference]: Without dead ends: 148 [2025-03-03 21:40:48,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:40:48,260 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 95 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:40:48,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 317 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:40:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-03 21:40:48,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 129. [2025-03-03 21:40:48,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 21:40:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 195 transitions. [2025-03-03 21:40:48,280 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 195 transitions. Word has length 137 [2025-03-03 21:40:48,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:40:48,281 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 195 transitions. [2025-03-03 21:40:48,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:40:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 195 transitions. [2025-03-03 21:40:48,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 21:40:48,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:40:48,282 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:40:48,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:40:48,282 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:40:48,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:40:48,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1817925403, now seen corresponding path program 1 times [2025-03-03 21:40:48,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:40:48,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392974348] [2025-03-03 21:40:48,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:40:48,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:40:48,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 21:40:48,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 21:40:48,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:40:48,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:40:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:40:48,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:40:48,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392974348] [2025-03-03 21:40:48,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392974348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:40:48,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:40:48,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:40:48,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252469351] [2025-03-03 21:40:48,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:40:48,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:40:48,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:40:48,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:40:48,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:40:48,571 INFO L87 Difference]: Start difference. First operand 129 states and 195 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:40:48,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:40:48,692 INFO L93 Difference]: Finished difference Result 283 states and 427 transitions. [2025-03-03 21:40:48,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:40:48,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2025-03-03 21:40:48,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:40:48,695 INFO L225 Difference]: With dead ends: 283 [2025-03-03 21:40:48,695 INFO L226 Difference]: Without dead ends: 211 [2025-03-03 21:40:48,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:40:48,696 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 110 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:40:48,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 315 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:40:48,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-03 21:40:48,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 199. [2025-03-03 21:40:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 135 states have (on average 1.348148148148148) internal successors, (182), 135 states have internal predecessors, (182), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 21:40:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 302 transitions. [2025-03-03 21:40:48,728 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 302 transitions. Word has length 138 [2025-03-03 21:40:48,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:40:48,729 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 302 transitions. [2025-03-03 21:40:48,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:40:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 302 transitions. [2025-03-03 21:40:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 21:40:48,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:40:48,732 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:40:48,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:40:48,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:40:48,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:40:48,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1005293174, now seen corresponding path program 1 times [2025-03-03 21:40:48,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:40:48,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190915832] [2025-03-03 21:40:48,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:40:48,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:40:48,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 21:40:48,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 21:40:48,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:40:48,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:40:49,004 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 21:40:49,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:40:49,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190915832] [2025-03-03 21:40:49,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190915832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:40:49,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785107265] [2025-03-03 21:40:49,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:40:49,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:40:49,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:40:49,014 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-03 21:40:49,015 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-03 21:40:49,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 21:40:49,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 21:40:49,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:40:49,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:40:49,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:40:49,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:40:49,298 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-03-03 21:40:49,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:40:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 21:40:49,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785107265] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:40:49,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:40:49,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 21:40:49,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021744325] [2025-03-03 21:40:49,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:40:49,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:40:49,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:40:49,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:40:49,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:40:49,495 INFO L87 Difference]: Start difference. First operand 199 states and 302 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2025-03-03 21:40:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:40:49,677 INFO L93 Difference]: Finished difference Result 371 states and 551 transitions. [2025-03-03 21:40:49,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:40:49,677 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) Word has length 139 [2025-03-03 21:40:49,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:40:49,679 INFO L225 Difference]: With dead ends: 371 [2025-03-03 21:40:49,679 INFO L226 Difference]: Without dead ends: 217 [2025-03-03 21:40:49,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:40:49,680 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 160 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:40:49,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 174 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:40:49,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-03 21:40:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2025-03-03 21:40:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 144 states have internal predecessors, (185), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 21:40:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 305 transitions. [2025-03-03 21:40:49,703 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 305 transitions. Word has length 139 [2025-03-03 21:40:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:40:49,703 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 305 transitions. [2025-03-03 21:40:49,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2025-03-03 21:40:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 305 transitions. [2025-03-03 21:40:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 21:40:49,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:40:49,704 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:40:49,711 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-03 21:40:49,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:40:49,905 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:40:49,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:40:49,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1148041626, now seen corresponding path program 1 times [2025-03-03 21:40:49,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:40:49,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494555193] [2025-03-03 21:40:49,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:40:49,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:40:49,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 21:40:49,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 21:40:49,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:40:49,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:40:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 21:40:50,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:40:50,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494555193] [2025-03-03 21:40:50,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494555193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:40:50,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534885492] [2025-03-03 21:40:50,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:40:50,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:40:50,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:40:50,190 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-03 21:40:50,193 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-03 21:40:50,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 21:40:50,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 21:40:50,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:40:50,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:40:50,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 21:40:50,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:40:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-03-03 21:40:50,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:40:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 21:40:51,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534885492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:40:51,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:40:51,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2025-03-03 21:40:51,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138311912] [2025-03-03 21:40:51,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:40:51,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 21:40:51,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:40:51,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 21:40:51,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:40:51,032 INFO L87 Difference]: Start difference. First operand 211 states and 305 transitions. Second operand has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 6 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) [2025-03-03 21:40:51,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:40:51,535 INFO L93 Difference]: Finished difference Result 419 states and 596 transitions. [2025-03-03 21:40:51,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 21:40:51,536 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 6 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) Word has length 142 [2025-03-03 21:40:51,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:40:51,538 INFO L225 Difference]: With dead ends: 419 [2025-03-03 21:40:51,538 INFO L226 Difference]: Without dead ends: 266 [2025-03-03 21:40:51,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-03-03 21:40:51,539 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 291 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:40:51,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 317 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:40:51,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-03 21:40:51,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 252. [2025-03-03 21:40:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 177 states have (on average 1.2768361581920904) internal successors, (226), 179 states have internal predecessors, (226), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:40:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 358 transitions. [2025-03-03 21:40:51,572 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 358 transitions. Word has length 142 [2025-03-03 21:40:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:40:51,572 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 358 transitions. [2025-03-03 21:40:51,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 6 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) [2025-03-03 21:40:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 358 transitions. [2025-03-03 21:40:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 21:40:51,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:40:51,574 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:40:51,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 21:40:51,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:40:51,775 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:40:51,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:40:51,775 INFO L85 PathProgramCache]: Analyzing trace with hash 41606535, now seen corresponding path program 1 times [2025-03-03 21:40:51,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:40:51,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764856435] [2025-03-03 21:40:51,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:40:51,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:40:51,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 21:40:51,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 21:40:51,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:40:51,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:40:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:40:52,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:40:52,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764856435] [2025-03-03 21:40:52,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764856435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:40:52,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:40:52,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:40:52,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125546034] [2025-03-03 21:40:52,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:40:52,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:40:52,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:40:52,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:40:52,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:40:52,020 INFO L87 Difference]: Start difference. First operand 252 states and 358 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:40:52,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:40:52,203 INFO L93 Difference]: Finished difference Result 466 states and 667 transitions. [2025-03-03 21:40:52,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 21:40:52,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-03 21:40:52,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:40:52,206 INFO L225 Difference]: With dead ends: 466 [2025-03-03 21:40:52,206 INFO L226 Difference]: Without dead ends: 276 [2025-03-03 21:40:52,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:40:52,207 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 94 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:40:52,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 188 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:40:52,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-03 21:40:52,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 252. [2025-03-03 21:40:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 177 states have (on average 1.2598870056497176) internal successors, (223), 179 states have internal predecessors, (223), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:40:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 355 transitions. [2025-03-03 21:40:52,238 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 355 transitions. Word has length 143 [2025-03-03 21:40:52,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:40:52,239 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 355 transitions. [2025-03-03 21:40:52,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:40:52,239 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 355 transitions. [2025-03-03 21:40:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 21:40:52,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:40:52,240 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:40:52,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:40:52,241 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:40:52,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:40:52,242 INFO L85 PathProgramCache]: Analyzing trace with hash 335009542, now seen corresponding path program 1 times [2025-03-03 21:40:52,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:40:52,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225054073] [2025-03-03 21:40:52,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:40:52,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:40:52,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 21:40:52,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 21:40:52,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:40:52,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:40:52,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152441273] [2025-03-03 21:40:52,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:40:52,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:40:52,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:40:52,359 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-03 21:40:52,360 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-03 21:40:52,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 21:40:52,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 21:40:52,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:40:52,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:40:52,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 21:40:52,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:40:52,626 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-03-03 21:40:52,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:40:52,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:40:52,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225054073] [2025-03-03 21:40:52,805 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 21:40:52,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152441273] [2025-03-03 21:40:52,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152441273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:40:52,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:40:52,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-03 21:40:52,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368334195] [2025-03-03 21:40:52,805 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 21:40:52,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:40:52,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:40:52,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:40:52,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:40:52,806 INFO L87 Difference]: Start difference. First operand 252 states and 355 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 21:40:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:40:53,245 INFO L93 Difference]: Finished difference Result 463 states and 646 transitions. [2025-03-03 21:40:53,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:40:53,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 143 [2025-03-03 21:40:53,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:40:53,247 INFO L225 Difference]: With dead ends: 463 [2025-03-03 21:40:53,247 INFO L226 Difference]: Without dead ends: 262 [2025-03-03 21:40:53,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:40:53,248 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 53 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:40:53,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 222 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:40:53,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-03 21:40:53,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 252. [2025-03-03 21:40:53,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 177 states have (on average 1.2429378531073447) internal successors, (220), 179 states have internal predecessors, (220), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:40:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 352 transitions. [2025-03-03 21:40:53,272 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 352 transitions. Word has length 143 [2025-03-03 21:40:53,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:40:53,272 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 352 transitions. [2025-03-03 21:40:53,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 21:40:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 352 transitions. [2025-03-03 21:40:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 21:40:53,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:40:53,274 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:40:53,280 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-03 21:40:53,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:40:53,475 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:40:53,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:40:53,475 INFO L85 PathProgramCache]: Analyzing trace with hash 956730923, now seen corresponding path program 1 times [2025-03-03 21:40:53,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:40:53,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009324818] [2025-03-03 21:40:53,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:40:53,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:40:53,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 21:40:53,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 21:40:53,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:40:53,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:40:53,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [902333047] [2025-03-03 21:40:53,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:40:53,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:40:53,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:40:53,569 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:40:53,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 21:40:53,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 21:40:53,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 21:40:53,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:40:53,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:40:53,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-03 21:40:53,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:40:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 247 proven. 195 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-03 21:40:55,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:41:03,270 WARN L286 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 21:41:26,800 WARN L286 SmtUtils]: Spent 7.25s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 21:41:38,142 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)