./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/mapsum5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-crafted/mapsum5.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 547252845d807a057f585b63b3488b50cdb63f4784535b1d9fe87f3af67ef42c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:31:30,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:31:31,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:31:31,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:31:31,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:31:31,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:31:31,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:31:31,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:31:31,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:31:31,065 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:31:31,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:31:31,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:31:31,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:31:31,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:31:31,067 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:31:31,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:31:31,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:31:31,067 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:31:31,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:31:31,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:31:31,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:31:31,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:31:31,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:31:31,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:31:31,068 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:31:31,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:31:31,068 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:31:31,068 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:31:31,068 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:31:31,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:31:31,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:31:31,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:31:31,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:31:31,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:31:31,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:31:31,069 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:31:31,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:31:31,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:31:31,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:31:31,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:31:31,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:31:31,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:31:31,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:31:31,069 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 -> 547252845d807a057f585b63b3488b50cdb63f4784535b1d9fe87f3af67ef42c [2025-03-08 00:31:31,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:31:31,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:31:31,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:31:31,284 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:31:31,284 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:31:31,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/mapsum5.i [2025-03-08 00:31:32,390 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb0ca41e5/1e98b2d05e8245fcb8606d3bfbb7ac0f/FLAGec6632a49 [2025-03-08 00:31:32,586 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:31:32,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/mapsum5.i [2025-03-08 00:31:32,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb0ca41e5/1e98b2d05e8245fcb8606d3bfbb7ac0f/FLAGec6632a49 [2025-03-08 00:31:32,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb0ca41e5/1e98b2d05e8245fcb8606d3bfbb7ac0f [2025-03-08 00:31:32,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:31:32,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:31:32,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:31:32,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:31:32,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:31:32,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:31:32" (1/1) ... [2025-03-08 00:31:32,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@192a95f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:32, skipping insertion in model container [2025-03-08 00:31:32,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:31:32" (1/1) ... [2025-03-08 00:31:32,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:31:33,085 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/array-crafted/mapsum5.i[1380,1393] [2025-03-08 00:31:33,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:31:33,094 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:31:33,106 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/array-crafted/mapsum5.i[1380,1393] [2025-03-08 00:31:33,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:31:33,116 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:31:33,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:33 WrapperNode [2025-03-08 00:31:33,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:31:33,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:31:33,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:31:33,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:31:33,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:33" (1/1) ... [2025-03-08 00:31:33,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:33" (1/1) ... [2025-03-08 00:31:33,137 INFO L138 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2025-03-08 00:31:33,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:31:33,138 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:31:33,138 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:31:33,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:31:33,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:33" (1/1) ... [2025-03-08 00:31:33,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:33" (1/1) ... [2025-03-08 00:31:33,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:33" (1/1) ... [2025-03-08 00:31:33,153 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-08 00:31:33,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:33" (1/1) ... [2025-03-08 00:31:33,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:33" (1/1) ... [2025-03-08 00:31:33,157 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:33" (1/1) ... [2025-03-08 00:31:33,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:33" (1/1) ... [2025-03-08 00:31:33,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:33" (1/1) ... [2025-03-08 00:31:33,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:33" (1/1) ... [2025-03-08 00:31:33,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:31:33,160 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:31:33,160 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:31:33,160 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:31:33,161 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:33" (1/1) ... [2025-03-08 00:31:33,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:31:33,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:33,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:31:33,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:31:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:31:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure mapsum [2025-03-08 00:31:33,207 INFO L138 BoogieDeclarations]: Found implementation of procedure mapsum [2025-03-08 00:31:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:31:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:31:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:31:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:31:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:31:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:31:33,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:31:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:31:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:31:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:31:33,265 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:31:33,267 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:31:33,398 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 00:31:33,398 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:31:33,405 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:31:33,406 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:31:33,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:31:33 BoogieIcfgContainer [2025-03-08 00:31:33,406 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:31:33,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:31:33,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:31:33,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:31:33,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:31:32" (1/3) ... [2025-03-08 00:31:33,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d053eb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:31:33, skipping insertion in model container [2025-03-08 00:31:33,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:33" (2/3) ... [2025-03-08 00:31:33,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d053eb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:31:33, skipping insertion in model container [2025-03-08 00:31:33,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:31:33" (3/3) ... [2025-03-08 00:31:33,416 INFO L128 eAbstractionObserver]: Analyzing ICFG mapsum5.i [2025-03-08 00:31:33,432 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:31:33,433 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mapsum5.i that has 2 procedures, 23 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 00:31:33,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:31:33,497 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;@596bfc73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:31:33,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:31:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:31:33,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:33,507 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:33,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:33,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:33,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1022978359, now seen corresponding path program 1 times [2025-03-08 00:31:33,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:33,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121383541] [2025-03-08 00:31:33,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:31:33,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:33,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:31:33,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:31:33,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:31:33,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:33,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:31:33,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:33,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121383541] [2025-03-08 00:31:33,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121383541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:31:33,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:31:33,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:31:33,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926543893] [2025-03-08 00:31:33,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:31:33,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:31:33,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:33,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:31:33,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:31:33,781 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:31:33,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:33,815 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2025-03-08 00:31:33,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:31:33,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-03-08 00:31:33,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:33,820 INFO L225 Difference]: With dead ends: 43 [2025-03-08 00:31:33,820 INFO L226 Difference]: Without dead ends: 19 [2025-03-08 00:31:33,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:31:33,823 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:33,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:31:33,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-08 00:31:33,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-08 00:31:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-08 00:31:33,847 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 25 [2025-03-08 00:31:33,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:33,847 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-08 00:31:33,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:31:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-08 00:31:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 00:31:33,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:33,848 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:33,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:31:33,849 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:33,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:33,849 INFO L85 PathProgramCache]: Analyzing trace with hash -599441184, now seen corresponding path program 1 times [2025-03-08 00:31:33,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:33,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344961640] [2025-03-08 00:31:33,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:31:33,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:33,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 00:31:33,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:31:33,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:31:33,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:33,972 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:31:33,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:33,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344961640] [2025-03-08 00:31:33,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344961640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:33,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306225107] [2025-03-08 00:31:33,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:31:33,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:33,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:33,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:31:33,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:31:34,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 00:31:34,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:31:34,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:31:34,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:34,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:31:34,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:31:34,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:31:34,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306225107] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:34,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:34,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-03-08 00:31:34,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145084806] [2025-03-08 00:31:34,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:34,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:31:34,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:34,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:31:34,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:31:34,154 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:31:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:34,211 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2025-03-08 00:31:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:31:34,211 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 26 [2025-03-08 00:31:34,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:34,212 INFO L225 Difference]: With dead ends: 35 [2025-03-08 00:31:34,212 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 00:31:34,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:31:34,213 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:34,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 52 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:31:34,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 00:31:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-08 00:31:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-08 00:31:34,216 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 26 [2025-03-08 00:31:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:34,216 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-08 00:31:34,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:31:34,217 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-03-08 00:31:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:31:34,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:34,217 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:34,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:31:34,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:34,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:34,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:34,423 INFO L85 PathProgramCache]: Analyzing trace with hash 134561754, now seen corresponding path program 1 times [2025-03-08 00:31:34,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:34,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277075400] [2025-03-08 00:31:34,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:31:34,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:34,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 00:31:34,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:31:34,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:31:34,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 00:31:34,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:34,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277075400] [2025-03-08 00:31:34,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277075400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:31:34,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:31:34,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:31:34,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024821917] [2025-03-08 00:31:34,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:31:34,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:31:34,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:34,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:31:34,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:31:34,548 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:31:34,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:34,581 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2025-03-08 00:31:34,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:31:34,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-08 00:31:34,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:34,582 INFO L225 Difference]: With dead ends: 32 [2025-03-08 00:31:34,582 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 00:31:34,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:31:34,583 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:34,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 22 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:31:34,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 00:31:34,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-08 00:31:34,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:34,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-08 00:31:34,589 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 30 [2025-03-08 00:31:34,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:34,590 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-08 00:31:34,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:31:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-03-08 00:31:34,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:31:34,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:34,593 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:34,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:31:34,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:34,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:34,593 INFO L85 PathProgramCache]: Analyzing trace with hash 919299825, now seen corresponding path program 1 times [2025-03-08 00:31:34,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:34,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384080455] [2025-03-08 00:31:34,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:31:34,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:34,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 00:31:34,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:31:34,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:31:34,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:34,704 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:31:34,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:34,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384080455] [2025-03-08 00:31:34,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384080455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:34,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145241937] [2025-03-08 00:31:34,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:31:34,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:34,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:34,709 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:31:34,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:31:34,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 00:31:34,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:31:34,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:31:34,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:34,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:31:34,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 00:31:34,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:34,907 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:31:34,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145241937] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:34,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:34,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-03-08 00:31:34,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718365184] [2025-03-08 00:31:34,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:34,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:31:34,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:34,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:31:34,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:31:34,910 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:31:34,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:34,964 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2025-03-08 00:31:34,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:31:34,965 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 31 [2025-03-08 00:31:34,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:34,965 INFO L225 Difference]: With dead ends: 38 [2025-03-08 00:31:34,965 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 00:31:34,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:31:34,966 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:34,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 50 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:31:34,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 00:31:34,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-08 00:31:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-08 00:31:34,972 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 31 [2025-03-08 00:31:34,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:34,972 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-08 00:31:34,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:31:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-08 00:31:34,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:31:34,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:34,973 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:34,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 00:31:35,173 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,SelfDestructingSolverStorable3 [2025-03-08 00:31:35,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:35,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:35,174 INFO L85 PathProgramCache]: Analyzing trace with hash 263345896, now seen corresponding path program 2 times [2025-03-08 00:31:35,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:35,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310998154] [2025-03-08 00:31:35,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:31:35,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:35,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 00:31:35,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:31:35,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:31:35,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:42,890 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 33 refuted. 2 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:31:42,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:42,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310998154] [2025-03-08 00:31:42,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310998154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:42,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919901211] [2025-03-08 00:31:42,890 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:31:42,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:42,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:42,892 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:31:42,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:31:42,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 00:31:43,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:31:43,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:31:43,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:43,048 WARN L254 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-08 00:31:43,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:43,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:31:43,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:31:43,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2025-03-08 00:31:43,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:31:43,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 69 [2025-03-08 00:31:43,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:31:43,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 82 [2025-03-08 00:31:44,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:31:44,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 89 [2025-03-08 00:31:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:31:45,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:47,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 143 [2025-03-08 00:31:47,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:31:47,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 170 [2025-03-08 00:31:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 37 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:31:47,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919901211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:47,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:47,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 23] total 57 [2025-03-08 00:31:47,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584322740] [2025-03-08 00:31:47,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:47,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-08 00:31:47,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:47,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-08 00:31:47,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=2897, Unknown=1, NotChecked=0, Total=3192 [2025-03-08 00:31:47,927 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 57 states, 50 states have (on average 1.22) internal successors, (61), 48 states have internal predecessors, (61), 7 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-08 00:31:48,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:48,707 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2025-03-08 00:31:48,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 00:31:48,708 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 50 states have (on average 1.22) internal successors, (61), 48 states have internal predecessors, (61), 7 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) Word has length 34 [2025-03-08 00:31:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:48,710 INFO L225 Difference]: With dead ends: 61 [2025-03-08 00:31:48,711 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 00:31:48,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=327, Invalid=3094, Unknown=1, NotChecked=0, Total=3422 [2025-03-08 00:31:48,713 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:48,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 214 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 00:31:48,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 00:31:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2025-03-08 00:31:48,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-08 00:31:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2025-03-08 00:31:48,730 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 34 [2025-03-08 00:31:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:48,730 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-03-08 00:31:48,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 50 states have (on average 1.22) internal successors, (61), 48 states have internal predecessors, (61), 7 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-08 00:31:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2025-03-08 00:31:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:31:48,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:48,731 INFO L218 NwaCegarLoop]: trace histogram [7, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:48,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:31:48,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:48,934 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:48,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:48,935 INFO L85 PathProgramCache]: Analyzing trace with hash 352795005, now seen corresponding path program 3 times [2025-03-08 00:31:48,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:48,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748757312] [2025-03-08 00:31:48,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:31:48,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:48,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 5 equivalence classes. [2025-03-08 00:31:48,970 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 35 statements. [2025-03-08 00:31:48,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:31:48,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:31:49,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:49,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748757312] [2025-03-08 00:31:49,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748757312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:49,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748886033] [2025-03-08 00:31:49,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:31:49,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:49,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:49,046 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:31:49,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:31:49,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 5 equivalence classes. [2025-03-08 00:31:49,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 35 statements. [2025-03-08 00:31:49,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:31:49,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:49,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:31:49,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:31:49,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:31:49,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748886033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:49,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:49,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2025-03-08 00:31:49,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095745001] [2025-03-08 00:31:49,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:49,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:31:49,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:49,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:31:49,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:31:49,266 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:31:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:49,400 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2025-03-08 00:31:49,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:31:49,401 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 35 [2025-03-08 00:31:49,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:49,402 INFO L225 Difference]: With dead ends: 72 [2025-03-08 00:31:49,402 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 00:31:49,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-03-08 00:31:49,403 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:49,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 127 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:31:49,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 00:31:49,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 24. [2025-03-08 00:31:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-03-08 00:31:49,411 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 35 [2025-03-08 00:31:49,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:49,411 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-03-08 00:31:49,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:31:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-03-08 00:31:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:31:49,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:49,413 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:49,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 00:31:49,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:49,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:49,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:49,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1732513119, now seen corresponding path program 4 times [2025-03-08 00:31:49,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:49,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894174617] [2025-03-08 00:31:49,614 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:31:49,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:49,621 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-03-08 00:31:49,632 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:31:49,632 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:31:49,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 00:31:49,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:49,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894174617] [2025-03-08 00:31:49,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894174617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:49,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205431628] [2025-03-08 00:31:49,712 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:31:49,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:49,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:49,714 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-08 00:31:49,716 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-08 00:31:49,754 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-03-08 00:31:49,773 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:31:49,773 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:31:49,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:49,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:31:49,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:49,821 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:31:49,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 00:31:49,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205431628] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:49,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:49,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-03-08 00:31:49,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37983227] [2025-03-08 00:31:49,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:49,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:31:49,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:49,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:31:49,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:31:49,868 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:31:49,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:49,911 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-03-08 00:31:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:31:49,911 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 35 [2025-03-08 00:31:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:49,912 INFO L225 Difference]: With dead ends: 36 [2025-03-08 00:31:49,912 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 00:31:49,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:31:49,913 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:49,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:31:49,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 00:31:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-08 00:31:49,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-08 00:31:49,916 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 35 [2025-03-08 00:31:49,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:49,916 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-08 00:31:49,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:31:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-08 00:31:49,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 00:31:49,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:49,917 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:49,923 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-08 00:31:50,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:50,117 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:50,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:50,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1758372224, now seen corresponding path program 5 times [2025-03-08 00:31:50,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:50,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191546329] [2025-03-08 00:31:50,118 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:31:50,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:50,124 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 5 equivalence classes. [2025-03-08 00:31:50,129 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 24 of 36 statements. [2025-03-08 00:31:50,130 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 00:31:50,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:50,176 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 00:31:50,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:50,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191546329] [2025-03-08 00:31:50,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191546329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:50,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547550355] [2025-03-08 00:31:50,177 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:31:50,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:50,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:50,179 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-08 00:31:50,180 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-08 00:31:50,215 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 5 equivalence classes. [2025-03-08 00:31:50,232 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 24 of 36 statements. [2025-03-08 00:31:50,232 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 00:31:50,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:50,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:31:50,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 00:31:50,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 00:31:50,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547550355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:50,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:50,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2025-03-08 00:31:50,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853176112] [2025-03-08 00:31:50,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:50,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:31:50,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:50,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:31:50,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:31:50,350 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:31:50,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:50,422 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2025-03-08 00:31:50,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:31:50,422 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2025-03-08 00:31:50,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:50,423 INFO L225 Difference]: With dead ends: 53 [2025-03-08 00:31:50,423 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 00:31:50,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:31:50,424 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:50,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:31:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 00:31:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2025-03-08 00:31:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 00:31:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-03-08 00:31:50,430 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 36 [2025-03-08 00:31:50,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:50,430 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-03-08 00:31:50,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:31:50,430 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2025-03-08 00:31:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:31:50,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:50,431 INFO L218 NwaCegarLoop]: trace histogram [8, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:50,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 00:31:50,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:50,636 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:50,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:50,637 INFO L85 PathProgramCache]: Analyzing trace with hash -542157868, now seen corresponding path program 6 times [2025-03-08 00:31:50,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:50,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198271547] [2025-03-08 00:31:50,637 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:31:50,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:50,643 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 6 equivalence classes. [2025-03-08 00:31:50,654 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 36 of 38 statements. [2025-03-08 00:31:50,654 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-08 00:31:50,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 00:31:50,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:50,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198271547] [2025-03-08 00:31:50,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198271547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:50,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846614758] [2025-03-08 00:31:50,797 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:31:50,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:50,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:50,799 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:31:50,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:31:50,852 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 6 equivalence classes. [2025-03-08 00:31:50,880 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 36 of 38 statements. [2025-03-08 00:31:50,881 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-08 00:31:50,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:50,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:31:50,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:50,971 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 31 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 00:31:50,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 31 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 00:31:51,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846614758] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:51,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:51,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2025-03-08 00:31:51,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962302099] [2025-03-08 00:31:51,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:51,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 00:31:51,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:51,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 00:31:51,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:31:51,100 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:31:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:51,192 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2025-03-08 00:31:51,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:31:51,193 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2025-03-08 00:31:51,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:51,194 INFO L225 Difference]: With dead ends: 32 [2025-03-08 00:31:51,194 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 00:31:51,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:31:51,195 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:51,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 50 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:31:51,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 00:31:51,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-08 00:31:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-03-08 00:31:51,199 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 38 [2025-03-08 00:31:51,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:51,199 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-03-08 00:31:51,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:31:51,199 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-03-08 00:31:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 00:31:51,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:51,199 INFO L218 NwaCegarLoop]: trace histogram [9, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:51,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 00:31:51,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:51,400 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:51,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:51,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1151982097, now seen corresponding path program 7 times [2025-03-08 00:31:51,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:51,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691294708] [2025-03-08 00:31:51,400 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:31:51,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:51,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 00:31:51,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:31:51,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:31:51,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat