./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-66.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 5210195513b04a67efdbde16013e554cd917c380644440c8ab9e15436a32073d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:27:31,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:27:31,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:27:31,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:27:31,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:27:31,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:27:31,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:27:31,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:27:31,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:27:31,347 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:27:31,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:27:31,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:27:31,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:27:31,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:27:31,347 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:27:31,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:27:31,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:27:31,347 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:27:31,347 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:27:31,347 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:27:31,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:27:31,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:27:31,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:27:31,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:27:31,348 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:27:31,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:27:31,348 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:27:31,350 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:27:31,350 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:27:31,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:27:31,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:27:31,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:27:31,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:27:31,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:27:31,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:27:31,351 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:27:31,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:27:31,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:27:31,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:27:31,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:27:31,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:27:31,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:27:31,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:27:31,351 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 -> 5210195513b04a67efdbde16013e554cd917c380644440c8ab9e15436a32073d [2025-03-03 19:27:31,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:27:31,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:27:31,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:27:31,595 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:27:31,595 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:27:31,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-66.i [2025-03-03 19:27:32,748 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f54d2ada/a74ac0a71fff40238d6fdb8140e7df97/FLAGcf964cc25 [2025-03-03 19:27:32,985 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:27:32,985 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-66.i [2025-03-03 19:27:32,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f54d2ada/a74ac0a71fff40238d6fdb8140e7df97/FLAGcf964cc25 [2025-03-03 19:27:33,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f54d2ada/a74ac0a71fff40238d6fdb8140e7df97 [2025-03-03 19:27:33,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:27:33,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:27:33,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:27:33,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:27:33,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:27:33,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:27:33" (1/1) ... [2025-03-03 19:27:33,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4ae29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:27:33, skipping insertion in model container [2025-03-03 19:27:33,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:27:33" (1/1) ... [2025-03-03 19:27:33,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:27:33,472 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-66.i[916,929] [2025-03-03 19:27:33,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:27:33,575 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:27:33,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-66.i[916,929] [2025-03-03 19:27:33,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:27:33,632 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:27:33,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:27:33 WrapperNode [2025-03-03 19:27:33,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:27:33,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:27:33,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:27:33,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:27:33,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:27:33" (1/1) ... [2025-03-03 19:27:33,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:27:33" (1/1) ... [2025-03-03 19:27:33,690 INFO L138 Inliner]: procedures = 26, calls = 66, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 307 [2025-03-03 19:27:33,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:27:33,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:27:33,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:27:33,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:27:33,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:27:33" (1/1) ... [2025-03-03 19:27:33,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:27:33" (1/1) ... [2025-03-03 19:27:33,700 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:27:33" (1/1) ... [2025-03-03 19:27:33,717 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:27:33,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:27:33" (1/1) ... [2025-03-03 19:27:33,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:27:33" (1/1) ... [2025-03-03 19:27:33,731 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:27:33" (1/1) ... [2025-03-03 19:27:33,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:27:33" (1/1) ... [2025-03-03 19:27:33,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:27:33" (1/1) ... [2025-03-03 19:27:33,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:27:33" (1/1) ... [2025-03-03 19:27:33,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:27:33,745 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:27:33,746 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:27:33,746 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:27:33,747 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:27:33" (1/1) ... [2025-03-03 19:27:33,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:27:33,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:27:33,773 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:27:33,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:27:33,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:27:33,795 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:27:33,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:27:33,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:27:33,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:27:33,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:27:33,874 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:27:33,876 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:27:34,230 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 19:27:34,230 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:27:34,242 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:27:34,243 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:27:34,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:27:34 BoogieIcfgContainer [2025-03-03 19:27:34,243 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:27:34,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:27:34,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:27:34,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:27:34,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:27:33" (1/3) ... [2025-03-03 19:27:34,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd5b5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:27:34, skipping insertion in model container [2025-03-03 19:27:34,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:27:33" (2/3) ... [2025-03-03 19:27:34,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd5b5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:27:34, skipping insertion in model container [2025-03-03 19:27:34,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:27:34" (3/3) ... [2025-03-03 19:27:34,254 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-66.i [2025-03-03 19:27:34,264 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:27:34,270 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-66.i that has 2 procedures, 138 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:27:34,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:27:34,328 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;@2be37375, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:27:34,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:27:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 83 states have internal predecessors, (118), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-03 19:27:34,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-03 19:27:34,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:27:34,344 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:27:34,344 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:27:34,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:27:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash -464627139, now seen corresponding path program 1 times [2025-03-03 19:27:34,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:27:34,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257647599] [2025-03-03 19:27:34,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:27:34,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:27:34,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 19:27:34,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 19:27:34,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:27:34,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:27:34,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 5408 trivial. 0 not checked. [2025-03-03 19:27:34,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:27:34,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257647599] [2025-03-03 19:27:34,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257647599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:27:34,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282180027] [2025-03-03 19:27:34,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:27:34,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:27:34,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:27:34,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:27:34,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:27:34,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 19:27:34,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 19:27:34,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:27:34,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:27:34,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:27:34,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:27:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 5408 trivial. 0 not checked. [2025-03-03 19:27:34,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:27:34,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282180027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:27:34,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:27:34,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:27:34,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322019341] [2025-03-03 19:27:34,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:27:34,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:27:34,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:27:34,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:27:34,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:27:34,987 INFO L87 Difference]: Start difference. First operand has 138 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 83 states have internal predecessors, (118), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 2 states have call successors, (53) [2025-03-03 19:27:35,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:27:35,027 INFO L93 Difference]: Finished difference Result 270 states and 496 transitions. [2025-03-03 19:27:35,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:27:35,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 2 states have call successors, (53) Word has length 328 [2025-03-03 19:27:35,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:27:35,035 INFO L225 Difference]: With dead ends: 270 [2025-03-03 19:27:35,035 INFO L226 Difference]: Without dead ends: 135 [2025-03-03 19:27:35,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:27:35,040 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:27:35,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:27:35,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-03 19:27:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-03 19:27:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-03 19:27:35,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 219 transitions. [2025-03-03 19:27:35,089 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 219 transitions. Word has length 328 [2025-03-03 19:27:35,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:27:35,089 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 219 transitions. [2025-03-03 19:27:35,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 2 states have call successors, (53) [2025-03-03 19:27:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 219 transitions. [2025-03-03 19:27:35,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-03 19:27:35,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:27:35,094 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:27:35,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:27:35,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:27:35,295 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:27:35,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:27:35,296 INFO L85 PathProgramCache]: Analyzing trace with hash -584185124, now seen corresponding path program 1 times [2025-03-03 19:27:35,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:27:35,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19752607] [2025-03-03 19:27:35,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:27:35,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:27:35,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 19:27:35,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 19:27:35,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:27:35,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:27:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-03-03 19:27:40,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:27:40,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19752607] [2025-03-03 19:27:40,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19752607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:27:40,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:27:40,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 19:27:40,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577314875] [2025-03-03 19:27:40,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:27:40,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 19:27:40,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:27:40,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 19:27:40,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:27:40,584 INFO L87 Difference]: Start difference. First operand 135 states and 219 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-03 19:27:41,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:27:41,367 INFO L93 Difference]: Finished difference Result 388 states and 599 transitions. [2025-03-03 19:27:41,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 19:27:41,367 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 328 [2025-03-03 19:27:41,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:27:41,370 INFO L225 Difference]: With dead ends: 388 [2025-03-03 19:27:41,370 INFO L226 Difference]: Without dead ends: 256 [2025-03-03 19:27:41,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:27:41,372 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 217 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:27:41,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1231 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:27:41,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-03 19:27:41,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 180. [2025-03-03 19:27:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 120 states have (on average 1.425) internal successors, (171), 121 states have internal predecessors, (171), 57 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-03 19:27:41,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 285 transitions. [2025-03-03 19:27:41,404 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 285 transitions. Word has length 328 [2025-03-03 19:27:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:27:41,406 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 285 transitions. [2025-03-03 19:27:41,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-03 19:27:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 285 transitions. [2025-03-03 19:27:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-03 19:27:41,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:27:41,413 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:27:41,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:27:41,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:27:41,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:27:41,414 INFO L85 PathProgramCache]: Analyzing trace with hash -583261603, now seen corresponding path program 1 times [2025-03-03 19:27:41,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:27:41,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164303432] [2025-03-03 19:27:41,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:27:41,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:27:41,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 19:27:41,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 19:27:41,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:27:41,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:27:46,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-03-03 19:27:46,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:27:46,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164303432] [2025-03-03 19:27:46,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164303432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:27:46,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:27:46,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 19:27:46,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37344959] [2025-03-03 19:27:46,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:27:46,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 19:27:46,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:27:46,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 19:27:46,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:27:46,250 INFO L87 Difference]: Start difference. First operand 180 states and 285 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-03 19:27:47,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:27:47,228 INFO L93 Difference]: Finished difference Result 256 states and 375 transitions. [2025-03-03 19:27:47,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 19:27:47,228 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 328 [2025-03-03 19:27:47,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:27:47,232 INFO L225 Difference]: With dead ends: 256 [2025-03-03 19:27:47,235 INFO L226 Difference]: Without dead ends: 254 [2025-03-03 19:27:47,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:27:47,236 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 155 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1765 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:27:47,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1765 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:27:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-03 19:27:47,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 180. [2025-03-03 19:27:47,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 120 states have (on average 1.425) internal successors, (171), 121 states have internal predecessors, (171), 57 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-03 19:27:47,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 285 transitions. [2025-03-03 19:27:47,255 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 285 transitions. Word has length 328 [2025-03-03 19:27:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:27:47,256 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 285 transitions. [2025-03-03 19:27:47,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-03 19:27:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 285 transitions. [2025-03-03 19:27:47,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-03 19:27:47,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:27:47,260 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:27:47,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:27:47,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:27:47,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:27:47,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1903327709, now seen corresponding path program 1 times [2025-03-03 19:27:47,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:27:47,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163249204] [2025-03-03 19:27:47,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:27:47,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:27:47,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 19:27:47,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 19:27:47,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:27:47,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:27:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-03-03 19:27:50,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:27:50,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163249204] [2025-03-03 19:27:50,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163249204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:27:50,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:27:50,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 19:27:50,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12911917] [2025-03-03 19:27:50,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:27:50,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 19:27:50,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:27:50,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 19:27:50,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:27:50,899 INFO L87 Difference]: Start difference. First operand 180 states and 285 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-03 19:27:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:27:51,587 INFO L93 Difference]: Finished difference Result 263 states and 383 transitions. [2025-03-03 19:27:51,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 19:27:51,587 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 328 [2025-03-03 19:27:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:27:51,589 INFO L225 Difference]: With dead ends: 263 [2025-03-03 19:27:51,589 INFO L226 Difference]: Without dead ends: 261 [2025-03-03 19:27:51,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:27:51,590 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 217 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:27:51,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1241 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:27:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-03 19:27:51,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 184. [2025-03-03 19:27:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 125 states have internal predecessors, (177), 57 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-03 19:27:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 291 transitions. [2025-03-03 19:27:51,611 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 291 transitions. Word has length 328 [2025-03-03 19:27:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:27:51,611 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 291 transitions. [2025-03-03 19:27:51,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-03 19:27:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 291 transitions. [2025-03-03 19:27:51,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-03 19:27:51,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:27:51,613 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:27:51,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:27:51,614 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:27:51,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:27:51,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1904251230, now seen corresponding path program 1 times [2025-03-03 19:27:51,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:27:51,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191612513] [2025-03-03 19:27:51,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:27:51,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:27:51,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 19:27:51,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 19:27:51,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:27:51,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:27:55,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-03-03 19:27:55,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:27:55,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191612513] [2025-03-03 19:27:55,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191612513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:27:55,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:27:55,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 19:27:55,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045434521] [2025-03-03 19:27:55,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:27:55,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 19:27:55,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:27:55,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 19:27:55,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:27:55,914 INFO L87 Difference]: Start difference. First operand 184 states and 291 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-03 19:27:56,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:27:56,748 INFO L93 Difference]: Finished difference Result 261 states and 381 transitions. [2025-03-03 19:27:56,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 19:27:56,749 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 328 [2025-03-03 19:27:56,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:27:56,750 INFO L225 Difference]: With dead ends: 261 [2025-03-03 19:27:56,751 INFO L226 Difference]: Without dead ends: 259 [2025-03-03 19:27:56,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:27:56,751 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 152 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:27:56,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1471 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:27:56,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-03 19:27:56,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 180. [2025-03-03 19:27:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 120 states have (on average 1.425) internal successors, (171), 121 states have internal predecessors, (171), 57 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-03 19:27:56,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 285 transitions. [2025-03-03 19:27:56,764 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 285 transitions. Word has length 328 [2025-03-03 19:27:56,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:27:56,764 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 285 transitions. [2025-03-03 19:27:56,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-03 19:27:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 285 transitions. [2025-03-03 19:27:56,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-03 19:27:56,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:27:56,768 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:27:56,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:27:56,768 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:27:56,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:27:56,768 INFO L85 PathProgramCache]: Analyzing trace with hash -455102405, now seen corresponding path program 1 times [2025-03-03 19:27:56,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:27:56,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450596406] [2025-03-03 19:27:56,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:27:56,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:27:56,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 19:27:56,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 19:27:56,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:27:56,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:27:56,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-03-03 19:27:56,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:27:56,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450596406] [2025-03-03 19:27:56,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450596406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:27:56,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:27:56,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:27:56,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410792261] [2025-03-03 19:27:56,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:27:56,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:27:56,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:27:56,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:27:56,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:27:56,836 INFO L87 Difference]: Start difference. First operand 180 states and 285 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-03 19:27:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:27:56,876 INFO L93 Difference]: Finished difference Result 515 states and 821 transitions. [2025-03-03 19:27:56,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:27:56,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 328 [2025-03-03 19:27:56,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:27:56,881 INFO L225 Difference]: With dead ends: 515 [2025-03-03 19:27:56,881 INFO L226 Difference]: Without dead ends: 338 [2025-03-03 19:27:56,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:27:56,882 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 206 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:27:56,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 618 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:27:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-03 19:27:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2025-03-03 19:27:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 217 states have (on average 1.3824884792626728) internal successors, (300), 219 states have internal predecessors, (300), 114 states have call successors, (114), 4 states have call predecessors, (114), 4 states have return successors, (114), 112 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-03 19:27:56,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 528 transitions. [2025-03-03 19:27:56,911 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 528 transitions. Word has length 328 [2025-03-03 19:27:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:27:56,911 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 528 transitions. [2025-03-03 19:27:56,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-03 19:27:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 528 transitions. [2025-03-03 19:27:56,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-03 19:27:56,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:27:56,913 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:27:56,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:27:56,913 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:27:56,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:27:56,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1287707930, now seen corresponding path program 1 times [2025-03-03 19:27:56,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:27:56,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46951663] [2025-03-03 19:27:56,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:27:56,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:27:56,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 19:27:56,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 19:27:56,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:27:56,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:27:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-03-03 19:27:57,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:27:57,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46951663] [2025-03-03 19:27:57,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46951663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:27:57,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:27:57,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:27:57,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774859818] [2025-03-03 19:27:57,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:27:57,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:27:57,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:27:57,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:27:57,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:27:57,029 INFO L87 Difference]: Start difference. First operand 336 states and 528 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-03 19:27:57,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:27:57,279 INFO L93 Difference]: Finished difference Result 998 states and 1559 transitions. [2025-03-03 19:27:57,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:27:57,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 328 [2025-03-03 19:27:57,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:27:57,283 INFO L225 Difference]: With dead ends: 998 [2025-03-03 19:27:57,283 INFO L226 Difference]: Without dead ends: 665 [2025-03-03 19:27:57,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:27:57,285 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 135 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:27:57,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 650 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:27:57,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-03 19:27:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 620. [2025-03-03 19:27:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 387 states have (on average 1.372093023255814) internal successors, (531), 390 states have internal predecessors, (531), 224 states have call successors, (224), 8 states have call predecessors, (224), 8 states have return successors, (224), 221 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-03 19:27:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 979 transitions. [2025-03-03 19:27:57,346 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 979 transitions. Word has length 328 [2025-03-03 19:27:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:27:57,347 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 979 transitions. [2025-03-03 19:27:57,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-03 19:27:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 979 transitions. [2025-03-03 19:27:57,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-03 19:27:57,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:27:57,349 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:27:57,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:27:57,349 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:27:57,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:27:57,349 INFO L85 PathProgramCache]: Analyzing trace with hash -519746533, now seen corresponding path program 1 times [2025-03-03 19:27:57,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:27:57,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97765159] [2025-03-03 19:27:57,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:27:57,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:27:57,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 19:27:57,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 19:27:57,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:27:57,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:27:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-03-03 19:27:59,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:27:59,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97765159] [2025-03-03 19:27:59,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97765159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:27:59,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:27:59,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 19:27:59,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047749628] [2025-03-03 19:27:59,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:27:59,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 19:27:59,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:27:59,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 19:27:59,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:27:59,270 INFO L87 Difference]: Start difference. First operand 620 states and 979 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-03 19:28:00,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:28:00,220 INFO L93 Difference]: Finished difference Result 766 states and 1146 transitions. [2025-03-03 19:28:00,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 19:28:00,221 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 328 [2025-03-03 19:28:00,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:28:00,225 INFO L225 Difference]: With dead ends: 766 [2025-03-03 19:28:00,225 INFO L226 Difference]: Without dead ends: 764 [2025-03-03 19:28:00,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 19:28:00,226 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 280 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:28:00,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1235 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 19:28:00,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-03-03 19:28:00,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 676. [2025-03-03 19:28:00,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 432 states have (on average 1.3518518518518519) internal successors, (584), 437 states have internal predecessors, (584), 232 states have call successors, (232), 11 states have call predecessors, (232), 11 states have return successors, (232), 227 states have call predecessors, (232), 232 states have call successors, (232) [2025-03-03 19:28:00,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1048 transitions. [2025-03-03 19:28:00,282 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1048 transitions. Word has length 328 [2025-03-03 19:28:00,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:28:00,283 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 1048 transitions. [2025-03-03 19:28:00,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-03 19:28:00,283 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1048 transitions. [2025-03-03 19:28:00,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-03 19:28:00,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:28:00,285 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:28:00,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:28:00,285 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:28:00,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:28:00,285 INFO L85 PathProgramCache]: Analyzing trace with hash -518823012, now seen corresponding path program 1 times [2025-03-03 19:28:00,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:28:00,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083140345] [2025-03-03 19:28:00,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:28:00,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:28:00,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 19:28:00,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 19:28:00,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:28:00,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:28:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-03-03 19:28:04,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:28:04,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083140345] [2025-03-03 19:28:04,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083140345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:28:04,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:28:04,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 19:28:04,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175887381] [2025-03-03 19:28:04,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:28:04,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 19:28:04,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:28:04,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 19:28:04,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:28:04,126 INFO L87 Difference]: Start difference. First operand 676 states and 1048 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 3 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2025-03-03 19:28:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:28:06,213 INFO L93 Difference]: Finished difference Result 764 states and 1144 transitions. [2025-03-03 19:28:06,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 19:28:06,215 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 3 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) Word has length 328 [2025-03-03 19:28:06,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:28:06,219 INFO L225 Difference]: With dead ends: 764 [2025-03-03 19:28:06,219 INFO L226 Difference]: Without dead ends: 762 [2025-03-03 19:28:06,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=226, Invalid=476, Unknown=0, NotChecked=0, Total=702 [2025-03-03 19:28:06,222 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 416 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 19:28:06,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1669 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 19:28:06,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-03-03 19:28:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 676. [2025-03-03 19:28:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 432 states have (on average 1.3518518518518519) internal successors, (584), 437 states have internal predecessors, (584), 232 states have call successors, (232), 11 states have call predecessors, (232), 11 states have return successors, (232), 227 states have call predecessors, (232), 232 states have call successors, (232) [2025-03-03 19:28:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1048 transitions. [2025-03-03 19:28:06,293 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1048 transitions. Word has length 328 [2025-03-03 19:28:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:28:06,293 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 1048 transitions. [2025-03-03 19:28:06,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 3 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2025-03-03 19:28:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1048 transitions. [2025-03-03 19:28:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-03 19:28:06,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:28:06,295 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:28:06,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:28:06,296 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:28:06,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:28:06,296 INFO L85 PathProgramCache]: Analyzing trace with hash -877588131, now seen corresponding path program 1 times [2025-03-03 19:28:06,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:28:06,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207080288] [2025-03-03 19:28:06,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:28:06,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:28:06,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 19:28:06,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 19:28:06,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:28:06,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:28:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-03-03 19:28:06,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:28:06,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207080288] [2025-03-03 19:28:06,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207080288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:28:06,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:28:06,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:28:06,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029622203] [2025-03-03 19:28:06,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:28:06,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:28:06,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:28:06,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:28:06,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:28:06,584 INFO L87 Difference]: Start difference. First operand 676 states and 1048 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2025-03-03 19:28:06,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:28:06,822 INFO L93 Difference]: Finished difference Result 1235 states and 1896 transitions. [2025-03-03 19:28:06,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:28:06,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 328 [2025-03-03 19:28:06,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:28:06,828 INFO L225 Difference]: With dead ends: 1235 [2025-03-03 19:28:06,829 INFO L226 Difference]: Without dead ends: 683 [2025-03-03 19:28:06,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:28:06,831 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 189 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:28:06,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 345 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:28:06,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-03 19:28:06,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 674. [2025-03-03 19:28:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 424 states have (on average 1.3278301886792452) internal successors, (563), 429 states have internal predecessors, (563), 236 states have call successors, (236), 13 states have call predecessors, (236), 13 states have return successors, (236), 231 states have call predecessors, (236), 236 states have call successors, (236) [2025-03-03 19:28:06,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1035 transitions. [2025-03-03 19:28:06,889 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1035 transitions. Word has length 328 [2025-03-03 19:28:06,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:28:06,890 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 1035 transitions. [2025-03-03 19:28:06,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2025-03-03 19:28:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1035 transitions. [2025-03-03 19:28:06,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-03 19:28:06,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:28:06,892 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:28:06,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 19:28:06,893 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:28:06,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:28:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash 243802085, now seen corresponding path program 1 times [2025-03-03 19:28:06,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:28:06,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277752387] [2025-03-03 19:28:06,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:28:06,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:28:06,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-03 19:28:07,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-03 19:28:07,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:28:07,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:28:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 333 proven. 255 refuted. 0 times theorem prover too weak. 4924 trivial. 0 not checked. [2025-03-03 19:28:13,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:28:13,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277752387] [2025-03-03 19:28:13,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277752387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:28:13,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453030426] [2025-03-03 19:28:13,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:28:13,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:28:13,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:28:13,138 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:28:13,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:28:13,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-03 19:28:13,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-03 19:28:13,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:28:13,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:28:13,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 19:28:13,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:28:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 3725 proven. 309 refuted. 0 times theorem prover too weak. 1478 trivial. 0 not checked. [2025-03-03 19:28:15,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:28:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 411 proven. 339 refuted. 0 times theorem prover too weak. 4762 trivial. 0 not checked. [2025-03-03 19:28:19,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453030426] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:28:19,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:28:19,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 59 [2025-03-03 19:28:19,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916871992] [2025-03-03 19:28:19,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:28:19,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-03 19:28:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:28:19,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-03 19:28:19,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=2841, Unknown=0, NotChecked=0, Total=3422 [2025-03-03 19:28:19,440 INFO L87 Difference]: Start difference. First operand 674 states and 1035 transitions. Second operand has 59 states, 54 states have (on average 3.4074074074074074) internal successors, (184), 54 states have internal predecessors, (184), 21 states have call successors, (137), 7 states have call predecessors, (137), 16 states have return successors, (137), 19 states have call predecessors, (137), 21 states have call successors, (137) [2025-03-03 19:28:46,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:28:46,658 INFO L93 Difference]: Finished difference Result 8113 states and 11589 transitions. [2025-03-03 19:28:46,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2025-03-03 19:28:46,659 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 54 states have (on average 3.4074074074074074) internal successors, (184), 54 states have internal predecessors, (184), 21 states have call successors, (137), 7 states have call predecessors, (137), 16 states have return successors, (137), 19 states have call predecessors, (137), 21 states have call successors, (137) Word has length 329 [2025-03-03 19:28:46,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:28:46,689 INFO L225 Difference]: With dead ends: 8113 [2025-03-03 19:28:46,689 INFO L226 Difference]: Without dead ends: 7545 [2025-03-03 19:28:46,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 915 GetRequests, 658 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26771 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=13858, Invalid=52964, Unknown=0, NotChecked=0, Total=66822 [2025-03-03 19:28:46,706 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 5113 mSDsluCounter, 2842 mSDsCounter, 0 mSdLazyCounter, 4939 mSolverCounterSat, 3135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5117 SdHoareTripleChecker+Valid, 3034 SdHoareTripleChecker+Invalid, 8074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3135 IncrementalHoareTripleChecker+Valid, 4939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:28:46,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5117 Valid, 3034 Invalid, 8074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3135 Valid, 4939 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2025-03-03 19:28:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7545 states. [2025-03-03 19:28:47,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7545 to 3252. [2025-03-03 19:28:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3252 states, 2328 states have (on average 1.3234536082474226) internal successors, (3081), 2381 states have internal predecessors, (3081), 800 states have call successors, (800), 123 states have call predecessors, (800), 123 states have return successors, (800), 747 states have call predecessors, (800), 800 states have call successors, (800) [2025-03-03 19:28:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3252 states to 3252 states and 4681 transitions. [2025-03-03 19:28:47,329 INFO L78 Accepts]: Start accepts. Automaton has 3252 states and 4681 transitions. Word has length 329 [2025-03-03 19:28:47,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:28:47,330 INFO L471 AbstractCegarLoop]: Abstraction has 3252 states and 4681 transitions. [2025-03-03 19:28:47,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 54 states have (on average 3.4074074074074074) internal successors, (184), 54 states have internal predecessors, (184), 21 states have call successors, (137), 7 states have call predecessors, (137), 16 states have return successors, (137), 19 states have call predecessors, (137), 21 states have call successors, (137) [2025-03-03 19:28:47,330 INFO L276 IsEmpty]: Start isEmpty. Operand 3252 states and 4681 transitions. [2025-03-03 19:28:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-03 19:28:47,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:28:47,333 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:28:47,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 19:28:47,537 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,SelfDestructingSolverStorable10 [2025-03-03 19:28:47,537 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:28:47,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:28:47,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1967420764, now seen corresponding path program 1 times [2025-03-03 19:28:47,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:28:47,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021013948] [2025-03-03 19:28:47,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:28:47,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:28:47,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-03 19:28:47,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-03 19:28:47,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:28:47,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:28:47,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [800191249] [2025-03-03 19:28:47,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:28:47,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:28:47,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:28:47,650 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:28:47,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:28:47,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-03 19:28:47,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-03 19:28:47,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:28:47,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:28:47,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 19:28:47,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:28:51,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 1404 proven. 639 refuted. 0 times theorem prover too weak. 3469 trivial. 0 not checked. [2025-03-03 19:28:51,829 INFO L312 TraceCheckSpWp]: Computing backward predicates...