./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-32.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_fillercodesize_ps-cn-250_file-32.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 0dc1ea3f6d575c3373292fe3183b9746ee1849ecfd8e379a22948351cc030925 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:46:05,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:46:05,624 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:46:05,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:46:05,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:46:05,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:46:05,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:46:05,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:46:05,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:46:05,656 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:46:05,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:46:05,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:46:05,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:46:05,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:46:05,657 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:46:05,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:46:05,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:46:05,658 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:46:05,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:46:05,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:46:05,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:46:05,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:46:05,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:46:05,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:46:05,659 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:46:05,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:46:05,659 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:46:05,659 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:46:05,659 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:46:05,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:46:05,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:46:05,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:46:05,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:46:05,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:46:05,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:46:05,660 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:46:05,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:46:05,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:46:05,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:46:05,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:46:05,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:46:05,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:46:05,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:46:05,660 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 -> 0dc1ea3f6d575c3373292fe3183b9746ee1849ecfd8e379a22948351cc030925 [2025-03-03 19:46:05,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:46:05,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:46:05,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:46:05,900 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:46:05,901 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:46:05,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-32.i [2025-03-03 19:46:07,118 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1ad3fdb5/fed3504aa73844c084b595373a0f57a1/FLAG9b5ed1c38 [2025-03-03 19:46:07,458 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:46:07,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-32.i [2025-03-03 19:46:07,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1ad3fdb5/fed3504aa73844c084b595373a0f57a1/FLAG9b5ed1c38 [2025-03-03 19:46:07,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1ad3fdb5/fed3504aa73844c084b595373a0f57a1 [2025-03-03 19:46:07,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:46:07,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:46:07,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:46:07,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:46:07,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:46:07,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:46:07" (1/1) ... [2025-03-03 19:46:07,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16a0cc83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:07, skipping insertion in model container [2025-03-03 19:46:07,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:46:07" (1/1) ... [2025-03-03 19:46:07,734 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:46:07,838 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-32.i[916,929] [2025-03-03 19:46:07,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:46:07,958 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:46:07,966 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-32.i[916,929] [2025-03-03 19:46:08,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:46:08,049 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:46:08,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:08 WrapperNode [2025-03-03 19:46:08,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:46:08,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:46:08,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:46:08,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:46:08,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:08" (1/1) ... [2025-03-03 19:46:08,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:08" (1/1) ... [2025-03-03 19:46:08,121 INFO L138 Inliner]: procedures = 26, calls = 87, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 586 [2025-03-03 19:46:08,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:46:08,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:46:08,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:46:08,122 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:46:08,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:08" (1/1) ... [2025-03-03 19:46:08,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:08" (1/1) ... [2025-03-03 19:46:08,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:08" (1/1) ... [2025-03-03 19:46:08,176 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 19:46:08,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:08" (1/1) ... [2025-03-03 19:46:08,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:08" (1/1) ... [2025-03-03 19:46:08,190 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:08" (1/1) ... [2025-03-03 19:46:08,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:08" (1/1) ... [2025-03-03 19:46:08,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:08" (1/1) ... [2025-03-03 19:46:08,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:08" (1/1) ... [2025-03-03 19:46:08,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:46:08,213 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:46:08,213 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:46:08,213 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:46:08,214 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:08" (1/1) ... [2025-03-03 19:46:08,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:46:08,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:46:08,250 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 19:46:08,256 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 19:46:08,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:46:08,278 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:46:08,278 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:46:08,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:46:08,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:46:08,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:46:08,362 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:46:08,365 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:46:09,135 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 19:46:09,135 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:46:09,169 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:46:09,171 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 19:46:09,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:46:09 BoogieIcfgContainer [2025-03-03 19:46:09,172 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:46:09,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:46:09,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:46:09,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:46:09,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:46:07" (1/3) ... [2025-03-03 19:46:09,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f0324a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:46:09, skipping insertion in model container [2025-03-03 19:46:09,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:46:08" (2/3) ... [2025-03-03 19:46:09,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f0324a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:46:09, skipping insertion in model container [2025-03-03 19:46:09,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:46:09" (3/3) ... [2025-03-03 19:46:09,180 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-32.i [2025-03-03 19:46:09,191 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:46:09,194 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-32.i that has 2 procedures, 242 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:46:09,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:46:09,259 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;@70f31f31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:46:09,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:46:09,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 242 states, 165 states have (on average 1.5454545454545454) internal successors, (255), 166 states have internal predecessors, (255), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 19:46:09,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-03 19:46:09,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:09,285 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:09,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:09,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:09,290 INFO L85 PathProgramCache]: Analyzing trace with hash 446498748, now seen corresponding path program 1 times [2025-03-03 19:46:09,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:09,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709798421] [2025-03-03 19:46:09,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:09,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:09,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-03 19:46:09,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-03 19:46:09,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:09,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-03-03 19:46:09,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:09,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709798421] [2025-03-03 19:46:09,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709798421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:46:09,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944750807] [2025-03-03 19:46:09,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:09,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:46:09,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:46:09,794 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 19:46:09,796 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 19:46:09,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-03 19:46:10,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-03 19:46:10,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:10,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:10,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:46:10,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:46:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-03-03 19:46:10,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:46:10,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944750807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:10,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:46:10,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:46:10,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951200916] [2025-03-03 19:46:10,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:10,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:46:10,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:10,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:46:10,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:46:10,154 INFO L87 Difference]: Start difference. First operand has 242 states, 165 states have (on average 1.5454545454545454) internal successors, (255), 166 states have internal predecessors, (255), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) Second operand has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:46:10,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:10,232 INFO L93 Difference]: Finished difference Result 478 states and 875 transitions. [2025-03-03 19:46:10,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:46:10,235 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) Word has length 466 [2025-03-03 19:46:10,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:10,248 INFO L225 Difference]: With dead ends: 478 [2025-03-03 19:46:10,248 INFO L226 Difference]: Without dead ends: 239 [2025-03-03 19:46:10,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 467 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 19:46:10,259 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:10,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 384 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:46:10,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-03 19:46:10,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-03-03 19:46:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 163 states have (on average 1.5337423312883436) internal successors, (250), 163 states have internal predecessors, (250), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 19:46:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 398 transitions. [2025-03-03 19:46:10,321 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 398 transitions. Word has length 466 [2025-03-03 19:46:10,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:10,323 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 398 transitions. [2025-03-03 19:46:10,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:46:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 398 transitions. [2025-03-03 19:46:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-03 19:46:10,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:10,333 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:10,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 19:46:10,538 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 19:46:10,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:10,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1652135784, now seen corresponding path program 1 times [2025-03-03 19:46:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:10,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355352424] [2025-03-03 19:46:10,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:10,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:10,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-03 19:46:10,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-03 19:46:10,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:10,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:46:10,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:10,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355352424] [2025-03-03 19:46:10,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355352424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:10,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:10,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:46:10,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879561686] [2025-03-03 19:46:10,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:10,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:46:10,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:10,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:46:10,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:46:10,967 INFO L87 Difference]: Start difference. First operand 239 states and 398 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:46:11,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:11,096 INFO L93 Difference]: Finished difference Result 710 states and 1186 transitions. [2025-03-03 19:46:11,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:46:11,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 466 [2025-03-03 19:46:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:11,106 INFO L225 Difference]: With dead ends: 710 [2025-03-03 19:46:11,107 INFO L226 Difference]: Without dead ends: 474 [2025-03-03 19:46:11,109 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 19:46:11,109 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 387 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:11,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 828 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:46:11,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-03-03 19:46:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 468. [2025-03-03 19:46:11,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 317 states have (on average 1.5331230283911672) internal successors, (486), 317 states have internal predecessors, (486), 148 states have call successors, (148), 2 states have call predecessors, (148), 2 states have return successors, (148), 148 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 19:46:11,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 782 transitions. [2025-03-03 19:46:11,180 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 782 transitions. Word has length 466 [2025-03-03 19:46:11,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:11,183 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 782 transitions. [2025-03-03 19:46:11,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:46:11,183 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 782 transitions. [2025-03-03 19:46:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-03 19:46:11,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:11,190 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:11,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:46:11,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:11,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:11,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2132297335, now seen corresponding path program 1 times [2025-03-03 19:46:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:11,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7227764] [2025-03-03 19:46:11,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:11,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-03 19:46:11,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-03 19:46:11,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:11,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:46:11,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:11,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7227764] [2025-03-03 19:46:11,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7227764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:11,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:11,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:46:11,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097183946] [2025-03-03 19:46:11,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:11,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:46:11,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:11,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:46:11,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:46:11,492 INFO L87 Difference]: Start difference. First operand 468 states and 782 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:46:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:11,617 INFO L93 Difference]: Finished difference Result 1260 states and 2108 transitions. [2025-03-03 19:46:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:46:11,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 466 [2025-03-03 19:46:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:11,627 INFO L225 Difference]: With dead ends: 1260 [2025-03-03 19:46:11,629 INFO L226 Difference]: Without dead ends: 795 [2025-03-03 19:46:11,631 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 19:46:11,633 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 252 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:11,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 747 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:46:11,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-03-03 19:46:11,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 791. [2025-03-03 19:46:11,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 538 states have (on average 1.5278810408921932) internal successors, (822), 540 states have internal predecessors, (822), 248 states have call successors, (248), 4 states have call predecessors, (248), 4 states have return successors, (248), 246 states have call predecessors, (248), 248 states have call successors, (248) [2025-03-03 19:46:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1318 transitions. [2025-03-03 19:46:11,770 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1318 transitions. Word has length 466 [2025-03-03 19:46:11,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:11,771 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1318 transitions. [2025-03-03 19:46:11,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:46:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1318 transitions. [2025-03-03 19:46:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-03 19:46:11,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:11,783 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:11,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:46:11,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:11,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:11,785 INFO L85 PathProgramCache]: Analyzing trace with hash -655118152, now seen corresponding path program 1 times [2025-03-03 19:46:11,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:11,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516219710] [2025-03-03 19:46:11,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:11,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:11,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-03 19:46:11,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-03 19:46:11,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:11,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:12,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:46:12,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:12,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516219710] [2025-03-03 19:46:12,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516219710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:12,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:12,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:46:12,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412834261] [2025-03-03 19:46:12,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:12,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:46:12,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:12,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:46:12,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:46:12,274 INFO L87 Difference]: Start difference. First operand 791 states and 1318 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:46:12,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:12,569 INFO L93 Difference]: Finished difference Result 2085 states and 3486 transitions. [2025-03-03 19:46:12,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:46:12,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 466 [2025-03-03 19:46:12,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:12,580 INFO L225 Difference]: With dead ends: 2085 [2025-03-03 19:46:12,580 INFO L226 Difference]: Without dead ends: 1297 [2025-03-03 19:46:12,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:46:12,584 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 238 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:12,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 1473 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:46:12,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2025-03-03 19:46:12,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1291. [2025-03-03 19:46:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 958 states have (on average 1.582463465553236) internal successors, (1516), 964 states have internal predecessors, (1516), 324 states have call successors, (324), 8 states have call predecessors, (324), 8 states have return successors, (324), 318 states have call predecessors, (324), 324 states have call successors, (324) [2025-03-03 19:46:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 2164 transitions. [2025-03-03 19:46:12,686 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 2164 transitions. Word has length 466 [2025-03-03 19:46:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:12,687 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 2164 transitions. [2025-03-03 19:46:12,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:46:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2164 transitions. [2025-03-03 19:46:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-03 19:46:12,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:12,693 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:12,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:46:12,693 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:12,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:12,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1241990182, now seen corresponding path program 1 times [2025-03-03 19:46:12,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:12,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106669856] [2025-03-03 19:46:12,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:12,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:12,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-03 19:46:12,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-03 19:46:12,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:12,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:46:13,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:13,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106669856] [2025-03-03 19:46:13,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106669856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:13,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:13,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:46:13,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948182239] [2025-03-03 19:46:13,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:13,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:46:13,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:13,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:46:13,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:46:13,073 INFO L87 Difference]: Start difference. First operand 1291 states and 2164 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:46:13,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:13,628 INFO L93 Difference]: Finished difference Result 4601 states and 7737 transitions. [2025-03-03 19:46:13,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:46:13,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 466 [2025-03-03 19:46:13,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:13,653 INFO L225 Difference]: With dead ends: 4601 [2025-03-03 19:46:13,653 INFO L226 Difference]: Without dead ends: 3313 [2025-03-03 19:46:13,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 19:46:13,659 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 812 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:13,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1024 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:46:13,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3313 states. [2025-03-03 19:46:13,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3313 to 3301. [2025-03-03 19:46:13,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3301 states, 2616 states have (on average 1.6200305810397553) internal successors, (4238), 2638 states have internal predecessors, (4238), 660 states have call successors, (660), 24 states have call predecessors, (660), 24 states have return successors, (660), 638 states have call predecessors, (660), 660 states have call successors, (660) [2025-03-03 19:46:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 5558 transitions. [2025-03-03 19:46:13,833 INFO L78 Accepts]: Start accepts. Automaton has 3301 states and 5558 transitions. Word has length 466 [2025-03-03 19:46:13,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:13,834 INFO L471 AbstractCegarLoop]: Abstraction has 3301 states and 5558 transitions. [2025-03-03 19:46:13,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:46:13,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 5558 transitions. [2025-03-03 19:46:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-03 19:46:13,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:13,841 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:13,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:46:13,841 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:13,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash 987253637, now seen corresponding path program 1 times [2025-03-03 19:46:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:13,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660670463] [2025-03-03 19:46:13,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:13,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:13,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-03 19:46:14,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-03 19:46:14,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:14,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:46:15,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:15,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660670463] [2025-03-03 19:46:15,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660670463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:15,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:15,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 19:46:15,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796643243] [2025-03-03 19:46:15,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:15,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 19:46:15,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:15,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 19:46:15,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:46:15,383 INFO L87 Difference]: Start difference. First operand 3301 states and 5558 transitions. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:46:18,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:18,565 INFO L93 Difference]: Finished difference Result 13173 states and 22077 transitions. [2025-03-03 19:46:18,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 19:46:18,566 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 466 [2025-03-03 19:46:18,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:18,617 INFO L225 Difference]: With dead ends: 13173 [2025-03-03 19:46:18,618 INFO L226 Difference]: Without dead ends: 9875 [2025-03-03 19:46:18,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:46:18,629 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 2374 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 2511 SdHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:18,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2374 Valid, 2511 Invalid, 2117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [424 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 19:46:18,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9875 states. [2025-03-03 19:46:19,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9875 to 7069. [2025-03-03 19:46:19,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7069 states, 5673 states have (on average 1.6296492155825841) internal successors, (9245), 5718 states have internal predecessors, (9245), 1345 states have call successors, (1345), 50 states have call predecessors, (1345), 50 states have return successors, (1345), 1300 states have call predecessors, (1345), 1345 states have call successors, (1345) [2025-03-03 19:46:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7069 states to 7069 states and 11935 transitions. [2025-03-03 19:46:19,234 INFO L78 Accepts]: Start accepts. Automaton has 7069 states and 11935 transitions. Word has length 466 [2025-03-03 19:46:19,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:19,235 INFO L471 AbstractCegarLoop]: Abstraction has 7069 states and 11935 transitions. [2025-03-03 19:46:19,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:46:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 7069 states and 11935 transitions. [2025-03-03 19:46:19,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-03 19:46:19,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:19,245 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:19,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:46:19,245 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:19,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:19,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1198604550, now seen corresponding path program 1 times [2025-03-03 19:46:19,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:19,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013920181] [2025-03-03 19:46:19,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:19,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:19,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-03 19:46:19,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-03 19:46:19,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:19,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 42 proven. 177 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-03 19:46:19,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:19,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013920181] [2025-03-03 19:46:19,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013920181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:46:19,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504984093] [2025-03-03 19:46:19,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:19,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:46:19,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:46:19,755 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 19:46:19,757 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 19:46:19,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-03 19:46:19,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-03 19:46:19,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:19,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:19,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 19:46:19,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:46:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 4545 proven. 63 refuted. 0 times theorem prover too weak. 6196 trivial. 0 not checked. [2025-03-03 19:46:20,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:46:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 156 proven. 63 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-03 19:46:21,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504984093] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:46:21,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:46:21,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 7] total 15 [2025-03-03 19:46:21,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495217425] [2025-03-03 19:46:21,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:46:21,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 19:46:21,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:21,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 19:46:21,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:46:21,543 INFO L87 Difference]: Start difference. First operand 7069 states and 11935 transitions. Second operand has 15 states, 15 states have (on average 18.133333333333333) internal successors, (272), 15 states have internal predecessors, (272), 6 states have call successors, (222), 3 states have call predecessors, (222), 6 states have return successors, (222), 6 states have call predecessors, (222), 6 states have call successors, (222) [2025-03-03 19:46:26,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:26,856 INFO L93 Difference]: Finished difference Result 36211 states and 59787 transitions. [2025-03-03 19:46:26,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-03 19:46:26,857 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 18.133333333333333) internal successors, (272), 15 states have internal predecessors, (272), 6 states have call successors, (222), 3 states have call predecessors, (222), 6 states have return successors, (222), 6 states have call predecessors, (222), 6 states have call successors, (222) Word has length 466 [2025-03-03 19:46:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:26,976 INFO L225 Difference]: With dead ends: 36211 [2025-03-03 19:46:26,977 INFO L226 Difference]: Without dead ends: 29193 [2025-03-03 19:46:26,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1011 GetRequests, 935 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2237 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1292, Invalid=4714, Unknown=0, NotChecked=0, Total=6006 [2025-03-03 19:46:26,998 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 2781 mSDsluCounter, 3051 mSDsCounter, 0 mSdLazyCounter, 3415 mSolverCounterSat, 1939 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2799 SdHoareTripleChecker+Valid, 3784 SdHoareTripleChecker+Invalid, 5354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1939 IncrementalHoareTripleChecker+Valid, 3415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:26,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2799 Valid, 3784 Invalid, 5354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1939 Valid, 3415 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-03 19:46:27,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29193 states. [2025-03-03 19:46:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29193 to 19613. [2025-03-03 19:46:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19613 states, 14756 states have (on average 1.5420168067226891) internal successors, (22754), 14919 states have internal predecessors, (22754), 4513 states have call successors, (4513), 343 states have call predecessors, (4513), 343 states have return successors, (4513), 4350 states have call predecessors, (4513), 4513 states have call successors, (4513) [2025-03-03 19:46:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19613 states to 19613 states and 31780 transitions. [2025-03-03 19:46:28,480 INFO L78 Accepts]: Start accepts. Automaton has 19613 states and 31780 transitions. Word has length 466 [2025-03-03 19:46:28,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:28,481 INFO L471 AbstractCegarLoop]: Abstraction has 19613 states and 31780 transitions. [2025-03-03 19:46:28,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 18.133333333333333) internal successors, (272), 15 states have internal predecessors, (272), 6 states have call successors, (222), 3 states have call predecessors, (222), 6 states have return successors, (222), 6 states have call predecessors, (222), 6 states have call successors, (222) [2025-03-03 19:46:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 19613 states and 31780 transitions. [2025-03-03 19:46:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-03 19:46:28,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:28,497 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:28,506 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 19:46:28,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-03 19:46:28,698 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:28,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:28,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1750356693, now seen corresponding path program 1 times [2025-03-03 19:46:28,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:28,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500151005] [2025-03-03 19:46:28,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:28,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:28,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-03 19:46:28,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-03 19:46:28,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:28,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:46:29,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:29,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500151005] [2025-03-03 19:46:29,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500151005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:29,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:29,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 19:46:29,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435325251] [2025-03-03 19:46:29,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:29,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:46:29,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:29,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:46:29,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:46:29,834 INFO L87 Difference]: Start difference. First operand 19613 states and 31780 transitions. Second operand has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:46:35,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:35,041 INFO L93 Difference]: Finished difference Result 46652 states and 75200 transitions. [2025-03-03 19:46:35,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 19:46:35,042 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 468 [2025-03-03 19:46:35,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:35,184 INFO L225 Difference]: With dead ends: 46652 [2025-03-03 19:46:35,184 INFO L226 Difference]: Without dead ends: 33174 [2025-03-03 19:46:35,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2025-03-03 19:46:35,223 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 3449 mSDsluCounter, 2335 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 1177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3449 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1177 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:35,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3449 Valid, 2761 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1177 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 19:46:35,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33174 states. [2025-03-03 19:46:36,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33174 to 20061. [2025-03-03 19:46:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20061 states, 15204 states have (on average 1.5486714022625625) internal successors, (23546), 15367 states have internal predecessors, (23546), 4513 states have call successors, (4513), 343 states have call predecessors, (4513), 343 states have return successors, (4513), 4350 states have call predecessors, (4513), 4513 states have call successors, (4513) [2025-03-03 19:46:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20061 states to 20061 states and 32572 transitions. [2025-03-03 19:46:36,629 INFO L78 Accepts]: Start accepts. Automaton has 20061 states and 32572 transitions. Word has length 468 [2025-03-03 19:46:36,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:36,630 INFO L471 AbstractCegarLoop]: Abstraction has 20061 states and 32572 transitions. [2025-03-03 19:46:36,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:46:36,631 INFO L276 IsEmpty]: Start isEmpty. Operand 20061 states and 32572 transitions. [2025-03-03 19:46:36,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-03 19:46:36,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:36,648 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:36,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:46:36,650 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:36,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:36,650 INFO L85 PathProgramCache]: Analyzing trace with hash 506554314, now seen corresponding path program 1 times [2025-03-03 19:46:36,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:36,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147141504] [2025-03-03 19:46:36,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:36,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:36,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-03 19:46:36,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-03 19:46:36,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:36,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 153 proven. 66 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-03 19:46:37,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:37,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147141504] [2025-03-03 19:46:37,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147141504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:46:37,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404198266] [2025-03-03 19:46:37,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:37,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:46:37,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:46:37,135 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 19:46:37,137 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 19:46:37,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-03 19:46:37,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-03 19:46:37,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:37,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:37,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:46:37,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:46:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 4663 proven. 66 refuted. 0 times theorem prover too weak. 6075 trivial. 0 not checked. [2025-03-03 19:46:37,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:46:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 153 proven. 66 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-03 19:46:37,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404198266] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:46:37,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:46:37,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 19:46:37,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664153540] [2025-03-03 19:46:37,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:46:37,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:46:37,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:37,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:46:37,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:46:37,945 INFO L87 Difference]: Start difference. First operand 20061 states and 32572 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 2 states have call successors, (96), 2 states have call predecessors, (96), 4 states have return successors, (97), 2 states have call predecessors, (97), 2 states have call successors, (97) [2025-03-03 19:46:38,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:38,829 INFO L93 Difference]: Finished difference Result 34517 states and 56339 transitions. [2025-03-03 19:46:38,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:46:38,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 2 states have call successors, (96), 2 states have call predecessors, (96), 4 states have return successors, (97), 2 states have call predecessors, (97), 2 states have call successors, (97) Word has length 468 [2025-03-03 19:46:38,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:38,882 INFO L225 Difference]: With dead ends: 34517 [2025-03-03 19:46:38,882 INFO L226 Difference]: Without dead ends: 14511 [2025-03-03 19:46:38,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 943 GetRequests, 933 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:46:38,914 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 434 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:38,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 742 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:46:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14511 states. [2025-03-03 19:46:39,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14511 to 8571. [2025-03-03 19:46:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8571 states, 6668 states have (on average 1.5554889022195562) internal successors, (10372), 6723 states have internal predecessors, (10372), 1751 states have call successors, (1751), 151 states have call predecessors, (1751), 151 states have return successors, (1751), 1696 states have call predecessors, (1751), 1751 states have call successors, (1751) [2025-03-03 19:46:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8571 states to 8571 states and 13874 transitions. [2025-03-03 19:46:39,489 INFO L78 Accepts]: Start accepts. Automaton has 8571 states and 13874 transitions. Word has length 468 [2025-03-03 19:46:39,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:39,490 INFO L471 AbstractCegarLoop]: Abstraction has 8571 states and 13874 transitions. [2025-03-03 19:46:39,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 2 states have call successors, (96), 2 states have call predecessors, (96), 4 states have return successors, (97), 2 states have call predecessors, (97), 2 states have call successors, (97) [2025-03-03 19:46:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 8571 states and 13874 transitions. [2025-03-03 19:46:39,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-03 19:46:39,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:39,498 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:39,505 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 19:46:39,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:46:39,699 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:39,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:39,700 INFO L85 PathProgramCache]: Analyzing trace with hash -3979863, now seen corresponding path program 1 times [2025-03-03 19:46:39,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:39,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032877843] [2025-03-03 19:46:39,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:39,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:39,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-03 19:46:39,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-03 19:46:39,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:39,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:46:40,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:40,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032877843] [2025-03-03 19:46:40,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032877843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:40,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:40,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:46:40,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826984937] [2025-03-03 19:46:40,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:40,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:46:40,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:40,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:46:40,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:46:40,018 INFO L87 Difference]: Start difference. First operand 8571 states and 13874 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:46:40,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:40,427 INFO L93 Difference]: Finished difference Result 14383 states and 23487 transitions. [2025-03-03 19:46:40,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:46:40,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 468 [2025-03-03 19:46:40,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:40,450 INFO L225 Difference]: With dead ends: 14383 [2025-03-03 19:46:40,450 INFO L226 Difference]: Without dead ends: 3321 [2025-03-03 19:46:40,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 19:46:40,470 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 518 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:40,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 790 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:46:40,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3321 states. [2025-03-03 19:46:40,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3321 to 3313. [2025-03-03 19:46:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3313 states, 2538 states have (on average 1.5240346729708432) internal successors, (3868), 2561 states have internal predecessors, (3868), 711 states have call successors, (711), 63 states have call predecessors, (711), 63 states have return successors, (711), 688 states have call predecessors, (711), 711 states have call successors, (711) [2025-03-03 19:46:40,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3313 states to 3313 states and 5290 transitions. [2025-03-03 19:46:40,852 INFO L78 Accepts]: Start accepts. Automaton has 3313 states and 5290 transitions. Word has length 468 [2025-03-03 19:46:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:40,853 INFO L471 AbstractCegarLoop]: Abstraction has 3313 states and 5290 transitions. [2025-03-03 19:46:40,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:46:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3313 states and 5290 transitions. [2025-03-03 19:46:40,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-03 19:46:40,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:40,859 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:40,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 19:46:40,859 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:40,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:40,860 INFO L85 PathProgramCache]: Analyzing trace with hash -175849292, now seen corresponding path program 1 times [2025-03-03 19:46:40,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:40,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989615644] [2025-03-03 19:46:40,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:40,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:40,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-03 19:46:41,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-03 19:46:41,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:41,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 162 proven. 57 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-03 19:46:41,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:41,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989615644] [2025-03-03 19:46:41,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989615644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:46:41,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672646626] [2025-03-03 19:46:41,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:41,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:46:41,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:46:41,349 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 19:46:41,352 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 19:46:41,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-03 19:46:41,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-03 19:46:41,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:41,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:41,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 19:46:41,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:46:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 4306 proven. 108 refuted. 0 times theorem prover too weak. 6390 trivial. 0 not checked. [2025-03-03 19:46:41,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:46:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 162 proven. 57 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-03 19:46:42,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672646626] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:46:42,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:46:42,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 12 [2025-03-03 19:46:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728310053] [2025-03-03 19:46:42,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:46:42,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 19:46:42,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:42,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 19:46:42,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:46:42,227 INFO L87 Difference]: Start difference. First operand 3313 states and 5290 transitions. Second operand has 12 states, 12 states have (on average 13.166666666666666) internal successors, (158), 12 states have internal predecessors, (158), 3 states have call successors, (93), 3 states have call predecessors, (93), 5 states have return successors, (94), 3 states have call predecessors, (94), 3 states have call successors, (94) [2025-03-03 19:46:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:43,495 INFO L93 Difference]: Finished difference Result 8829 states and 14067 transitions. [2025-03-03 19:46:43,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 19:46:43,495 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.166666666666666) internal successors, (158), 12 states have internal predecessors, (158), 3 states have call successors, (93), 3 states have call predecessors, (93), 5 states have return successors, (94), 3 states have call predecessors, (94), 3 states have call successors, (94) Word has length 469 [2025-03-03 19:46:43,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:43,526 INFO L225 Difference]: With dead ends: 8829 [2025-03-03 19:46:43,526 INFO L226 Difference]: Without dead ends: 5571 [2025-03-03 19:46:43,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 967 GetRequests, 933 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 19:46:43,538 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 1376 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 588 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1432 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 588 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:43,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1432 Valid, 1596 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [588 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 19:46:43,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5571 states. [2025-03-03 19:46:43,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5571 to 3783. [2025-03-03 19:46:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3783 states, 3000 states have (on average 1.5173333333333334) internal successors, (4552), 3023 states have internal predecessors, (4552), 711 states have call successors, (711), 71 states have call predecessors, (711), 71 states have return successors, (711), 688 states have call predecessors, (711), 711 states have call successors, (711) [2025-03-03 19:46:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3783 states to 3783 states and 5974 transitions. [2025-03-03 19:46:43,854 INFO L78 Accepts]: Start accepts. Automaton has 3783 states and 5974 transitions. Word has length 469 [2025-03-03 19:46:43,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:43,855 INFO L471 AbstractCegarLoop]: Abstraction has 3783 states and 5974 transitions. [2025-03-03 19:46:43,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.166666666666666) internal successors, (158), 12 states have internal predecessors, (158), 3 states have call successors, (93), 3 states have call predecessors, (93), 5 states have return successors, (94), 3 states have call predecessors, (94), 3 states have call successors, (94) [2025-03-03 19:46:43,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3783 states and 5974 transitions. [2025-03-03 19:46:43,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-03 19:46:43,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:43,860 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:43,869 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 19:46:44,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:46:44,062 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:44,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:44,062 INFO L85 PathProgramCache]: Analyzing trace with hash -239749937, now seen corresponding path program 1 times [2025-03-03 19:46:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:44,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148326276] [2025-03-03 19:46:44,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:44,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:44,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-03 19:46:44,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-03 19:46:44,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:44,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:44,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 231 proven. 201 refuted. 0 times theorem prover too weak. 10372 trivial. 0 not checked. [2025-03-03 19:46:44,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:44,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148326276] [2025-03-03 19:46:44,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148326276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:46:44,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638932810] [2025-03-03 19:46:44,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:44,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:46:44,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:46:44,789 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 19:46:44,790 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 19:46:44,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-03 19:46:45,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-03 19:46:45,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:45,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:45,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 19:46:45,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:46:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 7085 proven. 309 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2025-03-03 19:46:46,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:46:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 330 proven. 318 refuted. 0 times theorem prover too weak. 10156 trivial. 0 not checked. [2025-03-03 19:46:47,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638932810] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:46:47,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:46:47,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 28 [2025-03-03 19:46:47,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230159237] [2025-03-03 19:46:47,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:46:47,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 19:46:47,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:47,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 19:46:47,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2025-03-03 19:46:47,649 INFO L87 Difference]: Start difference. First operand 3783 states and 5974 transitions. Second operand has 28 states, 28 states have (on average 8.642857142857142) internal successors, (242), 28 states have internal predecessors, (242), 9 states have call successors, (164), 4 states have call predecessors, (164), 9 states have return successors, (166), 9 states have call predecessors, (166), 9 states have call successors, (166) [2025-03-03 19:46:58,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:58,568 INFO L93 Difference]: Finished difference Result 33799 states and 51944 transitions. [2025-03-03 19:46:58,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2025-03-03 19:46:58,569 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.642857142857142) internal successors, (242), 28 states have internal predecessors, (242), 9 states have call successors, (164), 4 states have call predecessors, (164), 9 states have return successors, (166), 9 states have call predecessors, (166), 9 states have call successors, (166) Word has length 470 [2025-03-03 19:46:58,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:58,641 INFO L225 Difference]: With dead ends: 33799 [2025-03-03 19:46:58,641 INFO L226 Difference]: Without dead ends: 30071 [2025-03-03 19:46:58,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1102 GetRequests, 939 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10643 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5349, Invalid=21711, Unknown=0, NotChecked=0, Total=27060 [2025-03-03 19:46:58,659 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 6850 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 2633 mSolverCounterSat, 3566 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6850 SdHoareTripleChecker+Valid, 2107 SdHoareTripleChecker+Invalid, 6199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3566 IncrementalHoareTripleChecker+Valid, 2633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:58,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6850 Valid, 2107 Invalid, 6199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3566 Valid, 2633 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-03 19:46:58,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30071 states. [2025-03-03 19:47:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30071 to 10997. [2025-03-03 19:47:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10997 states, 8290 states have (on average 1.4209891435464415) internal successors, (11780), 8385 states have internal predecessors, (11780), 2411 states have call successors, (2411), 295 states have call predecessors, (2411), 295 states have return successors, (2411), 2316 states have call predecessors, (2411), 2411 states have call successors, (2411) [2025-03-03 19:47:00,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10997 states to 10997 states and 16602 transitions. [2025-03-03 19:47:00,098 INFO L78 Accepts]: Start accepts. Automaton has 10997 states and 16602 transitions. Word has length 470 [2025-03-03 19:47:00,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:47:00,099 INFO L471 AbstractCegarLoop]: Abstraction has 10997 states and 16602 transitions. [2025-03-03 19:47:00,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.642857142857142) internal successors, (242), 28 states have internal predecessors, (242), 9 states have call successors, (164), 4 states have call predecessors, (164), 9 states have return successors, (166), 9 states have call predecessors, (166), 9 states have call successors, (166) [2025-03-03 19:47:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 10997 states and 16602 transitions. [2025-03-03 19:47:00,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-03 19:47:00,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:47:00,107 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:47:00,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 19:47:00,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 19:47:00,308 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:47:00,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:47:00,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1983840059, now seen corresponding path program 1 times [2025-03-03 19:47:00,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:47:00,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342007469] [2025-03-03 19:47:00,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:00,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:47:00,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-03 19:47:00,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-03 19:47:00,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:00,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:02,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 354 proven. 486 refuted. 0 times theorem prover too weak. 9964 trivial. 0 not checked. [2025-03-03 19:47:02,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:47:02,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342007469] [2025-03-03 19:47:02,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342007469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:47:02,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790568221] [2025-03-03 19:47:02,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:02,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:47:02,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:47:02,475 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:47:02,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 19:47:02,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-03 19:47:02,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-03 19:47:02,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:02,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:02,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 19:47:02,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:47:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 6085 proven. 486 refuted. 0 times theorem prover too weak. 4233 trivial. 0 not checked. [2025-03-03 19:47:04,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:47:08,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790568221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:47:08,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:47:08,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 28 [2025-03-03 19:47:08,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010637143] [2025-03-03 19:47:08,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:47:08,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 19:47:08,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:47:08,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 19:47:08,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 19:47:08,203 INFO L87 Difference]: Start difference. First operand 10997 states and 16602 transitions. Second operand has 28 states, 26 states have (on average 7.230769230769231) internal successors, (188), 28 states have internal predecessors, (188), 9 states have call successors, (121), 5 states have call predecessors, (121), 8 states have return successors, (121), 8 states have call predecessors, (121), 9 states have call successors, (121)