./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd989104ff103e9b5ed152f8842800410e6bde451d7ac2b024a1b80da691bd1b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:29:18,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:29:18,181 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:29:18,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:29:18,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:29:18,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:29:18,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:29:18,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:29:18,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:29:18,211 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:29:18,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:29:18,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:29:18,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:29:18,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:29:18,212 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:29:18,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:29:18,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:29:18,213 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:29:18,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:29:18,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:29:18,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:29:18,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:29:18,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:29:18,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:29:18,213 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:29:18,213 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:29:18,213 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:29:18,213 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:29:18,213 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:29:18,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:29:18,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:29:18,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:29:18,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:29:18,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:29:18,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:29:18,214 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:29:18,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:29:18,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:29:18,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:29:18,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:29:18,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:29:18,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:29:18,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:29:18,215 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 -> bd989104ff103e9b5ed152f8842800410e6bde451d7ac2b024a1b80da691bd1b [2025-03-03 21:29:18,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:29:18,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:29:18,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:29:18,474 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:29:18,477 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:29:18,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-59.i [2025-03-03 21:29:19,627 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80471c8cd/054e008e3eba43ae989568817c971b4d/FLAG2c544c5a3 [2025-03-03 21:29:19,856 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:29:19,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-59.i [2025-03-03 21:29:19,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80471c8cd/054e008e3eba43ae989568817c971b4d/FLAG2c544c5a3 [2025-03-03 21:29:20,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80471c8cd/054e008e3eba43ae989568817c971b4d [2025-03-03 21:29:20,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:29:20,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:29:20,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:29:20,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:29:20,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:29:20,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:29:20" (1/1) ... [2025-03-03 21:29:20,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191d48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:20, skipping insertion in model container [2025-03-03 21:29:20,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:29:20" (1/1) ... [2025-03-03 21:29:20,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:29:20,326 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-59.i[919,932] [2025-03-03 21:29:20,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:29:20,416 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:29:20,428 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-59.i[919,932] [2025-03-03 21:29:20,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:29:20,484 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:29:20,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:20 WrapperNode [2025-03-03 21:29:20,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:29:20,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:29:20,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:29:20,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:29:20,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:20" (1/1) ... [2025-03-03 21:29:20,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:20" (1/1) ... [2025-03-03 21:29:20,540 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2025-03-03 21:29:20,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:29:20,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:29:20,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:29:20,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:29:20,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:20" (1/1) ... [2025-03-03 21:29:20,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:20" (1/1) ... [2025-03-03 21:29:20,553 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:20" (1/1) ... [2025-03-03 21:29:20,580 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:29:20,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:20" (1/1) ... [2025-03-03 21:29:20,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:20" (1/1) ... [2025-03-03 21:29:20,591 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:20" (1/1) ... [2025-03-03 21:29:20,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:20" (1/1) ... [2025-03-03 21:29:20,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:20" (1/1) ... [2025-03-03 21:29:20,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:20" (1/1) ... [2025-03-03 21:29:20,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:29:20,608 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:29:20,608 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:29:20,608 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:29:20,609 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:20" (1/1) ... [2025-03-03 21:29:20,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:29:20,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:29:20,639 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:29:20,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:29:20,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:29:20,660 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:29:20,660 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:29:20,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:29:20,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:29:20,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:29:20,738 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:29:20,740 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:29:21,106 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 21:29:21,106 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:29:21,129 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:29:21,130 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:29:21,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:29:21 BoogieIcfgContainer [2025-03-03 21:29:21,130 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:29:21,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:29:21,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:29:21,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:29:21,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:29:20" (1/3) ... [2025-03-03 21:29:21,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c9b8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:29:21, skipping insertion in model container [2025-03-03 21:29:21,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:29:20" (2/3) ... [2025-03-03 21:29:21,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c9b8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:29:21, skipping insertion in model container [2025-03-03 21:29:21,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:29:21" (3/3) ... [2025-03-03 21:29:21,139 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-59.i [2025-03-03 21:29:21,150 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:29:21,152 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-59.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:29:21,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:29:21,211 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;@6c6b3026, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:29:21,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:29:21,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 63 states have internal predecessors, (92), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 21:29:21,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 21:29:21,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:29:21,224 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:29:21,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:29:21,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:29:21,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1484423505, now seen corresponding path program 1 times [2025-03-03 21:29:21,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:29:21,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043331385] [2025-03-03 21:29:21,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:29:21,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:29:21,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 21:29:21,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 21:29:21,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:29:21,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:29:21,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 21:29:21,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:29:21,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043331385] [2025-03-03 21:29:21,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043331385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:29:21,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786272965] [2025-03-03 21:29:21,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:29:21,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:29:21,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:29:21,492 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:29:21,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:29:21,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 21:29:21,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 21:29:21,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:29:21,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:29:21,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:29:21,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:29:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 21:29:21,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:29:21,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786272965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:29:21,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:29:21,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:29:21,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955075752] [2025-03-03 21:29:21,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:29:21,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:29:21,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:29:21,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:29:21,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:29:21,728 INFO L87 Difference]: Start difference. First operand has 92 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 63 states have internal predecessors, (92), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 21:29:21,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:29:21,758 INFO L93 Difference]: Finished difference Result 178 states and 314 transitions. [2025-03-03 21:29:21,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:29:21,761 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 176 [2025-03-03 21:29:21,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:29:21,767 INFO L225 Difference]: With dead ends: 178 [2025-03-03 21:29:21,768 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 21:29:21,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:29:21,772 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:29:21,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:29:21,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 21:29:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-03 21:29:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 21:29:21,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2025-03-03 21:29:21,809 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 138 transitions. Word has length 176 [2025-03-03 21:29:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:29:21,811 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 138 transitions. [2025-03-03 21:29:21,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 21:29:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 138 transitions. [2025-03-03 21:29:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 21:29:21,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:29:21,814 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:29:21,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 21:29:22,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:29:22,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:29:22,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:29:22,022 INFO L85 PathProgramCache]: Analyzing trace with hash 31007542, now seen corresponding path program 1 times [2025-03-03 21:29:22,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:29:22,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813275070] [2025-03-03 21:29:22,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:29:22,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:29:22,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 21:29:22,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 21:29:22,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:29:22,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:29:22,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:29:22,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:29:22,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813275070] [2025-03-03 21:29:22,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813275070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:29:22,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:29:22,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:29:22,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921534078] [2025-03-03 21:29:22,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:29:22,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:29:22,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:29:22,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:29:22,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:29:22,378 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:29:22,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:29:22,438 INFO L93 Difference]: Finished difference Result 175 states and 273 transitions. [2025-03-03 21:29:22,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:29:22,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-03-03 21:29:22,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:29:22,443 INFO L225 Difference]: With dead ends: 175 [2025-03-03 21:29:22,443 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 21:29:22,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:29:22,444 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:29:22,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 254 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:29:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 21:29:22,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-03 21:29:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 60 states have internal predecessors, (83), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 21:29:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2025-03-03 21:29:22,464 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 137 transitions. Word has length 176 [2025-03-03 21:29:22,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:29:22,465 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 137 transitions. [2025-03-03 21:29:22,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:29:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 137 transitions. [2025-03-03 21:29:22,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 21:29:22,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:29:22,470 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:29:22,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:29:22,470 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:29:22,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:29:22,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1776446921, now seen corresponding path program 1 times [2025-03-03 21:29:22,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:29:22,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817556493] [2025-03-03 21:29:22,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:29:22,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:29:22,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 21:29:22,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 21:29:22,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:29:22,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:29:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:29:22,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:29:22,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817556493] [2025-03-03 21:29:22,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817556493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:29:22,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:29:22,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:29:22,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130767116] [2025-03-03 21:29:22,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:29:22,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:29:22,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:29:22,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:29:22,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:29:22,836 INFO L87 Difference]: Start difference. First operand 89 states and 137 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:29:23,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:29:23,009 INFO L93 Difference]: Finished difference Result 262 states and 406 transitions. [2025-03-03 21:29:23,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:29:23,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-03-03 21:29:23,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:29:23,012 INFO L225 Difference]: With dead ends: 262 [2025-03-03 21:29:23,012 INFO L226 Difference]: Without dead ends: 176 [2025-03-03 21:29:23,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:29:23,013 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 108 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:29:23,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 386 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:29:23,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-03 21:29:23,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 150. [2025-03-03 21:29:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 93 states have (on average 1.3548387096774193) internal successors, (126), 93 states have internal predecessors, (126), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 21:29:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 234 transitions. [2025-03-03 21:29:23,045 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 234 transitions. Word has length 176 [2025-03-03 21:29:23,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:29:23,046 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 234 transitions. [2025-03-03 21:29:23,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:29:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 234 transitions. [2025-03-03 21:29:23,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 21:29:23,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:29:23,051 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:29:23,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:29:23,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:29:23,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:29:23,052 INFO L85 PathProgramCache]: Analyzing trace with hash -333071673, now seen corresponding path program 1 times [2025-03-03 21:29:23,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:29:23,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40715959] [2025-03-03 21:29:23,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:29:23,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:29:23,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 21:29:23,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 21:29:23,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:29:23,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:29:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:29:23,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:29:23,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40715959] [2025-03-03 21:29:23,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40715959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:29:23,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:29:23,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:29:23,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12270491] [2025-03-03 21:29:23,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:29:23,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:29:23,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:29:23,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:29:23,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:29:23,476 INFO L87 Difference]: Start difference. First operand 150 states and 234 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:29:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:29:23,554 INFO L93 Difference]: Finished difference Result 252 states and 395 transitions. [2025-03-03 21:29:23,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:29:23,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2025-03-03 21:29:23,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:29:23,557 INFO L225 Difference]: With dead ends: 252 [2025-03-03 21:29:23,559 INFO L226 Difference]: Without dead ends: 158 [2025-03-03 21:29:23,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:29:23,561 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 59 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:29:23,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 231 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:29:23,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-03 21:29:23,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2025-03-03 21:29:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 21:29:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 233 transitions. [2025-03-03 21:29:23,592 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 233 transitions. Word has length 177 [2025-03-03 21:29:23,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:29:23,592 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 233 transitions. [2025-03-03 21:29:23,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:29:23,593 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 233 transitions. [2025-03-03 21:29:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 21:29:23,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:29:23,594 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:29:23,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:29:23,594 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:29:23,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:29:23,595 INFO L85 PathProgramCache]: Analyzing trace with hash -621906282, now seen corresponding path program 1 times [2025-03-03 21:29:23,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:29:23,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078036922] [2025-03-03 21:29:23,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:29:23,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:29:23,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 21:29:23,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 21:29:23,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:29:23,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:29:23,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:29:23,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:29:23,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078036922] [2025-03-03 21:29:23,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078036922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:29:23,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:29:23,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:29:23,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730468462] [2025-03-03 21:29:23,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:29:23,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:29:23,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:29:23,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:29:23,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:29:23,782 INFO L87 Difference]: Start difference. First operand 150 states and 233 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:29:23,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:29:23,837 INFO L93 Difference]: Finished difference Result 252 states and 394 transitions. [2025-03-03 21:29:23,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:29:23,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 178 [2025-03-03 21:29:23,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:29:23,839 INFO L225 Difference]: With dead ends: 252 [2025-03-03 21:29:23,839 INFO L226 Difference]: Without dead ends: 158 [2025-03-03 21:29:23,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:29:23,842 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 57 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:29:23,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 252 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:29:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-03 21:29:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2025-03-03 21:29:23,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 21:29:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 232 transitions. [2025-03-03 21:29:23,870 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 232 transitions. Word has length 178 [2025-03-03 21:29:23,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:29:23,871 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 232 transitions. [2025-03-03 21:29:23,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:29:23,871 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 232 transitions. [2025-03-03 21:29:23,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 21:29:23,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:29:23,874 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:29:23,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:29:23,874 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:29:23,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:29:23,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1996340464, now seen corresponding path program 1 times [2025-03-03 21:29:23,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:29:23,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307343566] [2025-03-03 21:29:23,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:29:23,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:29:23,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 21:29:23,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 21:29:23,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:29:23,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:29:24,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:29:24,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:29:24,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307343566] [2025-03-03 21:29:24,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307343566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:29:24,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:29:24,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 21:29:24,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062596819] [2025-03-03 21:29:24,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:29:24,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:29:24,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:29:24,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:29:24,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:29:24,437 INFO L87 Difference]: Start difference. First operand 150 states and 232 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:29:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:29:24,949 INFO L93 Difference]: Finished difference Result 290 states and 442 transitions. [2025-03-03 21:29:24,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:29:24,951 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-03-03 21:29:24,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:29:24,953 INFO L225 Difference]: With dead ends: 290 [2025-03-03 21:29:24,953 INFO L226 Difference]: Without dead ends: 204 [2025-03-03 21:29:24,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:29:24,953 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 254 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:29:24,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 551 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:29:24,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-03 21:29:24,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 164. [2025-03-03 21:29:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 107 states have (on average 1.3364485981308412) internal successors, (143), 107 states have internal predecessors, (143), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 21:29:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 251 transitions. [2025-03-03 21:29:24,983 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 251 transitions. Word has length 179 [2025-03-03 21:29:24,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:29:24,983 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 251 transitions. [2025-03-03 21:29:24,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:29:24,983 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 251 transitions. [2025-03-03 21:29:24,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 21:29:24,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:29:24,985 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:29:24,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:29:24,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:29:24,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:29:24,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1562825312, now seen corresponding path program 1 times [2025-03-03 21:29:24,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:29:24,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369736712] [2025-03-03 21:29:24,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:29:24,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:29:24,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 21:29:25,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 21:29:25,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:29:25,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:29:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 21:29:25,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:29:25,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369736712] [2025-03-03 21:29:25,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369736712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:29:25,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:29:25,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:29:25,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115323306] [2025-03-03 21:29:25,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:29:25,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:29:25,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:29:25,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:29:25,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:29:25,156 INFO L87 Difference]: Start difference. First operand 164 states and 251 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:29:25,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:29:25,306 INFO L93 Difference]: Finished difference Result 346 states and 531 transitions. [2025-03-03 21:29:25,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:29:25,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 180 [2025-03-03 21:29:25,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:29:25,308 INFO L225 Difference]: With dead ends: 346 [2025-03-03 21:29:25,308 INFO L226 Difference]: Without dead ends: 254 [2025-03-03 21:29:25,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:29:25,309 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 115 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:29:25,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 383 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:29:25,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-03 21:29:25,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 231. [2025-03-03 21:29:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 146 states have (on average 1.3493150684931507) internal successors, (197), 146 states have internal predecessors, (197), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 21:29:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 359 transitions. [2025-03-03 21:29:25,336 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 359 transitions. Word has length 180 [2025-03-03 21:29:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:29:25,339 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 359 transitions. [2025-03-03 21:29:25,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 21:29:25,339 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 359 transitions. [2025-03-03 21:29:25,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 21:29:25,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:29:25,340 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:29:25,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:29:25,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:29:25,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:29:25,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1011549237, now seen corresponding path program 1 times [2025-03-03 21:29:25,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:29:25,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372155776] [2025-03-03 21:29:25,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:29:25,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:29:25,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 21:29:25,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 21:29:25,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:29:25,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:29:25,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1148147345] [2025-03-03 21:29:25,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:29:25,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:29:25,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:29:25,479 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:29:25,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 21:29:25,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 21:29:25,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 21:29:25,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:29:25,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:29:25,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 21:29:25,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:29:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 338 proven. 300 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-03-03 21:29:28,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:30:53,481 WARN L286 SmtUtils]: Spent 37.21s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)