./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/max05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/reducercommutativity/max05-1.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 4e48915cf0eaefe43320bbe59bf88f5c68b2f305d293e808fa6ece9112b5c238 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 13:31:29,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 13:31:29,136 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 13:31:29,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 13:31:29,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 13:31:29,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 13:31:29,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 13:31:29,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 13:31:29,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 13:31:29,166 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 13:31:29,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 13:31:29,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 13:31:29,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 13:31:29,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 13:31:29,168 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 13:31:29,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 13:31:29,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 13:31:29,168 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 13:31:29,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 13:31:29,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 13:31:29,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 13:31:29,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 13:31:29,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 13:31:29,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 13:31:29,169 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 13:31:29,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 13:31:29,169 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 13:31:29,169 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 13:31:29,169 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 13:31:29,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 13:31:29,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 13:31:29,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 13:31:29,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:31:29,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 13:31:29,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 13:31:29,169 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 13:31:29,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 13:31:29,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 13:31:29,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 13:31:29,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 13:31:29,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 13:31:29,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 13:31:29,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 13:31:29,170 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 -> 4e48915cf0eaefe43320bbe59bf88f5c68b2f305d293e808fa6ece9112b5c238 [2025-03-16 13:31:29,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 13:31:29,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 13:31:29,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 13:31:29,396 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 13:31:29,396 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 13:31:29,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max05-1.i [2025-03-16 13:31:30,576 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ae46fcf/471229ed36114bc295ea89172d592fbd/FLAG198c5d5ec [2025-03-16 13:31:30,803 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 13:31:30,803 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max05-1.i [2025-03-16 13:31:30,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ae46fcf/471229ed36114bc295ea89172d592fbd/FLAG198c5d5ec [2025-03-16 13:31:30,834 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ae46fcf/471229ed36114bc295ea89172d592fbd [2025-03-16 13:31:30,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 13:31:30,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 13:31:30,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 13:31:30,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 13:31:30,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 13:31:30,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:31:30" (1/1) ... [2025-03-16 13:31:30,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d748f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:30, skipping insertion in model container [2025-03-16 13:31:30,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:31:30" (1/1) ... [2025-03-16 13:31:30,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 13:31:30,975 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/reducercommutativity/max05-1.i[1284,1297] [2025-03-16 13:31:30,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:31:30,989 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 13:31:31,007 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/reducercommutativity/max05-1.i[1284,1297] [2025-03-16 13:31:31,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:31:31,024 INFO L204 MainTranslator]: Completed translation [2025-03-16 13:31:31,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:31 WrapperNode [2025-03-16 13:31:31,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 13:31:31,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 13:31:31,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 13:31:31,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 13:31:31,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:31" (1/1) ... [2025-03-16 13:31:31,036 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:31" (1/1) ... [2025-03-16 13:31:31,050 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2025-03-16 13:31:31,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 13:31:31,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 13:31:31,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 13:31:31,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 13:31:31,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:31" (1/1) ... [2025-03-16 13:31:31,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:31" (1/1) ... [2025-03-16 13:31:31,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:31" (1/1) ... [2025-03-16 13:31:31,071 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 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-16 13:31:31,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:31" (1/1) ... [2025-03-16 13:31:31,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:31" (1/1) ... [2025-03-16 13:31:31,076 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:31" (1/1) ... [2025-03-16 13:31:31,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:31" (1/1) ... [2025-03-16 13:31:31,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:31" (1/1) ... [2025-03-16 13:31:31,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:31" (1/1) ... [2025-03-16 13:31:31,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 13:31:31,080 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 13:31:31,080 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 13:31:31,080 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 13:31:31,084 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:31" (1/1) ... [2025-03-16 13:31:31,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:31:31,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:31,113 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-16 13:31:31,116 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-16 13:31:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 13:31:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure max [2025-03-16 13:31:31,135 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2025-03-16 13:31:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 13:31:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 13:31:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 13:31:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 13:31:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 13:31:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 13:31:31,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 13:31:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 13:31:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 13:31:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 13:31:31,198 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 13:31:31,200 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 13:31:31,312 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-03-16 13:31:31,319 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-16 13:31:31,319 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 13:31:31,325 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 13:31:31,325 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 13:31:31,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:31:31 BoogieIcfgContainer [2025-03-16 13:31:31,326 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 13:31:31,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 13:31:31,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 13:31:31,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 13:31:31,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 01:31:30" (1/3) ... [2025-03-16 13:31:31,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d71b709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:31:31, skipping insertion in model container [2025-03-16 13:31:31,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:31" (2/3) ... [2025-03-16 13:31:31,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d71b709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:31:31, skipping insertion in model container [2025-03-16 13:31:31,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:31:31" (3/3) ... [2025-03-16 13:31:31,333 INFO L128 eAbstractionObserver]: Analyzing ICFG max05-1.i [2025-03-16 13:31:31,342 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 13:31:31,344 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG max05-1.i that has 2 procedures, 22 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-16 13:31:31,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 13:31:31,394 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;@29f61a31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 13:31:31,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 13:31:31,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 17 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-16 13:31:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 13:31:31,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:31,403 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:31,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:31,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:31,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1091540240, now seen corresponding path program 1 times [2025-03-16 13:31:31,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:31,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367438234] [2025-03-16 13:31:31,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:31,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:31,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 13:31:31,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 13:31:31,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:31,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:31,646 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-16 13:31:31,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:31,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367438234] [2025-03-16 13:31:31,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367438234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:31:31,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:31:31,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 13:31:31,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228233756] [2025-03-16 13:31:31,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:31:31,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:31:31,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:31,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:31:31,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 13:31:31,674 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 17 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) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-16 13:31:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:31,698 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2025-03-16 13:31:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:31:31,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 23 [2025-03-16 13:31:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:31,709 INFO L225 Difference]: With dead ends: 43 [2025-03-16 13:31:31,709 INFO L226 Difference]: Without dead ends: 19 [2025-03-16 13:31:31,711 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-16 13:31:31,714 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:31,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:31,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-16 13:31:31,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-16 13:31:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-16 13:31:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-03-16 13:31:31,742 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 23 [2025-03-16 13:31:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:31,742 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-03-16 13:31:31,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-16 13:31:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2025-03-16 13:31:31,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 13:31:31,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:31,745 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:31,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 13:31:31,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:31,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:31,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1726708840, now seen corresponding path program 1 times [2025-03-16 13:31:31,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:31,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402803891] [2025-03-16 13:31:31,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:31,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:31,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 13:31:31,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 13:31:31,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:31,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:31,883 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-16 13:31:31,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:31,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402803891] [2025-03-16 13:31:31,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402803891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:31,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263434015] [2025-03-16 13:31:31,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:31,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:31,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:31,888 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-16 13:31:31,890 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-16 13:31:31,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 13:31:31,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 13:31:31,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:31,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:31,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 13:31:31,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 13:31:32,003 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 13:31:32,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263434015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:31:32,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 13:31:32,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 13:31:32,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604534179] [2025-03-16 13:31:32,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:31:32,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:31:32,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:32,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:31:32,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:31:32,006 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:31:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:32,021 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2025-03-16 13:31:32,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:31:32,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2025-03-16 13:31:32,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:32,022 INFO L225 Difference]: With dead ends: 37 [2025-03-16 13:31:32,023 INFO L226 Difference]: Without dead ends: 22 [2025-03-16 13:31:32,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:31:32,023 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:32,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 38 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:32,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-16 13:31:32,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-03-16 13:31:32,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-16 13:31:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-03-16 13:31:32,027 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 24 [2025-03-16 13:31:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:32,027 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-16 13:31:32,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:31:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-03-16 13:31:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 13:31:32,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:32,028 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:32,034 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-16 13:31:32,228 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-16 13:31:32,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:32,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:32,229 INFO L85 PathProgramCache]: Analyzing trace with hash 475225173, now seen corresponding path program 1 times [2025-03-16 13:31:32,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:32,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077502722] [2025-03-16 13:31:32,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:32,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:32,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 13:31:32,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 13:31:32,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:32,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 13:31:32,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:32,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077502722] [2025-03-16 13:31:32,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077502722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:32,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218334290] [2025-03-16 13:31:32,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:32,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:32,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:32,338 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-16 13:31:32,339 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-16 13:31:32,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 13:31:32,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 13:31:32,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:32,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:32,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 13:31:32,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 13:31:32,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 13:31:32,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218334290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:31:32,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 13:31:32,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 13:31:32,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246132598] [2025-03-16 13:31:32,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:31:32,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:31:32,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:32,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:31:32,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:31:32,434 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:31:32,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:32,441 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2025-03-16 13:31:32,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:31:32,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-03-16 13:31:32,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:32,442 INFO L225 Difference]: With dead ends: 33 [2025-03-16 13:31:32,442 INFO L226 Difference]: Without dead ends: 21 [2025-03-16 13:31:32,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:31:32,443 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:32,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-16 13:31:32,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-16 13:31:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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-16 13:31:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-03-16 13:31:32,446 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 33 [2025-03-16 13:31:32,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:32,447 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-16 13:31:32,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:31:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2025-03-16 13:31:32,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 13:31:32,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:32,448 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:32,453 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-16 13:31:32,648 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,SelfDestructingSolverStorable2 [2025-03-16 13:31:32,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:32,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:32,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1988187491, now seen corresponding path program 1 times [2025-03-16 13:31:32,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:32,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173043818] [2025-03-16 13:31:32,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:32,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:32,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 13:31:32,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 13:31:32,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:32,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:32,736 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 13:31:32,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:32,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173043818] [2025-03-16 13:31:32,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173043818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:32,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70280212] [2025-03-16 13:31:32,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:32,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:32,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:32,740 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-16 13:31:32,741 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-16 13:31:32,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 13:31:32,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 13:31:32,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:32,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:32,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 13:31:32,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 13:31:32,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 13:31:32,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70280212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:31:32,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:31:32,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-03-16 13:31:32,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063400938] [2025-03-16 13:31:32,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:32,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 13:31:32,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:32,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 13:31:32,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 13:31:32,877 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 13:31:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:32,888 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2025-03-16 13:31:32,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 13:31:32,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 34 [2025-03-16 13:31:32,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:32,889 INFO L225 Difference]: With dead ends: 42 [2025-03-16 13:31:32,889 INFO L226 Difference]: Without dead ends: 24 [2025-03-16 13:31:32,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 13:31:32,889 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:32,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:32,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-16 13:31:32,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-16 13:31:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 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-16 13:31:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-03-16 13:31:32,892 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 34 [2025-03-16 13:31:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:32,892 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-03-16 13:31:32,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 13:31:32,892 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-03-16 13:31:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 13:31:32,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:32,893 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:32,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 13:31:33,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:33,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:33,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:33,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1132745227, now seen corresponding path program 2 times [2025-03-16 13:31:33,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:33,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361566067] [2025-03-16 13:31:33,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:31:33,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:33,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-16 13:31:33,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:31:33,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:31:33,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 13:31:33,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:33,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361566067] [2025-03-16 13:31:33,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361566067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:33,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482331774] [2025-03-16 13:31:33,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:31:33,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:33,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:33,199 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-16 13:31:33,200 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-16 13:31:33,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-16 13:31:33,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:31:33,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:31:33,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:33,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 13:31:33,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 13:31:33,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:33,380 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 13:31:33,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482331774] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:31:33,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:31:33,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 7] total 9 [2025-03-16 13:31:33,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770703889] [2025-03-16 13:31:33,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:33,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 13:31:33,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:33,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 13:31:33,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-16 13:31:33,381 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 13:31:33,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:33,402 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2025-03-16 13:31:33,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 13:31:33,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 37 [2025-03-16 13:31:33,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:33,403 INFO L225 Difference]: With dead ends: 48 [2025-03-16 13:31:33,403 INFO L226 Difference]: Without dead ends: 30 [2025-03-16 13:31:33,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-16 13:31:33,404 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:33,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 87 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-16 13:31:33,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-03-16 13:31:33,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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-16 13:31:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-03-16 13:31:33,407 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 37 [2025-03-16 13:31:33,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:33,407 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-16 13:31:33,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 13:31:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-03-16 13:31:33,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 13:31:33,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:33,407 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:33,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 13:31:33,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:33,608 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:33,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:33,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1067545148, now seen corresponding path program 3 times [2025-03-16 13:31:33,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:33,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300569009] [2025-03-16 13:31:33,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:31:33,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:33,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 6 equivalence classes. [2025-03-16 13:31:33,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 47 statements. [2025-03-16 13:31:33,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 13:31:33,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 38 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-16 13:31:33,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:33,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300569009] [2025-03-16 13:31:33,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300569009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:33,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646890543] [2025-03-16 13:31:33,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:31:33,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:33,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:33,688 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-16 13:31:33,689 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-16 13:31:33,734 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 6 equivalence classes. [2025-03-16 13:31:33,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 47 statements. [2025-03-16 13:31:33,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 13:31:33,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:33,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 13:31:33,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 38 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-16 13:31:33,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 38 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-16 13:31:33,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646890543] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:31:33,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:31:33,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-16 13:31:33,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243513284] [2025-03-16 13:31:33,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:33,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 13:31:33,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:33,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 13:31:33,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-16 13:31:33,819 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 13:31:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:33,853 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2025-03-16 13:31:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 13:31:33,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-16 13:31:33,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:33,854 INFO L225 Difference]: With dead ends: 57 [2025-03-16 13:31:33,854 INFO L226 Difference]: Without dead ends: 37 [2025-03-16 13:31:33,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-16 13:31:33,855 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:33,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 76 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:33,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-16 13:31:33,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-16 13:31:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 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-16 13:31:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2025-03-16 13:31:33,862 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 47 [2025-03-16 13:31:33,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:33,863 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2025-03-16 13:31:33,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 13:31:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2025-03-16 13:31:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 13:31:33,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:33,865 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:33,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 13:31:34,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:34,066 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:34,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:34,066 INFO L85 PathProgramCache]: Analyzing trace with hash -699967139, now seen corresponding path program 4 times [2025-03-16 13:31:34,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:34,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017299946] [2025-03-16 13:31:34,066 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:31:34,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:34,084 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 74 statements into 2 equivalence classes. [2025-03-16 13:31:34,108 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 13:31:34,108 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 13:31:34,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2025-03-16 13:31:34,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:34,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017299946] [2025-03-16 13:31:34,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017299946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:34,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944020570] [2025-03-16 13:31:34,174 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:31:34,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:34,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:34,176 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-16 13:31:34,177 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-16 13:31:34,228 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 74 statements into 2 equivalence classes. [2025-03-16 13:31:34,264 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 13:31:34,264 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 13:31:34,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:34,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 13:31:34,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 178 proven. 1 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-16 13:31:34,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:34,308 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2025-03-16 13:31:34,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944020570] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:31:34,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:31:34,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 13:31:34,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428273379] [2025-03-16 13:31:34,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:34,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 13:31:34,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:34,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 13:31:34,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 13:31:34,310 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 13:31:34,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:34,323 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2025-03-16 13:31:34,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 13:31:34,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 74 [2025-03-16 13:31:34,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:34,325 INFO L225 Difference]: With dead ends: 64 [2025-03-16 13:31:34,325 INFO L226 Difference]: Without dead ends: 40 [2025-03-16 13:31:34,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 13:31:34,326 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:34,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:34,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-16 13:31:34,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-16 13:31:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 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-16 13:31:34,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2025-03-16 13:31:34,335 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 74 [2025-03-16 13:31:34,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:34,335 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-03-16 13:31:34,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 13:31:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2025-03-16 13:31:34,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 13:31:34,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:34,338 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:34,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 13:31:34,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:34,539 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:34,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:34,540 INFO L85 PathProgramCache]: Analyzing trace with hash -529698539, now seen corresponding path program 5 times [2025-03-16 13:31:34,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:34,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053570341] [2025-03-16 13:31:34,540 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:31:34,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:34,554 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 77 statements into 12 equivalence classes. [2025-03-16 13:31:34,668 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 13:31:34,670 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-16 13:31:34,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 153 proven. 189 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-16 13:31:37,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:37,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053570341] [2025-03-16 13:31:37,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053570341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:37,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114413620] [2025-03-16 13:31:37,068 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:31:37,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:37,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:37,070 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-16 13:31:37,071 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-16 13:31:37,122 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 77 statements into 12 equivalence classes. [2025-03-16 13:31:37,230 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 13:31:37,230 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-16 13:31:37,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:37,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-16 13:31:37,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:37,277 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 19 treesize of output 1 [2025-03-16 13:31:37,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:31:37,483 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 58 treesize of output 20 [2025-03-16 13:31:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 227 proven. 80 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-16 13:31:37,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:38,426 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 102 proven. 202 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-16 13:31:38,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114413620] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:31:38,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:31:38,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 16, 14] total 57 [2025-03-16 13:31:38,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103341179] [2025-03-16 13:31:38,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:38,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-16 13:31:38,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:38,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-16 13:31:38,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=2825, Unknown=0, NotChecked=0, Total=3192 [2025-03-16 13:31:38,429 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 57 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 states have internal predecessors, (107), 6 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-16 13:31:41,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:41,339 INFO L93 Difference]: Finished difference Result 203 states and 256 transitions. [2025-03-16 13:31:41,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-03-16 13:31:41,340 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 states have internal predecessors, (107), 6 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 77 [2025-03-16 13:31:41,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:41,342 INFO L225 Difference]: With dead ends: 203 [2025-03-16 13:31:41,342 INFO L226 Difference]: Without dead ends: 142 [2025-03-16 13:31:41,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5192 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2071, Invalid=14699, Unknown=0, NotChecked=0, Total=16770 [2025-03-16 13:31:41,348 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 127 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:41,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 250 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1594 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 13:31:41,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-16 13:31:41,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 100. [2025-03-16 13:31:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 92 states have internal predecessors, (112), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-16 13:31:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 135 transitions. [2025-03-16 13:31:41,372 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 135 transitions. Word has length 77 [2025-03-16 13:31:41,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:41,372 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 135 transitions. [2025-03-16 13:31:41,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 states have internal predecessors, (107), 6 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-16 13:31:41,373 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 135 transitions. [2025-03-16 13:31:41,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 13:31:41,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:41,377 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:41,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 13:31:41,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:41,578 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:41,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:41,579 INFO L85 PathProgramCache]: Analyzing trace with hash -978395178, now seen corresponding path program 1 times [2025-03-16 13:31:41,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:41,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876269806] [2025-03-16 13:31:41,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:41,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:41,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 13:31:41,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 13:31:41,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:41,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:44,102 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 44 proven. 336 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 13:31:44,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:44,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876269806] [2025-03-16 13:31:44,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876269806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:44,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920971405] [2025-03-16 13:31:44,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:44,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:44,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:44,105 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:31:44,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 13:31:44,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 13:31:44,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 13:31:44,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:44,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:44,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-03-16 13:31:44,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:44,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:31:44,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 40 [2025-03-16 13:31:44,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:31:44,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 37 [2025-03-16 13:31:44,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:31:44,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 30 [2025-03-16 13:31:44,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:31:44,995 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 49 treesize of output 25 [2025-03-16 13:31:45,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:31:45,043 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 40 treesize of output 20 [2025-03-16 13:31:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 180 proven. 180 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-16 13:31:45,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:46,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:31:46,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 1 [2025-03-16 13:31:47,324 INFO L349 Elim1Store]: treesize reduction 19, result has 85.4 percent of original size [2025-03-16 13:31:47,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 131 [2025-03-16 13:31:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 202 proven. 142 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-16 13:31:47,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920971405] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:31:47,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:31:47,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 30] total 93 [2025-03-16 13:31:47,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967447255] [2025-03-16 13:31:47,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:47,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2025-03-16 13:31:47,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:47,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2025-03-16 13:31:47,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=8135, Unknown=0, NotChecked=0, Total=8556 [2025-03-16 13:31:47,513 INFO L87 Difference]: Start difference. First operand 100 states and 135 transitions. Second operand has 93 states, 90 states have (on average 1.7222222222222223) internal successors, (155), 89 states have internal predecessors, (155), 6 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-16 13:32:13,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-16 13:32:17,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-16 13:32:34,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-16 13:32:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:58,540 INFO L93 Difference]: Finished difference Result 742 states and 1100 transitions. [2025-03-16 13:32:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2025-03-16 13:32:58,541 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 90 states have (on average 1.7222222222222223) internal successors, (155), 89 states have internal predecessors, (155), 6 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 77 [2025-03-16 13:32:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:58,545 INFO L225 Difference]: With dead ends: 742 [2025-03-16 13:32:58,545 INFO L226 Difference]: Without dead ends: 633 [2025-03-16 13:32:58,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23210 ImplicationChecksByTransitivity, 57.7s TimeCoverageRelationStatistics Valid=4382, Invalid=66102, Unknown=6, NotChecked=0, Total=70490 [2025-03-16 13:32:58,555 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 244 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 6647 mSolverCounterSat, 104 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 6754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 6647 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:58,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 1132 Invalid, 6754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 6647 Invalid, 3 Unknown, 0 Unchecked, 15.9s Time] [2025-03-16 13:32:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-16 13:32:58,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 374. [2025-03-16 13:32:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 330 states have (on average 1.312121212121212) internal successors, (433), 355 states have internal predecessors, (433), 13 states have call successors, (13), 4 states have call predecessors, (13), 30 states have return successors, (155), 14 states have call predecessors, (155), 13 states have call successors, (155) [2025-03-16 13:32:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 601 transitions. [2025-03-16 13:32:58,624 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 601 transitions. Word has length 77 [2025-03-16 13:32:58,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:58,624 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 601 transitions. [2025-03-16 13:32:58,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 90 states have (on average 1.7222222222222223) internal successors, (155), 89 states have internal predecessors, (155), 6 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-16 13:32:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 601 transitions. [2025-03-16 13:32:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 13:32:58,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:58,630 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 13, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:58,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 13:32:58,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-16 13:32:58,830 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:58,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:58,831 INFO L85 PathProgramCache]: Analyzing trace with hash 764415157, now seen corresponding path program 2 times [2025-03-16 13:32:58,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:58,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165108002] [2025-03-16 13:32:58,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:58,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:58,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-16 13:32:58,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 13:32:58,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:58,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:33:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 13 proven. 373 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 13:33:02,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:33:02,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165108002] [2025-03-16 13:33:02,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165108002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:33:02,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116920299] [2025-03-16 13:33:02,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:33:02,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:33:02,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:33:02,706 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:33:02,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 13:33:02,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-16 13:33:02,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 13:33:02,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:33:02,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:33:02,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 155 conjuncts are in the unsatisfiable core [2025-03-16 13:33:02,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:33:02,847 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-16 13:33:04,433 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-16 13:33:04,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 111 treesize of output 73