./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-43.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 193401d70c061c5831a1b71d7cc3ca07095036dca68a71cb93eacc5b67e8e202 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:06:00,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:06:00,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:06:00,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:06:00,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:06:00,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:06:00,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:06:00,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:06:00,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:06:00,298 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:06:00,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:06:00,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:06:00,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:06:00,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:06:00,299 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:06:00,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:06:00,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:06:00,300 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:06:00,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:06:00,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:06:00,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:06:00,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:06:00,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:06:00,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:06:00,300 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:06:00,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:06:00,300 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:06:00,301 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:06:00,301 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:06:00,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:06:00,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:06:00,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:06:00,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:06:00,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:06:00,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:06:00,302 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:06:00,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:06:00,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:06:00,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:06:00,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:06:00,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:06:00,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:06:00,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:06:00,302 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 -> 193401d70c061c5831a1b71d7cc3ca07095036dca68a71cb93eacc5b67e8e202 [2025-03-17 00:06:00,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:06:00,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:06:00,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:06:00,572 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:06:00,572 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:06:00,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-43.i [2025-03-17 00:06:01,746 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11efe3cd0/d90bfec5fb9641c494e67e3565a292f6/FLAGf7cf8d0dc [2025-03-17 00:06:01,993 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:06:01,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-43.i [2025-03-17 00:06:02,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11efe3cd0/d90bfec5fb9641c494e67e3565a292f6/FLAGf7cf8d0dc [2025-03-17 00:06:02,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11efe3cd0/d90bfec5fb9641c494e67e3565a292f6 [2025-03-17 00:06:02,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:06:02,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:06:02,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:06:02,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:06:02,332 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:06:02,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:06:02" (1/1) ... [2025-03-17 00:06:02,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1035e8e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:02, skipping insertion in model container [2025-03-17 00:06:02,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:06:02" (1/1) ... [2025-03-17 00:06:02,365 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:06:02,470 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-43.i[916,929] [2025-03-17 00:06:02,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:06:02,578 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:06:02,590 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-43.i[916,929] [2025-03-17 00:06:02,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:06:02,663 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:06:02,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:02 WrapperNode [2025-03-17 00:06:02,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:06:02,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:06:02,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:06:02,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:06:02,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:02" (1/1) ... [2025-03-17 00:06:02,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:02" (1/1) ... [2025-03-17 00:06:02,733 INFO L138 Inliner]: procedures = 26, calls = 94, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 568 [2025-03-17 00:06:02,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:06:02,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:06:02,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:06:02,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:06:02,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:02" (1/1) ... [2025-03-17 00:06:02,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:02" (1/1) ... [2025-03-17 00:06:02,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:02" (1/1) ... [2025-03-17 00:06:02,784 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-17 00:06:02,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:02" (1/1) ... [2025-03-17 00:06:02,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:02" (1/1) ... [2025-03-17 00:06:02,805 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:02" (1/1) ... [2025-03-17 00:06:02,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:02" (1/1) ... [2025-03-17 00:06:02,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:02" (1/1) ... [2025-03-17 00:06:02,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:02" (1/1) ... [2025-03-17 00:06:02,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:06:02,834 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:06:02,835 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:06:02,835 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:06:02,836 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:02" (1/1) ... [2025-03-17 00:06:02,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:06:02,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:02,865 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-17 00:06:02,868 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-17 00:06:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:06:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:06:02,891 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:06:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:06:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:06:02,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:06:03,015 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:06:03,017 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:06:03,643 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L445: havoc property_#t~bitwise59#1;havoc property_#t~short60#1; [2025-03-17 00:06:03,737 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-17 00:06:03,737 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:06:03,766 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:06:03,766 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:06:03,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:06:03 BoogieIcfgContainer [2025-03-17 00:06:03,770 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:06:03,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:06:03,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:06:03,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:06:03,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:06:02" (1/3) ... [2025-03-17 00:06:03,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522ea851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:06:03, skipping insertion in model container [2025-03-17 00:06:03,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:02" (2/3) ... [2025-03-17 00:06:03,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522ea851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:06:03, skipping insertion in model container [2025-03-17 00:06:03,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:06:03" (3/3) ... [2025-03-17 00:06:03,778 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-43.i [2025-03-17 00:06:03,789 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:06:03,791 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-43.i that has 2 procedures, 233 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:06:03,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:06:03,852 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;@5b3cf5ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:06:03,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:06:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 233 states, 149 states have (on average 1.5436241610738255) internal successors, (230), 150 states have internal predecessors, (230), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 00:06:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-03-17 00:06:03,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:03,876 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:06:03,876 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:03,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:03,882 INFO L85 PathProgramCache]: Analyzing trace with hash 985002987, now seen corresponding path program 1 times [2025-03-17 00:06:03,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:03,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102054739] [2025-03-17 00:06:03,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:03,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:04,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-03-17 00:06:04,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-03-17 00:06:04,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:04,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:04,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:06:04,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:04,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102054739] [2025-03-17 00:06:04,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102054739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:04,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:04,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:06:04,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926752579] [2025-03-17 00:06:04,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:04,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:06:04,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:04,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:06:04,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:06:04,951 INFO L87 Difference]: Start difference. First operand has 233 states, 149 states have (on average 1.5436241610738255) internal successors, (230), 150 states have internal predecessors, (230), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:05,052 INFO L93 Difference]: Finished difference Result 464 states and 865 transitions. [2025-03-17 00:06:05,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:06:05,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 504 [2025-03-17 00:06:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:05,069 INFO L225 Difference]: With dead ends: 464 [2025-03-17 00:06:05,069 INFO L226 Difference]: Without dead ends: 232 [2025-03-17 00:06:05,077 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-17 00:06:05,080 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 0 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:05,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 749 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:06:05,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-17 00:06:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-03-17 00:06:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 149 states have (on average 1.523489932885906) internal successors, (227), 149 states have internal predecessors, (227), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 00:06:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 389 transitions. [2025-03-17 00:06:05,143 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 389 transitions. Word has length 504 [2025-03-17 00:06:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:05,149 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 389 transitions. [2025-03-17 00:06:05,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:05,150 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 389 transitions. [2025-03-17 00:06:05,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-03-17 00:06:05,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:05,161 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:06:05,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 00:06:05,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:05,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:05,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1872506668, now seen corresponding path program 1 times [2025-03-17 00:06:05,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:05,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744579825] [2025-03-17 00:06:05,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:05,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:05,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-03-17 00:06:05,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-03-17 00:06:05,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:05,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:06:05,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:05,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744579825] [2025-03-17 00:06:05,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744579825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:05,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:05,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:06:05,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193051108] [2025-03-17 00:06:05,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:05,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:06:05,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:05,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:06:05,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:06:05,721 INFO L87 Difference]: Start difference. First operand 232 states and 389 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:05,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:05,814 INFO L93 Difference]: Finished difference Result 463 states and 777 transitions. [2025-03-17 00:06:05,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:06:05,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 504 [2025-03-17 00:06:05,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:05,822 INFO L225 Difference]: With dead ends: 463 [2025-03-17 00:06:05,822 INFO L226 Difference]: Without dead ends: 232 [2025-03-17 00:06:05,823 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-17 00:06:05,825 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 385 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:05,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 361 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:06:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-17 00:06:05,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-03-17 00:06:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 149 states have (on average 1.516778523489933) internal successors, (226), 149 states have internal predecessors, (226), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 00:06:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 388 transitions. [2025-03-17 00:06:05,874 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 388 transitions. Word has length 504 [2025-03-17 00:06:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:05,876 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 388 transitions. [2025-03-17 00:06:05,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 388 transitions. [2025-03-17 00:06:05,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-03-17 00:06:05,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:05,884 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:06:05,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:06:05,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:05,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:05,886 INFO L85 PathProgramCache]: Analyzing trace with hash 718903527, now seen corresponding path program 1 times [2025-03-17 00:06:05,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:05,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982231856] [2025-03-17 00:06:05,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:05,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:05,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-03-17 00:06:06,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-03-17 00:06:06,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:06,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:06,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:06:06,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:06,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982231856] [2025-03-17 00:06:06,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982231856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:06,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:06,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:06:06,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809241530] [2025-03-17 00:06:06,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:06,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:06:06,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:06,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:06:06,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:06:06,372 INFO L87 Difference]: Start difference. First operand 232 states and 388 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:06,789 INFO L93 Difference]: Finished difference Result 609 states and 1023 transitions. [2025-03-17 00:06:06,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:06:06,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 505 [2025-03-17 00:06:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:06,796 INFO L225 Difference]: With dead ends: 609 [2025-03-17 00:06:06,801 INFO L226 Difference]: Without dead ends: 378 [2025-03-17 00:06:06,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-17 00:06:06,803 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 785 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:06,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 628 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:06:06,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-17 00:06:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 375. [2025-03-17 00:06:06,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 261 states have (on average 1.5747126436781609) internal successors, (411), 262 states have internal predecessors, (411), 111 states have call successors, (111), 2 states have call predecessors, (111), 2 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-17 00:06:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 633 transitions. [2025-03-17 00:06:06,903 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 633 transitions. Word has length 505 [2025-03-17 00:06:06,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:06,904 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 633 transitions. [2025-03-17 00:06:06,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:06,904 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 633 transitions. [2025-03-17 00:06:06,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-17 00:06:06,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:06,909 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:06:06,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:06:06,909 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:06,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:06,911 INFO L85 PathProgramCache]: Analyzing trace with hash 357399285, now seen corresponding path program 1 times [2025-03-17 00:06:06,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:06,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214024728] [2025-03-17 00:06:06,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:06,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:06,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-17 00:06:07,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-17 00:06:07,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:07,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:06:07,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:07,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214024728] [2025-03-17 00:06:07,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214024728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:07,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:07,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:06:07,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129723469] [2025-03-17 00:06:07,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:07,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:06:07,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:07,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:06:07,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:06:07,455 INFO L87 Difference]: Start difference. First operand 375 states and 633 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:07,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:07,587 INFO L93 Difference]: Finished difference Result 1026 states and 1735 transitions. [2025-03-17 00:06:07,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:06:07,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 506 [2025-03-17 00:06:07,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:07,593 INFO L225 Difference]: With dead ends: 1026 [2025-03-17 00:06:07,594 INFO L226 Difference]: Without dead ends: 652 [2025-03-17 00:06:07,595 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-17 00:06:07,596 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 233 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:07,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 727 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:06:07,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-03-17 00:06:07,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 649. [2025-03-17 00:06:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 470 states have (on average 1.597872340425532) internal successors, (751), 473 states have internal predecessors, (751), 174 states have call successors, (174), 4 states have call predecessors, (174), 4 states have return successors, (174), 171 states have call predecessors, (174), 174 states have call successors, (174) [2025-03-17 00:06:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1099 transitions. [2025-03-17 00:06:07,665 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1099 transitions. Word has length 506 [2025-03-17 00:06:07,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:07,665 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 1099 transitions. [2025-03-17 00:06:07,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1099 transitions. [2025-03-17 00:06:07,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-17 00:06:07,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:07,670 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:06:07,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:06:07,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:07,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:07,671 INFO L85 PathProgramCache]: Analyzing trace with hash -91297354, now seen corresponding path program 1 times [2025-03-17 00:06:07,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:07,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473089549] [2025-03-17 00:06:07,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:07,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:07,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-17 00:06:07,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-17 00:06:07,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:07,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:06:09,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:09,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473089549] [2025-03-17 00:06:09,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473089549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:09,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:09,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 00:06:09,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989097260] [2025-03-17 00:06:09,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:09,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 00:06:09,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:09,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 00:06:09,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:06:09,611 INFO L87 Difference]: Start difference. First operand 649 states and 1099 transitions. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 4 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 4 states have call predecessors, (81), 4 states have call successors, (81) [2025-03-17 00:06:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:12,278 INFO L93 Difference]: Finished difference Result 3040 states and 5109 transitions. [2025-03-17 00:06:12,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 00:06:12,278 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 4 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 4 states have call predecessors, (81), 4 states have call successors, (81) Word has length 506 [2025-03-17 00:06:12,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:12,292 INFO L225 Difference]: With dead ends: 3040 [2025-03-17 00:06:12,292 INFO L226 Difference]: Without dead ends: 2392 [2025-03-17 00:06:12,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2025-03-17 00:06:12,295 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 1671 mSDsluCounter, 2241 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 1094 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1671 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1094 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:12,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1671 Valid, 2791 Invalid, 2583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1094 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 00:06:12,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2025-03-17 00:06:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1988. [2025-03-17 00:06:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1988 states, 1448 states have (on average 1.5953038674033149) internal successors, (2310), 1459 states have internal predecessors, (2310), 523 states have call successors, (523), 16 states have call predecessors, (523), 16 states have return successors, (523), 512 states have call predecessors, (523), 523 states have call successors, (523) [2025-03-17 00:06:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1988 states and 3356 transitions. [2025-03-17 00:06:12,526 INFO L78 Accepts]: Start accepts. Automaton has 1988 states and 3356 transitions. Word has length 506 [2025-03-17 00:06:12,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:12,527 INFO L471 AbstractCegarLoop]: Abstraction has 1988 states and 3356 transitions. [2025-03-17 00:06:12,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 4 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 4 states have call predecessors, (81), 4 states have call successors, (81) [2025-03-17 00:06:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 3356 transitions. [2025-03-17 00:06:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-17 00:06:12,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:12,532 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:06:12,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:06:12,533 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:12,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:12,533 INFO L85 PathProgramCache]: Analyzing trace with hash -122317161, now seen corresponding path program 1 times [2025-03-17 00:06:12,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:12,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724637405] [2025-03-17 00:06:12,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:12,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:12,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-17 00:06:12,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-17 00:06:12,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:12,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:15,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:06:15,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:15,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724637405] [2025-03-17 00:06:15,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724637405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:15,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:15,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 00:06:15,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965954757] [2025-03-17 00:06:15,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:15,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 00:06:15,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:15,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 00:06:15,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:06:15,105 INFO L87 Difference]: Start difference. First operand 1988 states and 3356 transitions. Second operand has 15 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 states have internal predecessors, (104), 5 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 5 states have call predecessors, (81), 5 states have call successors, (81) [2025-03-17 00:06:22,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:22,618 INFO L93 Difference]: Finished difference Result 7525 states and 12649 transitions. [2025-03-17 00:06:22,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 00:06:22,618 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 states have internal predecessors, (104), 5 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 5 states have call predecessors, (81), 5 states have call successors, (81) Word has length 506 [2025-03-17 00:06:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:22,650 INFO L225 Difference]: With dead ends: 7525 [2025-03-17 00:06:22,650 INFO L226 Difference]: Without dead ends: 6877 [2025-03-17 00:06:22,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=354, Invalid=836, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 00:06:22,655 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 4263 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 2780 mSolverCounterSat, 3207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4263 SdHoareTripleChecker+Valid, 2258 SdHoareTripleChecker+Invalid, 5987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3207 IncrementalHoareTripleChecker+Valid, 2780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:22,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4263 Valid, 2258 Invalid, 5987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3207 Valid, 2780 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-17 00:06:22,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6877 states. [2025-03-17 00:06:23,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6877 to 2879. [2025-03-17 00:06:23,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2879 states, 2173 states have (on average 1.63046479521399) internal successors, (3543), 2188 states have internal predecessors, (3543), 681 states have call successors, (681), 24 states have call predecessors, (681), 24 states have return successors, (681), 666 states have call predecessors, (681), 681 states have call successors, (681) [2025-03-17 00:06:23,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2879 states to 2879 states and 4905 transitions. [2025-03-17 00:06:23,036 INFO L78 Accepts]: Start accepts. Automaton has 2879 states and 4905 transitions. Word has length 506 [2025-03-17 00:06:23,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:23,037 INFO L471 AbstractCegarLoop]: Abstraction has 2879 states and 4905 transitions. [2025-03-17 00:06:23,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 states have internal predecessors, (104), 5 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 5 states have call predecessors, (81), 5 states have call successors, (81) [2025-03-17 00:06:23,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2879 states and 4905 transitions. [2025-03-17 00:06:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-17 00:06:23,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:23,042 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:06:23,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:06:23,043 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:23,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:23,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2132421002, now seen corresponding path program 1 times [2025-03-17 00:06:23,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:23,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320381864] [2025-03-17 00:06:23,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:23,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:23,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-17 00:06:23,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-17 00:06:23,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:23,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:06:25,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:25,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320381864] [2025-03-17 00:06:25,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320381864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:25,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:25,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 00:06:25,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142235912] [2025-03-17 00:06:25,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:25,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 00:06:25,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:25,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 00:06:25,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:06:25,128 INFO L87 Difference]: Start difference. First operand 2879 states and 4905 transitions. Second operand has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 14 states have internal predecessors, (104), 3 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) [2025-03-17 00:06:34,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:34,365 INFO L93 Difference]: Finished difference Result 18362 states and 30668 transitions. [2025-03-17 00:06:34,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 00:06:34,366 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 14 states have internal predecessors, (104), 3 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) Word has length 506 [2025-03-17 00:06:34,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:34,442 INFO L225 Difference]: With dead ends: 18362 [2025-03-17 00:06:34,443 INFO L226 Difference]: Without dead ends: 16660 [2025-03-17 00:06:34,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=471, Invalid=1251, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 00:06:34,457 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 4898 mSDsluCounter, 3030 mSDsCounter, 0 mSdLazyCounter, 4249 mSolverCounterSat, 3895 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4898 SdHoareTripleChecker+Valid, 3644 SdHoareTripleChecker+Invalid, 8144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3895 IncrementalHoareTripleChecker+Valid, 4249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:34,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4898 Valid, 3644 Invalid, 8144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3895 Valid, 4249 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-03-17 00:06:34,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16660 states. [2025-03-17 00:06:35,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16660 to 5229. [2025-03-17 00:06:35,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5229 states, 4032 states have (on average 1.6512896825396826) internal successors, (6658), 4059 states have internal predecessors, (6658), 1153 states have call successors, (1153), 43 states have call predecessors, (1153), 43 states have return successors, (1153), 1126 states have call predecessors, (1153), 1153 states have call successors, (1153) [2025-03-17 00:06:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5229 states to 5229 states and 8964 transitions. [2025-03-17 00:06:35,377 INFO L78 Accepts]: Start accepts. Automaton has 5229 states and 8964 transitions. Word has length 506 [2025-03-17 00:06:35,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:35,379 INFO L471 AbstractCegarLoop]: Abstraction has 5229 states and 8964 transitions. [2025-03-17 00:06:35,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 14 states have internal predecessors, (104), 3 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) [2025-03-17 00:06:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 5229 states and 8964 transitions. [2025-03-17 00:06:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-17 00:06:35,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:35,386 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:06:35,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:06:35,386 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:35,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:35,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1439319305, now seen corresponding path program 1 times [2025-03-17 00:06:35,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:35,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110977714] [2025-03-17 00:06:35,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:35,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:35,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-17 00:06:35,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-17 00:06:35,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:35,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:06:35,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:35,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110977714] [2025-03-17 00:06:35,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110977714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:35,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:35,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:06:35,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032869909] [2025-03-17 00:06:35,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:35,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:06:35,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:35,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:06:35,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:06:35,494 INFO L87 Difference]: Start difference. First operand 5229 states and 8964 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:36,274 INFO L93 Difference]: Finished difference Result 11034 states and 18843 transitions. [2025-03-17 00:06:36,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:06:36,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 506 [2025-03-17 00:06:36,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:36,301 INFO L225 Difference]: With dead ends: 11034 [2025-03-17 00:06:36,301 INFO L226 Difference]: Without dead ends: 5928 [2025-03-17 00:06:36,314 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-17 00:06:36,315 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 263 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:36,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 954 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:06:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5928 states. [2025-03-17 00:06:37,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5928 to 5818. [2025-03-17 00:06:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5818 states, 4325 states have (on average 1.5997687861271677) internal successors, (6919), 4360 states have internal predecessors, (6919), 1439 states have call successors, (1439), 53 states have call predecessors, (1439), 53 states have return successors, (1439), 1404 states have call predecessors, (1439), 1439 states have call successors, (1439) [2025-03-17 00:06:37,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5818 states to 5818 states and 9797 transitions. [2025-03-17 00:06:37,143 INFO L78 Accepts]: Start accepts. Automaton has 5818 states and 9797 transitions. Word has length 506 [2025-03-17 00:06:37,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:37,146 INFO L471 AbstractCegarLoop]: Abstraction has 5818 states and 9797 transitions. [2025-03-17 00:06:37,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:37,149 INFO L276 IsEmpty]: Start isEmpty. Operand 5818 states and 9797 transitions. [2025-03-17 00:06:37,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-17 00:06:37,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:37,156 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:06:37,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:06:37,156 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:37,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1848143530, now seen corresponding path program 1 times [2025-03-17 00:06:37,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:37,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958162345] [2025-03-17 00:06:37,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:37,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:37,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-17 00:06:37,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-17 00:06:37,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:37,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:06:37,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:37,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958162345] [2025-03-17 00:06:37,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958162345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:37,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:37,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 00:06:37,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861425833] [2025-03-17 00:06:37,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:37,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:06:37,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:37,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:06:37,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:06:37,972 INFO L87 Difference]: Start difference. First operand 5818 states and 9797 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-17 00:06:40,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:40,490 INFO L93 Difference]: Finished difference Result 14480 states and 24354 transitions. [2025-03-17 00:06:40,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:06:40,491 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) Word has length 506 [2025-03-17 00:06:40,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:40,532 INFO L225 Difference]: With dead ends: 14480 [2025-03-17 00:06:40,532 INFO L226 Difference]: Without dead ends: 8785 [2025-03-17 00:06:40,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:06:40,549 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 1040 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:40,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 1168 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 00:06:40,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8785 states. [2025-03-17 00:06:41,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8785 to 4565. [2025-03-17 00:06:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4565 states, 3386 states have (on average 1.5959834613112818) internal successors, (5404), 3413 states have internal predecessors, (5404), 1137 states have call successors, (1137), 41 states have call predecessors, (1137), 41 states have return successors, (1137), 1110 states have call predecessors, (1137), 1137 states have call successors, (1137) [2025-03-17 00:06:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 7678 transitions. [2025-03-17 00:06:41,242 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 7678 transitions. Word has length 506 [2025-03-17 00:06:41,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:41,243 INFO L471 AbstractCegarLoop]: Abstraction has 4565 states and 7678 transitions. [2025-03-17 00:06:41,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-17 00:06:41,243 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 7678 transitions. [2025-03-17 00:06:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-17 00:06:41,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:41,248 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:06:41,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:06:41,248 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:41,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:41,249 INFO L85 PathProgramCache]: Analyzing trace with hash 934194645, now seen corresponding path program 1 times [2025-03-17 00:06:41,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:41,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102032766] [2025-03-17 00:06:41,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:41,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:41,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-17 00:06:41,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-17 00:06:41,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:41,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:06:41,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:41,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102032766] [2025-03-17 00:06:41,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102032766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:41,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:41,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:06:41,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660647902] [2025-03-17 00:06:41,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:41,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:06:41,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:41,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:06:41,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:06:41,471 INFO L87 Difference]: Start difference. First operand 4565 states and 7678 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-17 00:06:42,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:42,748 INFO L93 Difference]: Finished difference Result 12308 states and 20800 transitions. [2025-03-17 00:06:42,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:06:42,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) Word has length 506 [2025-03-17 00:06:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:42,782 INFO L225 Difference]: With dead ends: 12308 [2025-03-17 00:06:42,782 INFO L226 Difference]: Without dead ends: 7866 [2025-03-17 00:06:42,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:06:42,797 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 369 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:42,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1169 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:06:42,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7866 states. [2025-03-17 00:06:44,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7866 to 7700. [2025-03-17 00:06:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7700 states, 5726 states have (on average 1.5993712888578415) internal successors, (9158), 5771 states have internal predecessors, (9158), 1907 states have call successors, (1907), 66 states have call predecessors, (1907), 66 states have return successors, (1907), 1862 states have call predecessors, (1907), 1907 states have call successors, (1907) [2025-03-17 00:06:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7700 states to 7700 states and 12972 transitions. [2025-03-17 00:06:44,063 INFO L78 Accepts]: Start accepts. Automaton has 7700 states and 12972 transitions. Word has length 506 [2025-03-17 00:06:44,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:44,064 INFO L471 AbstractCegarLoop]: Abstraction has 7700 states and 12972 transitions. [2025-03-17 00:06:44,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-17 00:06:44,065 INFO L276 IsEmpty]: Start isEmpty. Operand 7700 states and 12972 transitions. [2025-03-17 00:06:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-17 00:06:44,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:44,073 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:06:44,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:06:44,073 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:44,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:44,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2026957641, now seen corresponding path program 1 times [2025-03-17 00:06:44,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:44,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541869023] [2025-03-17 00:06:44,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:44,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:44,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-17 00:06:44,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-17 00:06:44,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:44,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:44,429 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 96 proven. 144 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:06:44,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:44,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541869023] [2025-03-17 00:06:44,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541869023] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:06:44,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874054969] [2025-03-17 00:06:44,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:44,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:06:44,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:44,436 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-17 00:06:44,438 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-17 00:06:44,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-17 00:06:44,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-17 00:06:44,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:44,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:44,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 00:06:44,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:06:45,293 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 6288 proven. 144 refuted. 0 times theorem prover too weak. 6528 trivial. 0 not checked. [2025-03-17 00:06:45,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:06:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 96 proven. 144 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:06:45,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874054969] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:06:45,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:06:45,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 00:06:45,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24693293] [2025-03-17 00:06:45,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:06:45,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:06:45,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:45,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:06:45,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:06:45,690 INFO L87 Difference]: Start difference. First operand 7700 states and 12972 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (129), 2 states have call predecessors, (129), 4 states have return successors, (130), 2 states have call predecessors, (130), 2 states have call successors, (130) [2025-03-17 00:06:46,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:46,768 INFO L93 Difference]: Finished difference Result 12067 states and 20128 transitions. [2025-03-17 00:06:46,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:06:46,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (129), 2 states have call predecessors, (129), 4 states have return successors, (130), 2 states have call predecessors, (130), 2 states have call successors, (130) Word has length 506 [2025-03-17 00:06:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:46,820 INFO L225 Difference]: With dead ends: 12067 [2025-03-17 00:06:46,821 INFO L226 Difference]: Without dead ends: 4490 [2025-03-17 00:06:46,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1019 GetRequests, 1009 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:06:46,865 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 220 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:46,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 680 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:06:46,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2025-03-17 00:06:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4270. [2025-03-17 00:06:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4270 states, 3063 states have (on average 1.563499836761345) internal successors, (4789), 3084 states have internal predecessors, (4789), 1151 states have call successors, (1151), 55 states have call predecessors, (1151), 55 states have return successors, (1151), 1130 states have call predecessors, (1151), 1151 states have call successors, (1151) [2025-03-17 00:06:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 7091 transitions. [2025-03-17 00:06:47,809 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 7091 transitions. Word has length 506 [2025-03-17 00:06:47,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:47,810 INFO L471 AbstractCegarLoop]: Abstraction has 4270 states and 7091 transitions. [2025-03-17 00:06:47,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (129), 2 states have call predecessors, (129), 4 states have return successors, (130), 2 states have call predecessors, (130), 2 states have call successors, (130) [2025-03-17 00:06:47,811 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 7091 transitions. [2025-03-17 00:06:47,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-17 00:06:47,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:47,837 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:06:47,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 00:06:48,038 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,SelfDestructingSolverStorable10 [2025-03-17 00:06:48,039 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:48,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:48,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1279366421, now seen corresponding path program 1 times [2025-03-17 00:06:48,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:48,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430411361] [2025-03-17 00:06:48,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:48,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:48,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-17 00:06:48,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-17 00:06:48,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:48,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 165 proven. 75 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:06:49,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430411361] [2025-03-17 00:06:49,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430411361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:06:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278489161] [2025-03-17 00:06:49,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:49,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:06:49,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:49,107 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-17 00:06:49,109 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-17 00:06:49,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-17 00:06:49,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-17 00:06:49,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:49,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:49,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 1116 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 00:06:49,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:06:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 6297 proven. 114 refuted. 0 times theorem prover too weak. 6549 trivial. 0 not checked. [2025-03-17 00:06:49,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:06:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 360 proven. 117 refuted. 0 times theorem prover too weak. 12483 trivial. 0 not checked. [2025-03-17 00:06:50,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278489161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:06:50,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:06:50,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 25 [2025-03-17 00:06:50,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151647728] [2025-03-17 00:06:50,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:06:50,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 00:06:50,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:50,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 00:06:50,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2025-03-17 00:06:50,294 INFO L87 Difference]: Start difference. First operand 4270 states and 7091 transitions. Second operand has 25 states, 25 states have (on average 9.48) internal successors, (237), 25 states have internal predecessors, (237), 10 states have call successors, (187), 3 states have call predecessors, (187), 7 states have return successors, (188), 10 states have call predecessors, (188), 10 states have call successors, (188) [2025-03-17 00:07:00,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:00,751 INFO L93 Difference]: Finished difference Result 11914 states and 19611 transitions. [2025-03-17 00:07:00,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-03-17 00:07:00,752 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.48) internal successors, (237), 25 states have internal predecessors, (237), 10 states have call successors, (187), 3 states have call predecessors, (187), 7 states have return successors, (188), 10 states have call predecessors, (188), 10 states have call successors, (188) Word has length 506 [2025-03-17 00:07:00,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:00,779 INFO L225 Difference]: With dead ends: 11914 [2025-03-17 00:07:00,780 INFO L226 Difference]: Without dead ends: 7771 [2025-03-17 00:07:00,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1158 GetRequests, 1015 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7199 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4628, Invalid=16252, Unknown=0, NotChecked=0, Total=20880 [2025-03-17 00:07:00,796 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 11113 mSDsluCounter, 4568 mSDsCounter, 0 mSdLazyCounter, 6247 mSolverCounterSat, 5808 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11169 SdHoareTripleChecker+Valid, 5177 SdHoareTripleChecker+Invalid, 12055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5808 IncrementalHoareTripleChecker+Valid, 6247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:00,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11169 Valid, 5177 Invalid, 12055 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5808 Valid, 6247 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-03-17 00:07:00,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7771 states. [2025-03-17 00:07:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7771 to 3881. [2025-03-17 00:07:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3881 states, 2847 states have (on average 1.5767474534597823) internal successors, (4489), 2864 states have internal predecessors, (4489), 975 states have call successors, (975), 58 states have call predecessors, (975), 58 states have return successors, (975), 958 states have call predecessors, (975), 975 states have call successors, (975) [2025-03-17 00:07:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3881 states to 3881 states and 6439 transitions. [2025-03-17 00:07:01,626 INFO L78 Accepts]: Start accepts. Automaton has 3881 states and 6439 transitions. Word has length 506 [2025-03-17 00:07:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:01,626 INFO L471 AbstractCegarLoop]: Abstraction has 3881 states and 6439 transitions. [2025-03-17 00:07:01,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.48) internal successors, (237), 25 states have internal predecessors, (237), 10 states have call successors, (187), 3 states have call predecessors, (187), 7 states have return successors, (188), 10 states have call predecessors, (188), 10 states have call successors, (188) [2025-03-17 00:07:01,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3881 states and 6439 transitions. [2025-03-17 00:07:01,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-17 00:07:01,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:01,631 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:07:01,641 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-17 00:07:01,831 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,SelfDestructingSolverStorable11 [2025-03-17 00:07:01,832 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:01,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:01,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1026108756, now seen corresponding path program 1 times [2025-03-17 00:07:01,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:01,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804561385] [2025-03-17 00:07:01,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:01,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:01,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-17 00:07:01,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-17 00:07:01,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:01,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:02,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 189 proven. 51 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:07:02,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:02,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804561385] [2025-03-17 00:07:02,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804561385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:07:02,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783509472] [2025-03-17 00:07:02,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:02,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:07:02,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:07:02,304 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-17 00:07:02,307 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-17 00:07:02,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-17 00:07:02,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-17 00:07:02,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:02,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:02,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 00:07:02,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:07:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 5897 proven. 138 refuted. 0 times theorem prover too weak. 6925 trivial. 0 not checked. [2025-03-17 00:07:02,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:07:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 336 proven. 141 refuted. 0 times theorem prover too weak. 12483 trivial. 0 not checked. [2025-03-17 00:07:03,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783509472] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:07:03,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:07:03,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2025-03-17 00:07:03,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678952302] [2025-03-17 00:07:03,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:07:03,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 00:07:03,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:03,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 00:07:03,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:07:03,382 INFO L87 Difference]: Start difference. First operand 3881 states and 6439 transitions. Second operand has 15 states, 15 states have (on average 13.266666666666667) internal successors, (199), 15 states have internal predecessors, (199), 6 states have call successors, (131), 3 states have call predecessors, (131), 7 states have return successors, (133), 6 states have call predecessors, (133), 6 states have call successors, (133) [2025-03-17 00:07:04,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:04,360 INFO L93 Difference]: Finished difference Result 5591 states and 9241 transitions. [2025-03-17 00:07:04,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 00:07:04,360 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 13.266666666666667) internal successors, (199), 15 states have internal predecessors, (199), 6 states have call successors, (131), 3 states have call predecessors, (131), 7 states have return successors, (133), 6 states have call predecessors, (133), 6 states have call successors, (133) Word has length 506 [2025-03-17 00:07:04,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:04,370 INFO L225 Difference]: With dead ends: 5591 [2025-03-17 00:07:04,370 INFO L226 Difference]: Without dead ends: 1845 [2025-03-17 00:07:04,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 1003 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=565, Unknown=0, NotChecked=0, Total=812 [2025-03-17 00:07:04,378 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 1141 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 759 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 759 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:04,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 830 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [759 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:07:04,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2025-03-17 00:07:04,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1695. [2025-03-17 00:07:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1208 states have (on average 1.521523178807947) internal successors, (1838), 1215 states have internal predecessors, (1838), 449 states have call successors, (449), 37 states have call predecessors, (449), 37 states have return successors, (449), 442 states have call predecessors, (449), 449 states have call successors, (449) [2025-03-17 00:07:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2736 transitions. [2025-03-17 00:07:04,699 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2736 transitions. Word has length 506 [2025-03-17 00:07:04,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:04,700 INFO L471 AbstractCegarLoop]: Abstraction has 1695 states and 2736 transitions. [2025-03-17 00:07:04,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.266666666666667) internal successors, (199), 15 states have internal predecessors, (199), 6 states have call successors, (131), 3 states have call predecessors, (131), 7 states have return successors, (133), 6 states have call predecessors, (133), 6 states have call successors, (133) [2025-03-17 00:07:04,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2736 transitions. [2025-03-17 00:07:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-17 00:07:04,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:04,703 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:07:04,711 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-17 00:07:04,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:07:04,904 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:04,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:04,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1289774506, now seen corresponding path program 1 times [2025-03-17 00:07:04,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:04,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921728356] [2025-03-17 00:07:04,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:04,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:04,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-17 00:07:05,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-17 00:07:05,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:05,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:07:05,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:05,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921728356] [2025-03-17 00:07:05,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921728356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:05,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:05,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 00:07:05,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306395313] [2025-03-17 00:07:05,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:05,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:07:05,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:05,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:07:05,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:07:05,760 INFO L87 Difference]: Start difference. First operand 1695 states and 2736 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-17 00:07:08,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:08,926 INFO L93 Difference]: Finished difference Result 4601 states and 7428 transitions. [2025-03-17 00:07:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 00:07:08,926 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) Word has length 506 [2025-03-17 00:07:08,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:08,941 INFO L225 Difference]: With dead ends: 4601 [2025-03-17 00:07:08,941 INFO L226 Difference]: Without dead ends: 3779 [2025-03-17 00:07:08,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2025-03-17 00:07:08,944 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 1277 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 657 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 657 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:08,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 2224 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [657 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 00:07:08,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3779 states. [2025-03-17 00:07:09,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3779 to 3343. [2025-03-17 00:07:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3343 states, 2433 states have (on average 1.531442663378545) internal successors, (3726), 2449 states have internal predecessors, (3726), 839 states have call successors, (839), 70 states have call predecessors, (839), 70 states have return successors, (839), 823 states have call predecessors, (839), 839 states have call successors, (839) [2025-03-17 00:07:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3343 states to 3343 states and 5404 transitions. [2025-03-17 00:07:09,768 INFO L78 Accepts]: Start accepts. Automaton has 3343 states and 5404 transitions. Word has length 506 [2025-03-17 00:07:09,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:09,769 INFO L471 AbstractCegarLoop]: Abstraction has 3343 states and 5404 transitions. [2025-03-17 00:07:09,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-17 00:07:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3343 states and 5404 transitions. [2025-03-17 00:07:09,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-17 00:07:09,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:09,775 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:07:09,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 00:07:09,776 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:09,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:09,776 INFO L85 PathProgramCache]: Analyzing trace with hash -183616054, now seen corresponding path program 1 times [2025-03-17 00:07:09,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:09,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875817349] [2025-03-17 00:07:09,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:09,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:09,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-17 00:07:09,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-17 00:07:09,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:09,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:10,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 432 proven. 270 refuted. 0 times theorem prover too weak. 12258 trivial. 0 not checked. [2025-03-17 00:07:10,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:10,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875817349] [2025-03-17 00:07:10,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875817349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:07:10,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025224153] [2025-03-17 00:07:10,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:10,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:07:10,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:07:10,503 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-17 00:07:10,505 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-17 00:07:10,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-17 00:07:10,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-17 00:07:10,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:10,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:10,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 00:07:10,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:07:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 8349 proven. 69 refuted. 0 times theorem prover too weak. 4542 trivial. 0 not checked. [2025-03-17 00:07:11,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:07:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 171 proven. 69 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:07:12,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025224153] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:07:12,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:07:12,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2025-03-17 00:07:12,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578636624] [2025-03-17 00:07:12,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:07:12,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 00:07:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:12,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 00:07:12,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2025-03-17 00:07:12,460 INFO L87 Difference]: Start difference. First operand 3343 states and 5404 transitions. Second operand has 21 states, 20 states have (on average 9.6) internal successors, (192), 21 states have internal predecessors, (192), 11 states have call successors, (161), 4 states have call predecessors, (161), 7 states have return successors, (161), 11 states have call predecessors, (161), 11 states have call successors, (161) [2025-03-17 00:07:14,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:14,458 INFO L93 Difference]: Finished difference Result 6703 states and 10752 transitions. [2025-03-17 00:07:14,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 00:07:14,459 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 9.6) internal successors, (192), 21 states have internal predecessors, (192), 11 states have call successors, (161), 4 states have call predecessors, (161), 7 states have return successors, (161), 11 states have call predecessors, (161), 11 states have call successors, (161) Word has length 506 [2025-03-17 00:07:14,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:14,473 INFO L225 Difference]: With dead ends: 6703 [2025-03-17 00:07:14,473 INFO L226 Difference]: Without dead ends: 3503 [2025-03-17 00:07:14,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1039 GetRequests, 1007 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 00:07:14,479 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 1610 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 985 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1612 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 2392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 985 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:14,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1612 Valid, 1300 Invalid, 2392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [985 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 00:07:14,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2025-03-17 00:07:15,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 3415. [2025-03-17 00:07:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3415 states, 2487 states have (on average 1.5126658624849216) internal successors, (3762), 2503 states have internal predecessors, (3762), 839 states have call successors, (839), 88 states have call predecessors, (839), 88 states have return successors, (839), 823 states have call predecessors, (839), 839 states have call successors, (839) [2025-03-17 00:07:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 5440 transitions. [2025-03-17 00:07:15,251 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 5440 transitions. Word has length 506 [2025-03-17 00:07:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:15,251 INFO L471 AbstractCegarLoop]: Abstraction has 3415 states and 5440 transitions. [2025-03-17 00:07:15,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 9.6) internal successors, (192), 21 states have internal predecessors, (192), 11 states have call successors, (161), 4 states have call predecessors, (161), 7 states have return successors, (161), 11 states have call predecessors, (161), 11 states have call successors, (161) [2025-03-17 00:07:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 5440 transitions. [2025-03-17 00:07:15,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-03-17 00:07:15,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:15,255 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:07:15,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0