./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-78.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_operatoramount_amount250_file-78.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 ce36ae11817d8408b28b87366201df9141e6e75d787dae6b6223431c24a32438 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:26:22,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:26:22,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:26:22,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:26:22,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:26:22,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:26:22,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:26:22,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:26:22,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:26:22,414 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:26:22,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:26:22,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:26:22,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:26:22,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:26:22,415 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:26:22,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:26:22,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:26:22,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:26:22,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:26:22,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:26:22,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:26:22,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:26:22,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:26:22,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:26:22,417 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:26:22,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:26:22,417 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:26:22,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:26:22,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:26:22,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:26:22,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:26:22,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:26:22,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:26:22,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:26:22,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:26:22,418 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:26:22,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:26:22,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:26:22,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:26:22,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:26:22,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:26:22,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:26:22,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:26:22,418 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 -> ce36ae11817d8408b28b87366201df9141e6e75d787dae6b6223431c24a32438 [2025-03-08 15:26:22,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:26:22,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:26:22,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:26:22,670 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:26:22,670 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:26:22,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-78.i [2025-03-08 15:26:23,814 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aff0cfc1/e2ac5a09a3d4437a845b672a37a0fa18/FLAG88e0ebfe7 [2025-03-08 15:26:24,111 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:26:24,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-78.i [2025-03-08 15:26:24,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aff0cfc1/e2ac5a09a3d4437a845b672a37a0fa18/FLAG88e0ebfe7 [2025-03-08 15:26:24,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aff0cfc1/e2ac5a09a3d4437a845b672a37a0fa18 [2025-03-08 15:26:24,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:26:24,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:26:24,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:26:24,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:26:24,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:26:24,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:26:24" (1/1) ... [2025-03-08 15:26:24,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d327a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:26:24, skipping insertion in model container [2025-03-08 15:26:24,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:26:24" (1/1) ... [2025-03-08 15:26:24,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:26:24,530 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_operatoramount_amount250_file-78.i[916,929] [2025-03-08 15:26:24,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:26:24,671 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:26:24,682 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_operatoramount_amount250_file-78.i[916,929] [2025-03-08 15:26:24,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:26:24,758 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:26:24,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:26:24 WrapperNode [2025-03-08 15:26:24,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:26:24,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:26:24,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:26:24,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:26:24,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:26:24" (1/1) ... [2025-03-08 15:26:24,780 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:26:24" (1/1) ... [2025-03-08 15:26:24,848 INFO L138 Inliner]: procedures = 26, calls = 69, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2025-03-08 15:26:24,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:26:24,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:26:24,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:26:24,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:26:24,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:26:24" (1/1) ... [2025-03-08 15:26:24,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:26:24" (1/1) ... [2025-03-08 15:26:24,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:26:24" (1/1) ... [2025-03-08 15:26:24,906 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 15:26:24,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:26:24" (1/1) ... [2025-03-08 15:26:24,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:26:24" (1/1) ... [2025-03-08 15:26:24,926 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:26:24" (1/1) ... [2025-03-08 15:26:24,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:26:24" (1/1) ... [2025-03-08 15:26:24,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:26:24" (1/1) ... [2025-03-08 15:26:24,953 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:26:24" (1/1) ... [2025-03-08 15:26:24,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:26:24,964 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:26:24,965 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:26:24,965 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:26:24,966 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:26:24" (1/1) ... [2025-03-08 15:26:24,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:26:24,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:26:24,994 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 15:26:24,999 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 15:26:25,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:26:25,013 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:26:25,013 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:26:25,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:26:25,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:26:25,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:26:25,094 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:26:25,096 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:26:25,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L384: havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~bitwise42#1;havoc property_#t~short43#1;havoc property_#t~ite45#1;havoc property_#t~bitwise44#1;havoc property_#t~short46#1;havoc property_#t~bitwise47#1;havoc property_#t~short48#1; [2025-03-08 15:26:25,774 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-03-08 15:26:25,774 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:26:25,794 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:26:25,794 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:26:25,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:26:25 BoogieIcfgContainer [2025-03-08 15:26:25,795 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:26:25,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:26:25,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:26:25,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:26:25,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:26:24" (1/3) ... [2025-03-08 15:26:25,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72960cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:26:25, skipping insertion in model container [2025-03-08 15:26:25,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:26:24" (2/3) ... [2025-03-08 15:26:25,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72960cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:26:25, skipping insertion in model container [2025-03-08 15:26:25,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:26:25" (3/3) ... [2025-03-08 15:26:25,802 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-78.i [2025-03-08 15:26:25,813 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:26:25,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-78.i that has 2 procedures, 201 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:26:25,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:26:25,869 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;@510f0001, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:26:25,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:26:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 143 states have internal predecessors, (215), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 15:26:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-08 15:26:25,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:26:25,893 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:25,894 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:26:25,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:26:25,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2118246385, now seen corresponding path program 1 times [2025-03-08 15:26:25,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:26:25,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585372960] [2025-03-08 15:26:25,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:25,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:26:25,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-08 15:26:26,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-08 15:26:26,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:26:26,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:26:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-03-08 15:26:26,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:26:26,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585372960] [2025-03-08 15:26:26,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585372960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:26:26,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768489430] [2025-03-08 15:26:26,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:26,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:26:26,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:26:26,325 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 15:26:26,339 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 15:26:26,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-08 15:26:26,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-08 15:26:26,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:26:26,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:26:26,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:26:26,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:26:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-03-08 15:26:26,603 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:26:26,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768489430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:26:26,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:26:26,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:26:26,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680051611] [2025-03-08 15:26:26,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:26:26,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:26:26,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:26:26,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:26:26,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:26:26,634 INFO L87 Difference]: Start difference. First operand has 201 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 143 states have internal predecessors, (215), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-08 15:26:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:26:26,690 INFO L93 Difference]: Finished difference Result 396 states and 705 transitions. [2025-03-08 15:26:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:26:26,693 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) Word has length 365 [2025-03-08 15:26:26,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:26:26,700 INFO L225 Difference]: With dead ends: 396 [2025-03-08 15:26:26,701 INFO L226 Difference]: Without dead ends: 198 [2025-03-08 15:26:26,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 366 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 15:26:26,709 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:26:26,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 314 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:26:26,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-08 15:26:26,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-03-08 15:26:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 140 states have (on average 1.5) internal successors, (210), 140 states have internal predecessors, (210), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 15:26:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 322 transitions. [2025-03-08 15:26:26,762 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 322 transitions. Word has length 365 [2025-03-08 15:26:26,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:26:26,763 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 322 transitions. [2025-03-08 15:26:26,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-08 15:26:26,763 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 322 transitions. [2025-03-08 15:26:26,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-08 15:26:26,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:26:26,772 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:26,782 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 15:26:26,974 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 15:26:26,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:26:26,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:26:26,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1703932465, now seen corresponding path program 1 times [2025-03-08 15:26:26,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:26:26,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430155518] [2025-03-08 15:26:26,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:26,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:26:27,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-08 15:26:27,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-08 15:26:27,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:26:27,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:26:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-08 15:26:27,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:26:27,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430155518] [2025-03-08 15:26:27,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430155518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:26:27,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:26:27,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:26:27,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683404201] [2025-03-08 15:26:27,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:26:27,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:26:27,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:26:27,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:26:27,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:26:27,317 INFO L87 Difference]: Start difference. First operand 198 states and 322 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:26:27,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:26:27,482 INFO L93 Difference]: Finished difference Result 585 states and 954 transitions. [2025-03-08 15:26:27,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:26:27,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 365 [2025-03-08 15:26:27,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:26:27,489 INFO L225 Difference]: With dead ends: 585 [2025-03-08 15:26:27,490 INFO L226 Difference]: Without dead ends: 390 [2025-03-08 15:26:27,491 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 15:26:27,493 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 297 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:26:27,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 624 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:26:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-08 15:26:27,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 386. [2025-03-08 15:26:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 271 states have (on average 1.4612546125461254) internal successors, (396), 271 states have internal predecessors, (396), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-08 15:26:27,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 620 transitions. [2025-03-08 15:26:27,550 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 620 transitions. Word has length 365 [2025-03-08 15:26:27,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:26:27,551 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 620 transitions. [2025-03-08 15:26:27,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:26:27,551 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 620 transitions. [2025-03-08 15:26:27,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-08 15:26:27,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:26:27,556 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:27,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:26:27,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:26:27,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:26:27,558 INFO L85 PathProgramCache]: Analyzing trace with hash -554022116, now seen corresponding path program 1 times [2025-03-08 15:26:27,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:26:27,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326620190] [2025-03-08 15:26:27,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:27,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:26:27,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-08 15:26:27,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-08 15:26:27,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:26:27,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:26:27,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-08 15:26:27,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:26:27,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326620190] [2025-03-08 15:26:27,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326620190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:26:27,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:26:27,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:26:27,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185543073] [2025-03-08 15:26:27,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:26:27,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:26:27,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:26:27,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:26:27,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:26:27,882 INFO L87 Difference]: Start difference. First operand 386 states and 620 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:26:28,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:26:28,043 INFO L93 Difference]: Finished difference Result 779 states and 1253 transitions. [2025-03-08 15:26:28,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:26:28,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 366 [2025-03-08 15:26:28,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:26:28,050 INFO L225 Difference]: With dead ends: 779 [2025-03-08 15:26:28,050 INFO L226 Difference]: Without dead ends: 396 [2025-03-08 15:26:28,052 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 15:26:28,053 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 281 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:26:28,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 754 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:26:28,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-08 15:26:28,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 392. [2025-03-08 15:26:28,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 277 states have (on average 1.44043321299639) internal successors, (399), 277 states have internal predecessors, (399), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-08 15:26:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 623 transitions. [2025-03-08 15:26:28,094 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 623 transitions. Word has length 366 [2025-03-08 15:26:28,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:26:28,095 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 623 transitions. [2025-03-08 15:26:28,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:26:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 623 transitions. [2025-03-08 15:26:28,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-08 15:26:28,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:26:28,099 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:28,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:26:28,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:26:28,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:26:28,100 INFO L85 PathProgramCache]: Analyzing trace with hash -962846341, now seen corresponding path program 1 times [2025-03-08 15:26:28,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:26:28,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123409626] [2025-03-08 15:26:28,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:28,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:26:28,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-08 15:26:28,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-08 15:26:28,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:26:28,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:26:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-08 15:26:29,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:26:29,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123409626] [2025-03-08 15:26:29,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123409626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:26:29,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:26:29,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:26:29,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369970247] [2025-03-08 15:26:29,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:26:29,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:26:29,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:26:29,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:26:29,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:26:29,074 INFO L87 Difference]: Start difference. First operand 392 states and 623 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:26:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:26:29,773 INFO L93 Difference]: Finished difference Result 1422 states and 2257 transitions. [2025-03-08 15:26:29,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:26:29,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 366 [2025-03-08 15:26:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:26:29,779 INFO L225 Difference]: With dead ends: 1422 [2025-03-08 15:26:29,779 INFO L226 Difference]: Without dead ends: 1033 [2025-03-08 15:26:29,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:26:29,782 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 1062 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:26:29,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 1552 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:26:29,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2025-03-08 15:26:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 771. [2025-03-08 15:26:29,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 550 states have (on average 1.4363636363636363) internal successors, (790), 551 states have internal predecessors, (790), 216 states have call successors, (216), 4 states have call predecessors, (216), 4 states have return successors, (216), 215 states have call predecessors, (216), 216 states have call successors, (216) [2025-03-08 15:26:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1222 transitions. [2025-03-08 15:26:29,867 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1222 transitions. Word has length 366 [2025-03-08 15:26:29,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:26:29,868 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1222 transitions. [2025-03-08 15:26:29,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:26:29,868 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1222 transitions. [2025-03-08 15:26:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-08 15:26:29,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:26:29,873 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:29,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:26:29,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:26:29,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:26:29,874 INFO L85 PathProgramCache]: Analyzing trace with hash 648746571, now seen corresponding path program 1 times [2025-03-08 15:26:29,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:26:29,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465329506] [2025-03-08 15:26:29,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:29,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:26:29,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-08 15:26:30,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-08 15:26:30,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:26:30,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:26:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-08 15:26:30,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:26:30,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465329506] [2025-03-08 15:26:30,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465329506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:26:30,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:26:30,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:26:30,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787826521] [2025-03-08 15:26:30,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:26:30,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:26:30,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:26:30,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:26:30,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:26:30,555 INFO L87 Difference]: Start difference. First operand 771 states and 1222 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:26:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:26:30,943 INFO L93 Difference]: Finished difference Result 2835 states and 4486 transitions. [2025-03-08 15:26:30,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:26:30,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 367 [2025-03-08 15:26:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:26:30,956 INFO L225 Difference]: With dead ends: 2835 [2025-03-08 15:26:30,956 INFO L226 Difference]: Without dead ends: 2067 [2025-03-08 15:26:30,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:26:30,961 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 526 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:26:30,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1130 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:26:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2025-03-08 15:26:31,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1619. [2025-03-08 15:26:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1234 states have (on average 1.46677471636953) internal successors, (1810), 1239 states have internal predecessors, (1810), 376 states have call successors, (376), 8 states have call predecessors, (376), 8 states have return successors, (376), 371 states have call predecessors, (376), 376 states have call successors, (376) [2025-03-08 15:26:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 2562 transitions. [2025-03-08 15:26:31,088 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 2562 transitions. Word has length 367 [2025-03-08 15:26:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:26:31,089 INFO L471 AbstractCegarLoop]: Abstraction has 1619 states and 2562 transitions. [2025-03-08 15:26:31,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:26:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 2562 transitions. [2025-03-08 15:26:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-08 15:26:31,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:26:31,092 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:31,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:26:31,093 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:26:31,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:26:31,094 INFO L85 PathProgramCache]: Analyzing trace with hash 408206442, now seen corresponding path program 1 times [2025-03-08 15:26:31,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:26:31,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906913963] [2025-03-08 15:26:31,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:31,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:26:31,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-08 15:26:31,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-08 15:26:31,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:26:31,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:26:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-08 15:26:31,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:26:31,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906913963] [2025-03-08 15:26:31,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906913963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:26:31,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:26:31,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:26:31,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69058234] [2025-03-08 15:26:31,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:26:31,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:26:31,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:26:31,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:26:31,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:26:31,450 INFO L87 Difference]: Start difference. First operand 1619 states and 2562 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:26:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:26:31,623 INFO L93 Difference]: Finished difference Result 4067 states and 6443 transitions. [2025-03-08 15:26:31,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:26:31,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 367 [2025-03-08 15:26:31,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:26:31,637 INFO L225 Difference]: With dead ends: 4067 [2025-03-08 15:26:31,638 INFO L226 Difference]: Without dead ends: 2451 [2025-03-08 15:26:31,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 15:26:31,642 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 214 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:26:31,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 755 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:26:31,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2025-03-08 15:26:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2449. [2025-03-08 15:26:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2449 states, 1803 states have (on average 1.442595673876872) internal successors, (2601), 1810 states have internal predecessors, (2601), 632 states have call successors, (632), 13 states have call predecessors, (632), 13 states have return successors, (632), 625 states have call predecessors, (632), 632 states have call successors, (632) [2025-03-08 15:26:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 3865 transitions. [2025-03-08 15:26:31,813 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 3865 transitions. Word has length 367 [2025-03-08 15:26:31,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:26:31,813 INFO L471 AbstractCegarLoop]: Abstraction has 2449 states and 3865 transitions. [2025-03-08 15:26:31,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:26:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 3865 transitions. [2025-03-08 15:26:31,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-03-08 15:26:31,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:26:31,817 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:31,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:26:31,818 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:26:31,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:26:31,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1684648220, now seen corresponding path program 1 times [2025-03-08 15:26:31,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:26:31,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058222450] [2025-03-08 15:26:31,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:31,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:26:31,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-08 15:26:31,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-08 15:26:31,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:26:31,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:26:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-08 15:26:32,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:26:32,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058222450] [2025-03-08 15:26:32,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058222450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:26:32,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:26:32,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:26:32,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322602500] [2025-03-08 15:26:32,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:26:32,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:26:32,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:26:32,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:26:32,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:26:32,113 INFO L87 Difference]: Start difference. First operand 2449 states and 3865 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:26:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:26:32,465 INFO L93 Difference]: Finished difference Result 6263 states and 9885 transitions. [2025-03-08 15:26:32,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:26:32,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 368 [2025-03-08 15:26:32,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:26:32,490 INFO L225 Difference]: With dead ends: 6263 [2025-03-08 15:26:32,491 INFO L226 Difference]: Without dead ends: 3885 [2025-03-08 15:26:32,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 15:26:32,501 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 196 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:26:32,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 715 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:26:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3885 states. [2025-03-08 15:26:32,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3885 to 3883. [2025-03-08 15:26:32,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3883 states, 2853 states have (on average 1.4332281808622502) internal successors, (4089), 2865 states have internal predecessors, (4089), 1008 states have call successors, (1008), 21 states have call predecessors, (1008), 21 states have return successors, (1008), 996 states have call predecessors, (1008), 1008 states have call successors, (1008) [2025-03-08 15:26:32,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 6105 transitions. [2025-03-08 15:26:32,857 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 6105 transitions. Word has length 368 [2025-03-08 15:26:32,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:26:32,857 INFO L471 AbstractCegarLoop]: Abstraction has 3883 states and 6105 transitions. [2025-03-08 15:26:32,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:26:32,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 6105 transitions. [2025-03-08 15:26:32,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-03-08 15:26:32,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:26:32,861 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:32,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:26:32,861 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:26:32,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:26:32,862 INFO L85 PathProgramCache]: Analyzing trace with hash 631197097, now seen corresponding path program 1 times [2025-03-08 15:26:32,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:26:32,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709103262] [2025-03-08 15:26:32,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:32,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:26:32,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-08 15:26:33,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-08 15:26:33,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:26:33,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:26:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-08 15:26:33,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:26:33,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709103262] [2025-03-08 15:26:33,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709103262] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:26:33,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037766858] [2025-03-08 15:26:33,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:33,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:26:33,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:26:33,756 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 15:26:33,757 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 15:26:33,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-08 15:26:33,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-08 15:26:33,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:26:33,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:26:33,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:26:33,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:26:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 1329 proven. 18 refuted. 0 times theorem prover too weak. 4813 trivial. 0 not checked. [2025-03-08 15:26:34,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:26:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 147 proven. 18 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-08 15:26:34,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037766858] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:26:34,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:26:34,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2025-03-08 15:26:34,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404039410] [2025-03-08 15:26:34,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:26:34,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 15:26:34,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:26:34,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 15:26:34,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:26:34,380 INFO L87 Difference]: Start difference. First operand 3883 states and 6105 transitions. Second operand has 12 states, 12 states have (on average 13.5) internal successors, (162), 12 states have internal predecessors, (162), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) [2025-03-08 15:26:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:26:35,886 INFO L93 Difference]: Finished difference Result 8134 states and 12711 transitions. [2025-03-08 15:26:35,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 15:26:35,887 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.5) internal successors, (162), 12 states have internal predecessors, (162), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) Word has length 368 [2025-03-08 15:26:35,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:26:35,910 INFO L225 Difference]: With dead ends: 8134 [2025-03-08 15:26:35,910 INFO L226 Difference]: Without dead ends: 4208 [2025-03-08 15:26:35,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 761 GetRequests, 737 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2025-03-08 15:26:35,924 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1038 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:26:35,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1774 Invalid, 1827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 15:26:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4208 states. [2025-03-08 15:26:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4208 to 3421. [2025-03-08 15:26:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3421 states, 2595 states have (on average 1.4354527938342967) internal successors, (3725), 2602 states have internal predecessors, (3725), 784 states have call successors, (784), 41 states have call predecessors, (784), 41 states have return successors, (784), 777 states have call predecessors, (784), 784 states have call successors, (784) [2025-03-08 15:26:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3421 states to 3421 states and 5293 transitions. [2025-03-08 15:26:36,218 INFO L78 Accepts]: Start accepts. Automaton has 3421 states and 5293 transitions. Word has length 368 [2025-03-08 15:26:36,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:26:36,219 INFO L471 AbstractCegarLoop]: Abstraction has 3421 states and 5293 transitions. [2025-03-08 15:26:36,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.5) internal successors, (162), 12 states have internal predecessors, (162), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) [2025-03-08 15:26:36,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3421 states and 5293 transitions. [2025-03-08 15:26:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-08 15:26:36,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:26:36,221 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:36,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:26:36,422 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,SelfDestructingSolverStorable7 [2025-03-08 15:26:36,422 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:26:36,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:26:36,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1516603290, now seen corresponding path program 1 times [2025-03-08 15:26:36,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:26:36,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9123328] [2025-03-08 15:26:36,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:36,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:26:36,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-08 15:26:36,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-08 15:26:36,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:26:36,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:26:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 6 proven. 159 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-08 15:26:37,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:26:37,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9123328] [2025-03-08 15:26:37,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9123328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:26:37,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947937891] [2025-03-08 15:26:37,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:37,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:26:37,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:26:37,502 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 15:26:37,504 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 15:26:37,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-08 15:26:37,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-08 15:26:37,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:26:37,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:26:37,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 15:26:37,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:26:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2905 proven. 267 refuted. 0 times theorem prover too weak. 2988 trivial. 0 not checked. [2025-03-08 15:26:39,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:26:39,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947937891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:26:39,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:26:39,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2025-03-08 15:26:39,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017428422] [2025-03-08 15:26:39,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:26:39,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 15:26:39,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:26:39,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 15:26:39,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-03-08 15:26:39,750 INFO L87 Difference]: Start difference. First operand 3421 states and 5293 transitions. Second operand has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 6 states have call successors, (109), 4 states have call predecessors, (109), 6 states have return successors, (109), 6 states have call predecessors, (109), 6 states have call successors, (109) [2025-03-08 15:26:42,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:26:42,160 INFO L93 Difference]: Finished difference Result 14503 states and 21770 transitions. [2025-03-08 15:26:42,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 15:26:42,161 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 6 states have call successors, (109), 4 states have call predecessors, (109), 6 states have return successors, (109), 6 states have call predecessors, (109), 6 states have call successors, (109) Word has length 369 [2025-03-08 15:26:42,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:26:42,207 INFO L225 Difference]: With dead ends: 14503 [2025-03-08 15:26:42,208 INFO L226 Difference]: Without dead ends: 11157 [2025-03-08 15:26:42,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=657, Invalid=1695, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 15:26:42,218 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 1579 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1579 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:26:42,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1579 Valid, 1328 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 15:26:42,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11157 states. [2025-03-08 15:26:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11157 to 6421. [2025-03-08 15:26:42,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6421 states, 5454 states have (on average 1.4453612027869454) internal successors, (7883), 5476 states have internal predecessors, (7883), 814 states have call successors, (814), 152 states have call predecessors, (814), 152 states have return successors, (814), 792 states have call predecessors, (814), 814 states have call successors, (814) [2025-03-08 15:26:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6421 states to 6421 states and 9511 transitions. [2025-03-08 15:26:42,611 INFO L78 Accepts]: Start accepts. Automaton has 6421 states and 9511 transitions. Word has length 369 [2025-03-08 15:26:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:26:42,613 INFO L471 AbstractCegarLoop]: Abstraction has 6421 states and 9511 transitions. [2025-03-08 15:26:42,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 6 states have call successors, (109), 4 states have call predecessors, (109), 6 states have return successors, (109), 6 states have call predecessors, (109), 6 states have call successors, (109) [2025-03-08 15:26:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 6421 states and 9511 transitions. [2025-03-08 15:26:42,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-03-08 15:26:42,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:26:42,619 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:42,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 15:26:42,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:26:42,820 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:26:42,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:26:42,821 INFO L85 PathProgramCache]: Analyzing trace with hash 711408938, now seen corresponding path program 1 times [2025-03-08 15:26:42,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:26:42,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981146279] [2025-03-08 15:26:42,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:42,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:26:42,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-03-08 15:26:43,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-03-08 15:26:43,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:26:43,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:26:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 6 proven. 159 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-08 15:26:43,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:26:43,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981146279] [2025-03-08 15:26:43,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981146279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:26:43,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072210260] [2025-03-08 15:26:43,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:43,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:26:43,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:26:43,710 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:26:43,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 15:26:43,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-03-08 15:26:43,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-03-08 15:26:43,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:26:43,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:26:43,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 15:26:43,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:26:46,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3689 proven. 804 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2025-03-08 15:26:46,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:26:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 132 proven. 510 refuted. 0 times theorem prover too weak. 5518 trivial. 0 not checked. [2025-03-08 15:26:48,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072210260] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:26:48,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:26:48,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 25, 17] total 45 [2025-03-08 15:26:48,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562737465] [2025-03-08 15:26:48,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:26:48,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 15:26:48,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:26:48,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 15:26:48,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=1526, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 15:26:48,249 INFO L87 Difference]: Start difference. First operand 6421 states and 9511 transitions. Second operand has 45 states, 43 states have (on average 6.27906976744186) internal successors, (270), 41 states have internal predecessors, (270), 15 states have call successors, (162), 8 states have call predecessors, (162), 16 states have return successors, (163), 15 states have call predecessors, (163), 15 states have call successors, (163) [2025-03-08 15:26:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:26:55,299 INFO L93 Difference]: Finished difference Result 28444 states and 40847 transitions. [2025-03-08 15:26:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2025-03-08 15:26:55,300 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 6.27906976744186) internal successors, (270), 41 states have internal predecessors, (270), 15 states have call successors, (162), 8 states have call predecessors, (162), 16 states have return successors, (163), 15 states have call predecessors, (163), 15 states have call successors, (163) Word has length 370 [2025-03-08 15:26:55,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:26:55,353 INFO L225 Difference]: With dead ends: 28444 [2025-03-08 15:26:55,353 INFO L226 Difference]: Without dead ends: 22122 [2025-03-08 15:26:55,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7549 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5350, Invalid=17906, Unknown=0, NotChecked=0, Total=23256 [2025-03-08 15:26:55,369 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 3053 mSDsluCounter, 2610 mSDsCounter, 0 mSdLazyCounter, 4753 mSolverCounterSat, 746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3053 SdHoareTripleChecker+Valid, 2912 SdHoareTripleChecker+Invalid, 5499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 746 IncrementalHoareTripleChecker+Valid, 4753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:26:55,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3053 Valid, 2912 Invalid, 5499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [746 Valid, 4753 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 15:26:55,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22122 states. [2025-03-08 15:26:56,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22122 to 9806. [2025-03-08 15:26:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9806 states, 7842 states have (on average 1.3889313950522826) internal successors, (10892), 7873 states have internal predecessors, (10892), 1546 states have call successors, (1546), 417 states have call predecessors, (1546), 417 states have return successors, (1546), 1515 states have call predecessors, (1546), 1546 states have call successors, (1546) [2025-03-08 15:26:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9806 states to 9806 states and 13984 transitions. [2025-03-08 15:26:56,592 INFO L78 Accepts]: Start accepts. Automaton has 9806 states and 13984 transitions. Word has length 370 [2025-03-08 15:26:56,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:26:56,593 INFO L471 AbstractCegarLoop]: Abstraction has 9806 states and 13984 transitions. [2025-03-08 15:26:56,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 6.27906976744186) internal successors, (270), 41 states have internal predecessors, (270), 15 states have call successors, (162), 8 states have call predecessors, (162), 16 states have return successors, (163), 15 states have call predecessors, (163), 15 states have call successors, (163) [2025-03-08 15:26:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 9806 states and 13984 transitions. [2025-03-08 15:26:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-08 15:26:56,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:26:56,599 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:26:56,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 15:26:56,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:26:56,800 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:26:56,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:26:56,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1831968804, now seen corresponding path program 1 times [2025-03-08 15:26:56,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:26:56,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166203714] [2025-03-08 15:26:56,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:26:56,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:26:56,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-08 15:26:56,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-08 15:26:56,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:26:56,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:26:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-08 15:26:57,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:26:57,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166203714] [2025-03-08 15:26:57,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166203714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:26:57,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:26:57,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:26:57,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914294856] [2025-03-08 15:26:57,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:26:57,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:26:57,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:26:57,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:26:57,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:26:57,149 INFO L87 Difference]: Start difference. First operand 9806 states and 13984 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-08 15:26:59,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:26:59,615 INFO L93 Difference]: Finished difference Result 30610 states and 43793 transitions. [2025-03-08 15:26:59,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:26:59,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 371 [2025-03-08 15:26:59,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:26:59,682 INFO L225 Difference]: With dead ends: 30610 [2025-03-08 15:26:59,682 INFO L226 Difference]: Without dead ends: 24150 [2025-03-08 15:26:59,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:26:59,700 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 688 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:26:59,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 1330 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:26:59,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24150 states. [2025-03-08 15:27:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24150 to 24146. [2025-03-08 15:27:01,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24146 states, 19426 states have (on average 1.3934932564604139) internal successors, (27070), 19501 states have internal predecessors, (27070), 3714 states have call successors, (3714), 1005 states have call predecessors, (3714), 1005 states have return successors, (3714), 3639 states have call predecessors, (3714), 3714 states have call successors, (3714) [2025-03-08 15:27:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24146 states to 24146 states and 34498 transitions. [2025-03-08 15:27:01,924 INFO L78 Accepts]: Start accepts. Automaton has 24146 states and 34498 transitions. Word has length 371 [2025-03-08 15:27:01,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:27:01,925 INFO L471 AbstractCegarLoop]: Abstraction has 24146 states and 34498 transitions. [2025-03-08 15:27:01,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-08 15:27:01,926 INFO L276 IsEmpty]: Start isEmpty. Operand 24146 states and 34498 transitions. [2025-03-08 15:27:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-08 15:27:01,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:27:01,932 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:27:01,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:27:01,932 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:27:01,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:27:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1538565797, now seen corresponding path program 1 times [2025-03-08 15:27:01,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:27:01,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532174085] [2025-03-08 15:27:01,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:01,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:27:01,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-08 15:27:02,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-08 15:27:02,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:02,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 81 proven. 243 refuted. 0 times theorem prover too weak. 5836 trivial. 0 not checked. [2025-03-08 15:27:02,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:27:02,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532174085] [2025-03-08 15:27:02,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532174085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:27:02,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114071625] [2025-03-08 15:27:02,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:02,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:27:02,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:27:02,936 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:27:02,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 15:27:03,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-08 15:27:03,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-08 15:27:03,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:03,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:03,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 15:27:03,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:27:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3744 proven. 432 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 15:27:04,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:27:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 192 proven. 450 refuted. 0 times theorem prover too weak. 5518 trivial. 0 not checked. [2025-03-08 15:27:05,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114071625] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:27:05,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:27:05,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15] total 31 [2025-03-08 15:27:05,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63137194] [2025-03-08 15:27:05,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:27:05,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 15:27:05,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:27:05,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 15:27:05,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2025-03-08 15:27:05,559 INFO L87 Difference]: Start difference. First operand 24146 states and 34498 transitions. Second operand has 31 states, 30 states have (on average 7.233333333333333) internal successors, (217), 29 states have internal predecessors, (217), 11 states have call successors, (162), 5 states have call predecessors, (162), 12 states have return successors, (163), 11 states have call predecessors, (163), 11 states have call successors, (163) [2025-03-08 15:27:08,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:27:08,917 INFO L93 Difference]: Finished difference Result 60512 states and 86115 transitions. [2025-03-08 15:27:08,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 15:27:08,918 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 7.233333333333333) internal successors, (217), 29 states have internal predecessors, (217), 11 states have call successors, (162), 5 states have call predecessors, (162), 12 states have return successors, (163), 11 states have call predecessors, (163), 11 states have call successors, (163) Word has length 371 [2025-03-08 15:27:08,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:27:09,014 INFO L225 Difference]: With dead ends: 60512 [2025-03-08 15:27:09,014 INFO L226 Difference]: Without dead ends: 36481 [2025-03-08 15:27:09,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=665, Invalid=1405, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 15:27:09,057 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 1039 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:27:09,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 1123 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 15:27:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36481 states. [2025-03-08 15:27:10,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36481 to 14294. [2025-03-08 15:27:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14294 states, 11863 states have (on average 1.3814380848014836) internal successors, (16388), 11880 states have internal predecessors, (16388), 1856 states have call successors, (1856), 574 states have call predecessors, (1856), 574 states have return successors, (1856), 1839 states have call predecessors, (1856), 1856 states have call successors, (1856) [2025-03-08 15:27:10,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14294 states to 14294 states and 20100 transitions. [2025-03-08 15:27:10,471 INFO L78 Accepts]: Start accepts. Automaton has 14294 states and 20100 transitions. Word has length 371 [2025-03-08 15:27:10,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:27:10,472 INFO L471 AbstractCegarLoop]: Abstraction has 14294 states and 20100 transitions. [2025-03-08 15:27:10,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 7.233333333333333) internal successors, (217), 29 states have internal predecessors, (217), 11 states have call successors, (162), 5 states have call predecessors, (162), 12 states have return successors, (163), 11 states have call predecessors, (163), 11 states have call successors, (163) [2025-03-08 15:27:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 14294 states and 20100 transitions. [2025-03-08 15:27:10,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-08 15:27:10,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:27:10,475 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:27:10,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 15:27:10,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 15:27:10,676 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:27:10,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:27:10,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1510162774, now seen corresponding path program 1 times [2025-03-08 15:27:10,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:27:10,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918854545] [2025-03-08 15:27:10,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:10,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:27:10,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-08 15:27:10,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-08 15:27:10,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:10,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 318 proven. 159 refuted. 0 times theorem prover too weak. 5683 trivial. 0 not checked. [2025-03-08 15:27:11,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:27:11,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918854545] [2025-03-08 15:27:11,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918854545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:27:11,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950237120] [2025-03-08 15:27:11,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:11,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:27:11,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:27:11,494 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:27:11,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 15:27:11,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-08 15:27:11,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-08 15:27:11,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:11,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:11,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 15:27:11,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:27:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 4385 proven. 306 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2025-03-08 15:27:12,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:27:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 444 proven. 198 refuted. 0 times theorem prover too weak. 5518 trivial. 0 not checked. [2025-03-08 15:27:15,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950237120] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:27:15,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:27:15,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20, 17] total 41 [2025-03-08 15:27:15,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751543593] [2025-03-08 15:27:15,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:27:15,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 15:27:15,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:27:15,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 15:27:15,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 15:27:15,823 INFO L87 Difference]: Start difference. First operand 14294 states and 20100 transitions. Second operand has 41 states, 38 states have (on average 6.2631578947368425) internal successors, (238), 36 states have internal predecessors, (238), 13 states have call successors, (125), 6 states have call predecessors, (125), 13 states have return successors, (127), 13 states have call predecessors, (127), 13 states have call successors, (127)