./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-e2fb8be-m [2025-03-08 10:38:46,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:38:46,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:38:46,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:38:46,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:38:46,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:38:46,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:38:46,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:38:46,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:38:46,575 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:38:46,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:38:46,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:38:46,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:38:46,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:38:46,576 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:38:46,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:38:46,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:38:46,576 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:38:46,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:38:46,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:38:46,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:38:46,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:38:46,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:38:46,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:38:46,577 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:38:46,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:38:46,577 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:38:46,577 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:38:46,577 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:38:46,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:38:46,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:38:46,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:38:46,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:38:46,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:38:46,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:38:46,578 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:38:46,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:38:46,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:38:46,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:38:46,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:38:46,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:38:46,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:38:46,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:38:46,579 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-08 10:38:46,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:38:46,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:38:46,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:38:46,798 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:38:46,798 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:38:46,799 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-08 10:38:47,945 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/482a45fb3/ae68476d611b40edb8b67c2bfca6606b/FLAGba6d9b8bd [2025-03-08 10:38:48,220 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:38:48,221 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-08 10:38:48,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/482a45fb3/ae68476d611b40edb8b67c2bfca6606b/FLAGba6d9b8bd [2025-03-08 10:38:48,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/482a45fb3/ae68476d611b40edb8b67c2bfca6606b [2025-03-08 10:38:48,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:38:48,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:38:48,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:38:48,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:38:48,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:38:48,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:38:48" (1/1) ... [2025-03-08 10:38:48,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183a0f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:48, skipping insertion in model container [2025-03-08 10:38:48,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:38:48" (1/1) ... [2025-03-08 10:38:48,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:38:48,631 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-08 10:38:48,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:38:48,687 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:38:48,694 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-08 10:38:48,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:38:48,739 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:38:48,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:48 WrapperNode [2025-03-08 10:38:48,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:38:48,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:38:48,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:38:48,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:38:48,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:48" (1/1) ... [2025-03-08 10:38:48,753 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:48" (1/1) ... [2025-03-08 10:38:48,772 INFO L138 Inliner]: procedures = 26, calls = 66, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 307 [2025-03-08 10:38:48,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:38:48,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:38:48,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:38:48,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:38:48,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:48" (1/1) ... [2025-03-08 10:38:48,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:48" (1/1) ... [2025-03-08 10:38:48,781 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:48" (1/1) ... [2025-03-08 10:38:48,793 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-08 10:38:48,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:48" (1/1) ... [2025-03-08 10:38:48,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:48" (1/1) ... [2025-03-08 10:38:48,807 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:48" (1/1) ... [2025-03-08 10:38:48,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:48" (1/1) ... [2025-03-08 10:38:48,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:48" (1/1) ... [2025-03-08 10:38:48,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:48" (1/1) ... [2025-03-08 10:38:48,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:38:48,819 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:38:48,819 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:38:48,820 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:38:48,820 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:48" (1/1) ... [2025-03-08 10:38:48,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:38:48,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:38:48,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:38:48,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:38:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:38:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:38:48,868 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:38:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:38:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:38:48,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:38:48,935 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:38:48,936 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:38:49,330 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 10:38:49,331 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:38:49,349 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:38:49,349 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:38:49,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:38:49 BoogieIcfgContainer [2025-03-08 10:38:49,349 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:38:49,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:38:49,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:38:49,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:38:49,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:38:48" (1/3) ... [2025-03-08 10:38:49,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62176f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:38:49, skipping insertion in model container [2025-03-08 10:38:49,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:48" (2/3) ... [2025-03-08 10:38:49,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62176f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:38:49, skipping insertion in model container [2025-03-08 10:38:49,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:38:49" (3/3) ... [2025-03-08 10:38:49,357 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-66.i [2025-03-08 10:38:49,366 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:38:49,370 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-08 10:38:49,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:38:49,422 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;@3dde6d91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:38:49,422 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:38:49,424 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-08 10:38:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-08 10:38:49,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:38:49,440 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-08 10:38:49,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:38:49,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:38:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash -464627139, now seen corresponding path program 1 times [2025-03-08 10:38:49,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:38:49,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790954379] [2025-03-08 10:38:49,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:38:49,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:38:49,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-08 10:38:49,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-08 10:38:49,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:38:49,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:38:49,817 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-08 10:38:49,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:38:49,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790954379] [2025-03-08 10:38:49,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790954379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:38:49,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652844221] [2025-03-08 10:38:49,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:38:49,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:38:49,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:38:49,820 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:38:49,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:38:49,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-08 10:38:50,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-08 10:38:50,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:38:50,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:38:50,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:38:50,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:38:50,073 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-08 10:38:50,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:38:50,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652844221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:38:50,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:38:50,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:38:50,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31529496] [2025-03-08 10:38:50,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:38:50,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:38:50,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:38:50,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:38:50,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:38:50,099 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-08 10:38:50,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:38:50,133 INFO L93 Difference]: Finished difference Result 270 states and 496 transitions. [2025-03-08 10:38:50,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:38:50,135 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-08 10:38:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:38:50,140 INFO L225 Difference]: With dead ends: 270 [2025-03-08 10:38:50,140 INFO L226 Difference]: Without dead ends: 135 [2025-03-08 10:38:50,143 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-08 10:38:50,144 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-08 10:38:50,145 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-08 10:38:50,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-08 10:38:50,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-08 10:38:50,179 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-08 10:38:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 219 transitions. [2025-03-08 10:38:50,186 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 219 transitions. Word has length 328 [2025-03-08 10:38:50,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:38:50,186 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 219 transitions. [2025-03-08 10:38:50,187 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-08 10:38:50,187 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 219 transitions. [2025-03-08 10:38:50,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-08 10:38:50,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:38:50,192 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-08 10:38:50,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:38:50,393 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-08 10:38:50,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:38:50,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:38:50,394 INFO L85 PathProgramCache]: Analyzing trace with hash -584185124, now seen corresponding path program 1 times [2025-03-08 10:38:50,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:38:50,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246998353] [2025-03-08 10:38:50,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:38:50,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:38:50,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-08 10:38:50,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-08 10:38:50,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:38:50,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:38:55,354 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-08 10:38:55,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:38:55,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246998353] [2025-03-08 10:38:55,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246998353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:38:55,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:38:55,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 10:38:55,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006372436] [2025-03-08 10:38:55,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:38:55,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 10:38:55,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:38:55,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 10:38:55,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:38:55,360 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-08 10:38:56,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:38:56,068 INFO L93 Difference]: Finished difference Result 388 states and 599 transitions. [2025-03-08 10:38:56,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 10:38:56,069 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-08 10:38:56,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:38:56,071 INFO L225 Difference]: With dead ends: 388 [2025-03-08 10:38:56,071 INFO L226 Difference]: Without dead ends: 256 [2025-03-08 10:38:56,072 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-08 10:38:56,073 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-08 10:38:56,073 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-08 10:38:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-08 10:38:56,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 180. [2025-03-08 10:38:56,098 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-08 10:38:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 285 transitions. [2025-03-08 10:38:56,101 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 285 transitions. Word has length 328 [2025-03-08 10:38:56,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:38:56,102 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 285 transitions. [2025-03-08 10:38:56,102 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-08 10:38:56,102 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 285 transitions. [2025-03-08 10:38:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-08 10:38:56,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:38:56,107 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-08 10:38:56,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:38:56,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:38:56,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:38:56,109 INFO L85 PathProgramCache]: Analyzing trace with hash -583261603, now seen corresponding path program 1 times [2025-03-08 10:38:56,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:38:56,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137353352] [2025-03-08 10:38:56,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:38:56,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:38:56,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-08 10:38:56,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-08 10:38:56,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:38:56,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:00,841 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-08 10:39:00,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:00,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137353352] [2025-03-08 10:39:00,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137353352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:00,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:00,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 10:39:00,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241719058] [2025-03-08 10:39:00,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:00,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 10:39:00,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:00,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 10:39:00,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-08 10:39:00,844 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-08 10:39:01,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:01,727 INFO L93 Difference]: Finished difference Result 256 states and 375 transitions. [2025-03-08 10:39:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 10:39:01,732 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-08 10:39:01,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:01,734 INFO L225 Difference]: With dead ends: 256 [2025-03-08 10:39:01,734 INFO L226 Difference]: Without dead ends: 254 [2025-03-08 10:39:01,734 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-08 10:39:01,735 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:39:01,735 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.5s Time] [2025-03-08 10:39:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-08 10:39:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 180. [2025-03-08 10:39:01,754 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-08 10:39:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 285 transitions. [2025-03-08 10:39:01,756 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 285 transitions. Word has length 328 [2025-03-08 10:39:01,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:01,757 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 285 transitions. [2025-03-08 10:39:01,757 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-08 10:39:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 285 transitions. [2025-03-08 10:39:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-08 10:39:01,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:01,760 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-08 10:39:01,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:39:01,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:01,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:01,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1903327709, now seen corresponding path program 1 times [2025-03-08 10:39:01,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:01,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577753160] [2025-03-08 10:39:01,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:01,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:01,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-08 10:39:01,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-08 10:39:01,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:01,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:05,575 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-08 10:39:05,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:05,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577753160] [2025-03-08 10:39:05,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577753160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:05,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:05,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 10:39:05,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143689875] [2025-03-08 10:39:05,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:05,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 10:39:05,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:05,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 10:39:05,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:39:05,577 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-08 10:39:06,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:06,275 INFO L93 Difference]: Finished difference Result 263 states and 383 transitions. [2025-03-08 10:39:06,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 10:39:06,276 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-08 10:39:06,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:06,279 INFO L225 Difference]: With dead ends: 263 [2025-03-08 10:39:06,280 INFO L226 Difference]: Without dead ends: 261 [2025-03-08 10:39:06,281 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-08 10:39:06,282 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-08 10:39:06,283 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-08 10:39:06,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-08 10:39:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 184. [2025-03-08 10:39:06,305 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-08 10:39:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 291 transitions. [2025-03-08 10:39:06,307 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 291 transitions. Word has length 328 [2025-03-08 10:39:06,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:06,308 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 291 transitions. [2025-03-08 10:39:06,308 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-08 10:39:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 291 transitions. [2025-03-08 10:39:06,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-08 10:39:06,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:06,311 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-08 10:39:06,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:39:06,311 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:06,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:06,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1904251230, now seen corresponding path program 1 times [2025-03-08 10:39:06,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:06,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332952662] [2025-03-08 10:39:06,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:06,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:06,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-08 10:39:06,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-08 10:39:06,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:06,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:10,478 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-08 10:39:10,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:10,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332952662] [2025-03-08 10:39:10,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332952662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:10,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:10,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 10:39:10,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425604384] [2025-03-08 10:39:10,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:10,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 10:39:10,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:10,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 10:39:10,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-08 10:39:10,480 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-08 10:39:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:11,260 INFO L93 Difference]: Finished difference Result 261 states and 381 transitions. [2025-03-08 10:39:11,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 10:39:11,261 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-08 10:39:11,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:11,263 INFO L225 Difference]: With dead ends: 261 [2025-03-08 10:39:11,263 INFO L226 Difference]: Without dead ends: 259 [2025-03-08 10:39:11,263 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-08 10:39:11,263 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-08 10:39:11,264 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-08 10:39:11,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-08 10:39:11,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 180. [2025-03-08 10:39:11,273 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-08 10:39:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 285 transitions. [2025-03-08 10:39:11,274 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 285 transitions. Word has length 328 [2025-03-08 10:39:11,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:11,275 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 285 transitions. [2025-03-08 10:39:11,275 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-08 10:39:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 285 transitions. [2025-03-08 10:39:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-08 10:39:11,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:11,276 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-08 10:39:11,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:39:11,276 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:11,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:11,277 INFO L85 PathProgramCache]: Analyzing trace with hash -455102405, now seen corresponding path program 1 times [2025-03-08 10:39:11,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:11,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075639272] [2025-03-08 10:39:11,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:11,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:11,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-08 10:39:11,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-08 10:39:11,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:11,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:11,330 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-08 10:39:11,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:11,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075639272] [2025-03-08 10:39:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075639272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:11,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:11,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:39:11,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733518955] [2025-03-08 10:39:11,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:11,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:39:11,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:11,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:39:11,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:39:11,332 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-08 10:39:11,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:11,367 INFO L93 Difference]: Finished difference Result 515 states and 821 transitions. [2025-03-08 10:39:11,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:39:11,367 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-08 10:39:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:11,371 INFO L225 Difference]: With dead ends: 515 [2025-03-08 10:39:11,371 INFO L226 Difference]: Without dead ends: 338 [2025-03-08 10:39:11,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:39:11,372 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-08 10:39:11,372 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-08 10:39:11,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-08 10:39:11,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2025-03-08 10:39:11,398 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-08 10:39:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 528 transitions. [2025-03-08 10:39:11,400 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 528 transitions. Word has length 328 [2025-03-08 10:39:11,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:11,400 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 528 transitions. [2025-03-08 10:39:11,400 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-08 10:39:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 528 transitions. [2025-03-08 10:39:11,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-08 10:39:11,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:11,402 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-08 10:39:11,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:39:11,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:11,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:11,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1287707930, now seen corresponding path program 1 times [2025-03-08 10:39:11,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:11,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70653556] [2025-03-08 10:39:11,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:11,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:11,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-08 10:39:11,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-08 10:39:11,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:11,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:11,507 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-08 10:39:11,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:11,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70653556] [2025-03-08 10:39:11,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70653556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:11,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:11,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:39:11,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522784822] [2025-03-08 10:39:11,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:11,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:39:11,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:11,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:39:11,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:39:11,509 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-08 10:39:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:11,744 INFO L93 Difference]: Finished difference Result 998 states and 1559 transitions. [2025-03-08 10:39:11,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:39:11,745 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-08 10:39:11,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:11,750 INFO L225 Difference]: With dead ends: 998 [2025-03-08 10:39:11,750 INFO L226 Difference]: Without dead ends: 665 [2025-03-08 10:39:11,751 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-08 10:39:11,752 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-08 10:39:11,752 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-08 10:39:11,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-08 10:39:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 620. [2025-03-08 10:39:11,802 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-08 10:39:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 979 transitions. [2025-03-08 10:39:11,806 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 979 transitions. Word has length 328 [2025-03-08 10:39:11,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:11,806 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 979 transitions. [2025-03-08 10:39:11,807 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-08 10:39:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 979 transitions. [2025-03-08 10:39:11,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-08 10:39:11,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:11,808 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-08 10:39:11,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:39:11,808 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:11,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:11,809 INFO L85 PathProgramCache]: Analyzing trace with hash -519746533, now seen corresponding path program 1 times [2025-03-08 10:39:11,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:11,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553998094] [2025-03-08 10:39:11,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:11,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:11,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-08 10:39:11,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-08 10:39:11,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:11,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:13,659 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-08 10:39:13,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:13,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553998094] [2025-03-08 10:39:13,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553998094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:13,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:13,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 10:39:13,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639854023] [2025-03-08 10:39:13,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:13,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 10:39:13,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:13,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 10:39:13,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:39:13,661 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-08 10:39:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:14,526 INFO L93 Difference]: Finished difference Result 766 states and 1146 transitions. [2025-03-08 10:39:14,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 10:39:14,527 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-08 10:39:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:14,531 INFO L225 Difference]: With dead ends: 766 [2025-03-08 10:39:14,531 INFO L226 Difference]: Without dead ends: 764 [2025-03-08 10:39:14,531 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-08 10:39:14,531 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.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:39:14,532 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.7s Time] [2025-03-08 10:39:14,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-03-08 10:39:14,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 676. [2025-03-08 10:39:14,591 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-08 10:39:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1048 transitions. [2025-03-08 10:39:14,597 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1048 transitions. Word has length 328 [2025-03-08 10:39:14,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:14,597 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 1048 transitions. [2025-03-08 10:39:14,598 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-08 10:39:14,598 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1048 transitions. [2025-03-08 10:39:14,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-08 10:39:14,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:14,600 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-08 10:39:14,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:39:14,600 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:14,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:14,600 INFO L85 PathProgramCache]: Analyzing trace with hash -518823012, now seen corresponding path program 1 times [2025-03-08 10:39:14,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:14,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809471697] [2025-03-08 10:39:14,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:14,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:14,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-08 10:39:14,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-08 10:39:14,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:14,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:18,373 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-08 10:39:18,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:18,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809471697] [2025-03-08 10:39:18,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809471697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:18,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:18,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 10:39:18,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865845727] [2025-03-08 10:39:18,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:18,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 10:39:18,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:18,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 10:39:18,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-03-08 10:39:18,375 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-08 10:39:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:20,478 INFO L93 Difference]: Finished difference Result 764 states and 1144 transitions. [2025-03-08 10:39:20,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 10:39:20,479 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-08 10:39:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:20,483 INFO L225 Difference]: With dead ends: 764 [2025-03-08 10:39:20,483 INFO L226 Difference]: Without dead ends: 762 [2025-03-08 10:39:20,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=226, Invalid=476, Unknown=0, NotChecked=0, Total=702 [2025-03-08 10:39:20,487 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-08 10:39:20,487 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-08 10:39:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-03-08 10:39:20,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 676. [2025-03-08 10:39:20,544 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-08 10:39:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1048 transitions. [2025-03-08 10:39:20,548 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1048 transitions. Word has length 328 [2025-03-08 10:39:20,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:20,549 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 1048 transitions. [2025-03-08 10:39:20,550 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-08 10:39:20,550 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1048 transitions. [2025-03-08 10:39:20,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-08 10:39:20,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:20,551 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-08 10:39:20,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:39:20,551 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:20,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:20,552 INFO L85 PathProgramCache]: Analyzing trace with hash -877588131, now seen corresponding path program 1 times [2025-03-08 10:39:20,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:20,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817935190] [2025-03-08 10:39:20,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:20,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:20,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-08 10:39:20,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-08 10:39:20,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:20,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:20,877 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-08 10:39:20,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:20,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817935190] [2025-03-08 10:39:20,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817935190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:39:20,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:39:20,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:39:20,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413610703] [2025-03-08 10:39:20,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:39:20,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:39:20,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:20,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:39:20,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:39:20,882 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-08 10:39:21,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:21,132 INFO L93 Difference]: Finished difference Result 1235 states and 1896 transitions. [2025-03-08 10:39:21,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:39:21,133 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-08 10:39:21,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:21,138 INFO L225 Difference]: With dead ends: 1235 [2025-03-08 10:39:21,139 INFO L226 Difference]: Without dead ends: 683 [2025-03-08 10:39:21,140 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-08 10:39:21,140 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 189 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-08 10:39:21,140 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-08 10:39:21,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-08 10:39:21,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 674. [2025-03-08 10:39:21,194 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-08 10:39:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1035 transitions. [2025-03-08 10:39:21,198 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1035 transitions. Word has length 328 [2025-03-08 10:39:21,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:21,199 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 1035 transitions. [2025-03-08 10:39:21,199 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-08 10:39:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1035 transitions. [2025-03-08 10:39:21,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-08 10:39:21,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:21,201 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-08 10:39:21,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 10:39:21,201 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:21,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:21,202 INFO L85 PathProgramCache]: Analyzing trace with hash 243802085, now seen corresponding path program 1 times [2025-03-08 10:39:21,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:21,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206550332] [2025-03-08 10:39:21,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:21,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:21,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-08 10:39:21,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-08 10:39:21,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:21,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:27,630 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-08 10:39:27,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:39:27,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206550332] [2025-03-08 10:39:27,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206550332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:39:27,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404918133] [2025-03-08 10:39:27,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:27,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:39:27,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:39:27,634 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:39:27,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:39:27,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-08 10:39:27,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-08 10:39:27,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:27,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:27,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 10:39:27,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:39:29,664 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-08 10:39:29,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:39:33,661 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-08 10:39:33,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404918133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:39:33,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:39:33,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 59 [2025-03-08 10:39:33,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742444719] [2025-03-08 10:39:33,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:39:33,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-08 10:39:33,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:39:33,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-08 10:39:33,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=2841, Unknown=0, NotChecked=0, Total=3422 [2025-03-08 10:39:33,664 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-08 10:39:58,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:39:58,567 INFO L93 Difference]: Finished difference Result 8113 states and 11589 transitions. [2025-03-08 10:39:58,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2025-03-08 10:39:58,568 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-08 10:39:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:39:58,592 INFO L225 Difference]: With dead ends: 8113 [2025-03-08 10:39:58,592 INFO L226 Difference]: Without dead ends: 7545 [2025-03-08 10:39:58,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 915 GetRequests, 658 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26771 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=13858, Invalid=52964, Unknown=0, NotChecked=0, Total=66822 [2025-03-08 10:39:58,606 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 5113 mSDsluCounter, 2842 mSDsCounter, 0 mSdLazyCounter, 4939 mSolverCounterSat, 3135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:39:58,606 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.0s Time] [2025-03-08 10:39:58,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7545 states. [2025-03-08 10:39:59,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7545 to 3252. [2025-03-08 10:39:59,152 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-08 10:39:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3252 states to 3252 states and 4681 transitions. [2025-03-08 10:39:59,166 INFO L78 Accepts]: Start accepts. Automaton has 3252 states and 4681 transitions. Word has length 329 [2025-03-08 10:39:59,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:39:59,168 INFO L471 AbstractCegarLoop]: Abstraction has 3252 states and 4681 transitions. [2025-03-08 10:39:59,168 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-08 10:39:59,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3252 states and 4681 transitions. [2025-03-08 10:39:59,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-08 10:39:59,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:39:59,171 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-08 10:39:59,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 10:39:59,371 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-08 10:39:59,371 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:39:59,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:39:59,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1967420764, now seen corresponding path program 1 times [2025-03-08 10:39:59,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:39:59,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029345288] [2025-03-08 10:39:59,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:59,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:39:59,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-08 10:39:59,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-08 10:39:59,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:59,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:39:59,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [223946667] [2025-03-08 10:39:59,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:39:59,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:39:59,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:39:59,478 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:39:59,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 10:39:59,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-08 10:39:59,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-08 10:39:59,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:39:59,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:39:59,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 10:39:59,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:40:03,139 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-08 10:40:03,139 INFO L312 TraceCheckSpWp]: Computing backward predicates...