./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-76.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 0be401d6498cca46882a4cc3fc239228ee20ea10357489f3f675e5f70b0bebf7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:02:03,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:02:03,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:02:03,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:02:03,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:02:03,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:02:03,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:02:03,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:02:03,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:02:03,537 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:02:03,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:02:03,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:02:03,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:02:03,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:02:03,538 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:02:03,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:02:03,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:02:03,538 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:02:03,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:02:03,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:02:03,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:02:03,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:02:03,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:02:03,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:02:03,539 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:02:03,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:02:03,539 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:02:03,539 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:02:03,539 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:02:03,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:02:03,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:02:03,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:02:03,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:02:03,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:02:03,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:02:03,540 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:02:03,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:02:03,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:02:03,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:02:03,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:02:03,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:02:03,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:02:03,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:02:03,541 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 -> 0be401d6498cca46882a4cc3fc239228ee20ea10357489f3f675e5f70b0bebf7 [2025-03-08 11:02:03,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:02:03,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:02:03,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:02:03,808 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:02:03,808 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:02:03,809 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-76.i [2025-03-08 11:02:05,004 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5ad49455/a3ac84f1e0f841b4a85aeb43076c96c0/FLAG9e71dab31 [2025-03-08 11:02:05,256 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:02:05,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-76.i [2025-03-08 11:02:05,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5ad49455/a3ac84f1e0f841b4a85aeb43076c96c0/FLAG9e71dab31 [2025-03-08 11:02:05,568 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5ad49455/a3ac84f1e0f841b4a85aeb43076c96c0 [2025-03-08 11:02:05,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:02:05,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:02:05,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:02:05,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:02:05,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:02:05,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:02:05" (1/1) ... [2025-03-08 11:02:05,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6190a588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:05, skipping insertion in model container [2025-03-08 11:02:05,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:02:05" (1/1) ... [2025-03-08 11:02:05,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:02:05,715 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-76.i[916,929] [2025-03-08 11:02:05,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:02:05,838 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:02:05,847 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-76.i[916,929] [2025-03-08 11:02:05,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:02:05,926 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:02:05,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:05 WrapperNode [2025-03-08 11:02:05,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:02:05,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:02:05,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:02:05,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:02:05,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:05" (1/1) ... [2025-03-08 11:02:05,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:05" (1/1) ... [2025-03-08 11:02:05,991 INFO L138 Inliner]: procedures = 26, calls = 113, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 629 [2025-03-08 11:02:05,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:02:05,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:02:05,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:02:05,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:02:06,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:05" (1/1) ... [2025-03-08 11:02:06,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:05" (1/1) ... [2025-03-08 11:02:06,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:05" (1/1) ... [2025-03-08 11:02:06,042 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:02:06,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:05" (1/1) ... [2025-03-08 11:02:06,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:05" (1/1) ... [2025-03-08 11:02:06,057 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:05" (1/1) ... [2025-03-08 11:02:06,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:05" (1/1) ... [2025-03-08 11:02:06,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:05" (1/1) ... [2025-03-08 11:02:06,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:05" (1/1) ... [2025-03-08 11:02:06,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:02:06,084 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:02:06,084 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:02:06,084 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:02:06,085 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:05" (1/1) ... [2025-03-08 11:02:06,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:02:06,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:02:06,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:02:06,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:02:06,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:02:06,138 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:02:06,138 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:02:06,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:02:06,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:02:06,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:02:06,229 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:02:06,231 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:02:06,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L493: havoc property_#t~bitwise67#1;havoc property_#t~short68#1; [2025-03-08 11:02:06,946 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 11:02:06,947 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:02:06,973 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:02:06,973 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:02:06,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:02:06 BoogieIcfgContainer [2025-03-08 11:02:06,974 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:02:06,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:02:06,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:02:06,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:02:06,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:02:05" (1/3) ... [2025-03-08 11:02:06,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2bdad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:02:06, skipping insertion in model container [2025-03-08 11:02:06,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:05" (2/3) ... [2025-03-08 11:02:06,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2bdad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:02:06, skipping insertion in model container [2025-03-08 11:02:06,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:02:06" (3/3) ... [2025-03-08 11:02:06,980 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-76.i [2025-03-08 11:02:06,992 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:02:06,994 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-76.i that has 2 procedures, 268 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:02:07,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:02:07,053 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;@4b052453, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:02:07,054 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:02:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 268 states, 165 states have (on average 1.5151515151515151) internal successors, (250), 166 states have internal predecessors, (250), 100 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 11:02:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2025-03-08 11:02:07,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:07,089 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:07,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:07,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:07,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1827845949, now seen corresponding path program 1 times [2025-03-08 11:02:07,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:07,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058093239] [2025-03-08 11:02:07,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:07,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:07,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes. [2025-03-08 11:02:07,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements. [2025-03-08 11:02:07,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:07,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 19602 trivial. 0 not checked. [2025-03-08 11:02:07,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:07,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058093239] [2025-03-08 11:02:07,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058093239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:02:07,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224064807] [2025-03-08 11:02:07,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:07,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:02:07,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:02:07,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:02:07,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:02:07,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes. [2025-03-08 11:02:07,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements. [2025-03-08 11:02:07,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:07,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:07,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:02:07,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:02:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 19602 trivial. 0 not checked. [2025-03-08 11:02:07,999 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:02:07,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224064807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:07,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:02:08,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:02:08,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834801389] [2025-03-08 11:02:08,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:08,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:02:08,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:08,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:02:08,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:02:08,025 INFO L87 Difference]: Start difference. First operand has 268 states, 165 states have (on average 1.5151515151515151) internal successors, (250), 166 states have internal predecessors, (250), 100 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) Second operand has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (100), 2 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 2 states have call successors, (100) [2025-03-08 11:02:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:08,089 INFO L93 Difference]: Finished difference Result 525 states and 987 transitions. [2025-03-08 11:02:08,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:02:08,091 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (100), 2 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 2 states have call successors, (100) Word has length 602 [2025-03-08 11:02:08,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:08,096 INFO L225 Difference]: With dead ends: 525 [2025-03-08 11:02:08,096 INFO L226 Difference]: Without dead ends: 260 [2025-03-08 11:02:08,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 603 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:02:08,103 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:08,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 426 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:02:08,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-08 11:02:08,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2025-03-08 11:02:08,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 158 states have (on average 1.481012658227848) internal successors, (234), 158 states have internal predecessors, (234), 100 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 11:02:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2025-03-08 11:02:08,170 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 602 [2025-03-08 11:02:08,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:08,171 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2025-03-08 11:02:08,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (100), 2 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 2 states have call successors, (100) [2025-03-08 11:02:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2025-03-08 11:02:08,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2025-03-08 11:02:08,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:08,180 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:08,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 11:02:08,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:02:08,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:08,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:08,386 INFO L85 PathProgramCache]: Analyzing trace with hash 114760639, now seen corresponding path program 1 times [2025-03-08 11:02:08,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:08,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052380183] [2025-03-08 11:02:08,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:08,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:08,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes. [2025-03-08 11:02:08,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements. [2025-03-08 11:02:08,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:08,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:09,168 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-03-08 11:02:09,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:09,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052380183] [2025-03-08 11:02:09,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052380183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:09,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:09,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:02:09,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792052508] [2025-03-08 11:02:09,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:09,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:02:09,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:09,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:02:09,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:09,174 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:09,242 INFO L93 Difference]: Finished difference Result 518 states and 867 transitions. [2025-03-08 11:02:09,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:02:09,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 602 [2025-03-08 11:02:09,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:09,250 INFO L225 Difference]: With dead ends: 518 [2025-03-08 11:02:09,252 INFO L226 Difference]: Without dead ends: 261 [2025-03-08 11:02:09,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:09,254 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 0 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:09,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 845 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:02:09,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-08 11:02:09,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2025-03-08 11:02:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 159 states have internal predecessors, (235), 100 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 11:02:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 435 transitions. [2025-03-08 11:02:09,296 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 435 transitions. Word has length 602 [2025-03-08 11:02:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:09,300 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 435 transitions. [2025-03-08 11:02:09,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 435 transitions. [2025-03-08 11:02:09,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-03-08 11:02:09,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:09,308 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:09,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:02:09,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:09,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:09,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1474234463, now seen corresponding path program 1 times [2025-03-08 11:02:09,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:09,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79714039] [2025-03-08 11:02:09,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:09,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:09,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-03-08 11:02:09,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-03-08 11:02:09,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:09,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:09,690 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-03-08 11:02:09,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:09,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79714039] [2025-03-08 11:02:09,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79714039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:09,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:09,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:02:09,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15276830] [2025-03-08 11:02:09,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:09,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:02:09,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:09,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:02:09,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:09,694 INFO L87 Difference]: Start difference. First operand 261 states and 435 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:09,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:09,765 INFO L93 Difference]: Finished difference Result 645 states and 1080 transitions. [2025-03-08 11:02:09,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:02:09,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 603 [2025-03-08 11:02:09,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:09,773 INFO L225 Difference]: With dead ends: 645 [2025-03-08 11:02:09,773 INFO L226 Difference]: Without dead ends: 387 [2025-03-08 11:02:09,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:09,776 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 190 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:09,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 895 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:02:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-08 11:02:09,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 384. [2025-03-08 11:02:09,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 267 states have (on average 1.5580524344569289) internal successors, (416), 268 states have internal predecessors, (416), 114 states have call successors, (114), 2 states have call predecessors, (114), 2 states have return successors, (114), 113 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-08 11:02:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 644 transitions. [2025-03-08 11:02:09,825 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 644 transitions. Word has length 603 [2025-03-08 11:02:09,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:09,828 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 644 transitions. [2025-03-08 11:02:09,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:09,829 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 644 transitions. [2025-03-08 11:02:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-03-08 11:02:09,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:09,837 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:09,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:02:09,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:09,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:09,838 INFO L85 PathProgramCache]: Analyzing trace with hash 449540542, now seen corresponding path program 1 times [2025-03-08 11:02:09,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:09,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627230565] [2025-03-08 11:02:09,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:09,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:09,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-03-08 11:02:09,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-03-08 11:02:09,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:09,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-03-08 11:02:10,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:10,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627230565] [2025-03-08 11:02:10,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627230565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:10,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:10,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:02:10,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652259712] [2025-03-08 11:02:10,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:10,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:02:10,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:10,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:02:10,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:10,160 INFO L87 Difference]: Start difference. First operand 384 states and 644 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:10,216 INFO L93 Difference]: Finished difference Result 772 states and 1290 transitions. [2025-03-08 11:02:10,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:02:10,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 603 [2025-03-08 11:02:10,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:10,219 INFO L225 Difference]: With dead ends: 772 [2025-03-08 11:02:10,220 INFO L226 Difference]: Without dead ends: 391 [2025-03-08 11:02:10,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:10,225 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 188 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:10,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 945 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:02:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-08 11:02:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 335. [2025-03-08 11:02:10,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 232 states have (on average 1.5732758620689655) internal successors, (365), 232 states have internal predecessors, (365), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 11:02:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 565 transitions. [2025-03-08 11:02:10,244 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 565 transitions. Word has length 603 [2025-03-08 11:02:10,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:10,245 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 565 transitions. [2025-03-08 11:02:10,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:10,245 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 565 transitions. [2025-03-08 11:02:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-03-08 11:02:10,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:10,248 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:10,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:02:10,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:10,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:10,249 INFO L85 PathProgramCache]: Analyzing trace with hash -394931329, now seen corresponding path program 1 times [2025-03-08 11:02:10,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:10,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427270658] [2025-03-08 11:02:10,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:10,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:10,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-03-08 11:02:10,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-03-08 11:02:10,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:10,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-03-08 11:02:10,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:10,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427270658] [2025-03-08 11:02:10,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427270658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:10,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:10,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:02:10,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935144921] [2025-03-08 11:02:10,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:10,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:02:10,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:10,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:02:10,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:10,403 INFO L87 Difference]: Start difference. First operand 335 states and 565 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:10,446 INFO L93 Difference]: Finished difference Result 691 states and 1161 transitions. [2025-03-08 11:02:10,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:02:10,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 603 [2025-03-08 11:02:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:10,450 INFO L225 Difference]: With dead ends: 691 [2025-03-08 11:02:10,450 INFO L226 Difference]: Without dead ends: 359 [2025-03-08 11:02:10,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:10,452 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 32 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:10,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 834 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:02:10,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-08 11:02:10,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 347. [2025-03-08 11:02:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 244 states have (on average 1.569672131147541) internal successors, (383), 244 states have internal predecessors, (383), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 11:02:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 583 transitions. [2025-03-08 11:02:10,469 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 583 transitions. Word has length 603 [2025-03-08 11:02:10,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:10,470 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 583 transitions. [2025-03-08 11:02:10,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 583 transitions. [2025-03-08 11:02:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-03-08 11:02:10,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:10,476 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:10,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:02:10,477 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:10,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:10,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1902483138, now seen corresponding path program 1 times [2025-03-08 11:02:10,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:10,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141218882] [2025-03-08 11:02:10,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:10,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:10,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-03-08 11:02:10,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-03-08 11:02:10,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:10,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-03-08 11:02:10,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:10,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141218882] [2025-03-08 11:02:10,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141218882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:10,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:10,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:02:10,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723755112] [2025-03-08 11:02:10,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:10,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:02:10,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:10,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:02:10,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:02:10,970 INFO L87 Difference]: Start difference. First operand 347 states and 583 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 2 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 2 states have call predecessors, (100), 2 states have call successors, (100) [2025-03-08 11:02:11,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:11,892 INFO L93 Difference]: Finished difference Result 1379 states and 2323 transitions. [2025-03-08 11:02:11,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:02:11,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 2 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 2 states have call predecessors, (100), 2 states have call successors, (100) Word has length 603 [2025-03-08 11:02:11,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:11,900 INFO L225 Difference]: With dead ends: 1379 [2025-03-08 11:02:11,900 INFO L226 Difference]: Without dead ends: 1035 [2025-03-08 11:02:11,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:02:11,903 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 803 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:11,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 2570 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 11:02:11,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2025-03-08 11:02:11,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1029. [2025-03-08 11:02:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 722 states have (on average 1.574792243767313) internal successors, (1137), 722 states have internal predecessors, (1137), 300 states have call successors, (300), 6 states have call predecessors, (300), 6 states have return successors, (300), 300 states have call predecessors, (300), 300 states have call successors, (300) [2025-03-08 11:02:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1737 transitions. [2025-03-08 11:02:11,969 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1737 transitions. Word has length 603 [2025-03-08 11:02:11,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:11,970 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1737 transitions. [2025-03-08 11:02:11,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 2 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 2 states have call predecessors, (100), 2 states have call successors, (100) [2025-03-08 11:02:11,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1737 transitions. [2025-03-08 11:02:11,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-03-08 11:02:11,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:11,974 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:11,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:02:11,974 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:11,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:11,974 INFO L85 PathProgramCache]: Analyzing trace with hash 595532799, now seen corresponding path program 1 times [2025-03-08 11:02:11,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:11,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854818309] [2025-03-08 11:02:11,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:11,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:11,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-03-08 11:02:12,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-03-08 11:02:12,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:12,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-03-08 11:02:12,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:12,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854818309] [2025-03-08 11:02:12,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854818309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:12,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:12,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:02:12,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762188728] [2025-03-08 11:02:12,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:12,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:02:12,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:12,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:02:12,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:12,258 INFO L87 Difference]: Start difference. First operand 1029 states and 1737 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:12,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:12,295 INFO L93 Difference]: Finished difference Result 1373 states and 2317 transitions. [2025-03-08 11:02:12,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:02:12,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 603 [2025-03-08 11:02:12,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:12,301 INFO L225 Difference]: With dead ends: 1373 [2025-03-08 11:02:12,301 INFO L226 Difference]: Without dead ends: 688 [2025-03-08 11:02:12,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:12,304 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 0 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:12,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 844 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:02:12,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-08 11:02:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 345. [2025-03-08 11:02:12,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 242 states have (on average 1.5661157024793388) internal successors, (379), 242 states have internal predecessors, (379), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 11:02:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 579 transitions. [2025-03-08 11:02:12,331 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 579 transitions. Word has length 603 [2025-03-08 11:02:12,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:12,332 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 579 transitions. [2025-03-08 11:02:12,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:12,333 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 579 transitions. [2025-03-08 11:02:12,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2025-03-08 11:02:12,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:12,336 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:12,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:02:12,336 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:12,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:12,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1761427339, now seen corresponding path program 1 times [2025-03-08 11:02:12,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:12,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944389747] [2025-03-08 11:02:12,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:12,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:12,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 605 statements into 1 equivalence classes. [2025-03-08 11:02:12,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 605 of 605 statements. [2025-03-08 11:02:12,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:12,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-03-08 11:02:12,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:12,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944389747] [2025-03-08 11:02:12,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944389747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:12,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:12,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:02:12,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199849254] [2025-03-08 11:02:12,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:12,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:02:12,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:12,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:02:12,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:02:12,613 INFO L87 Difference]: Start difference. First operand 345 states and 579 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:12,872 INFO L93 Difference]: Finished difference Result 1157 states and 1945 transitions. [2025-03-08 11:02:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:02:12,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 605 [2025-03-08 11:02:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:12,877 INFO L225 Difference]: With dead ends: 1157 [2025-03-08 11:02:12,878 INFO L226 Difference]: Without dead ends: 815 [2025-03-08 11:02:12,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:02:12,879 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 514 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:12,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 2138 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:02:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2025-03-08 11:02:12,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 670. [2025-03-08 11:02:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 521 states have (on average 1.6314779270633397) internal successors, (850), 522 states have internal predecessors, (850), 144 states have call successors, (144), 4 states have call predecessors, (144), 4 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-08 11:02:12,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1138 transitions. [2025-03-08 11:02:12,913 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1138 transitions. Word has length 605 [2025-03-08 11:02:12,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:12,913 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 1138 transitions. [2025-03-08 11:02:12,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:12,914 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1138 transitions. [2025-03-08 11:02:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-03-08 11:02:12,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:12,919 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:12,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:02:12,919 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:12,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:12,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1048379741, now seen corresponding path program 1 times [2025-03-08 11:02:12,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:12,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932471449] [2025-03-08 11:02:12,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:12,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:12,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-08 11:02:12,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-08 11:02:12,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:12,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-03-08 11:02:13,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:13,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932471449] [2025-03-08 11:02:13,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932471449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:13,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:13,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:02:13,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970544281] [2025-03-08 11:02:13,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:13,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:02:13,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:13,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:02:13,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:02:13,160 INFO L87 Difference]: Start difference. First operand 670 states and 1138 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:13,454 INFO L93 Difference]: Finished difference Result 1571 states and 2664 transitions. [2025-03-08 11:02:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:02:13,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 606 [2025-03-08 11:02:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:13,461 INFO L225 Difference]: With dead ends: 1571 [2025-03-08 11:02:13,461 INFO L226 Difference]: Without dead ends: 904 [2025-03-08 11:02:13,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:02:13,465 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 257 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:13,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1790 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:02:13,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2025-03-08 11:02:13,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 672. [2025-03-08 11:02:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 523 states have (on average 1.632887189292543) internal successors, (854), 524 states have internal predecessors, (854), 144 states have call successors, (144), 4 states have call predecessors, (144), 4 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-08 11:02:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1142 transitions. [2025-03-08 11:02:13,493 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1142 transitions. Word has length 606 [2025-03-08 11:02:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:13,494 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 1142 transitions. [2025-03-08 11:02:13,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1142 transitions. [2025-03-08 11:02:13,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-03-08 11:02:13,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:13,498 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:13,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:02:13,498 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:13,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1651701194, now seen corresponding path program 1 times [2025-03-08 11:02:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:13,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146536882] [2025-03-08 11:02:13,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:13,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-08 11:02:13,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-08 11:02:13,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:13,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-03-08 11:02:13,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:13,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146536882] [2025-03-08 11:02:13,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146536882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:13,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:13,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:02:13,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976819681] [2025-03-08 11:02:13,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:13,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:02:13,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:13,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:02:13,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:13,635 INFO L87 Difference]: Start difference. First operand 672 states and 1142 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:13,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:13,686 INFO L93 Difference]: Finished difference Result 1617 states and 2710 transitions. [2025-03-08 11:02:13,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:02:13,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 606 [2025-03-08 11:02:13,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:13,692 INFO L225 Difference]: With dead ends: 1617 [2025-03-08 11:02:13,692 INFO L226 Difference]: Without dead ends: 948 [2025-03-08 11:02:13,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:13,693 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 136 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:13,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 896 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:02:13,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-03-08 11:02:13,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 944. [2025-03-08 11:02:13,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 747 states have (on average 1.5903614457831325) internal successors, (1188), 750 states have internal predecessors, (1188), 188 states have call successors, (188), 8 states have call predecessors, (188), 8 states have return successors, (188), 185 states have call predecessors, (188), 188 states have call successors, (188) [2025-03-08 11:02:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1564 transitions. [2025-03-08 11:02:13,732 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1564 transitions. Word has length 606 [2025-03-08 11:02:13,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:13,733 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1564 transitions. [2025-03-08 11:02:13,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1564 transitions. [2025-03-08 11:02:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-03-08 11:02:13,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:13,737 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:13,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:02:13,737 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:13,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:13,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1682721001, now seen corresponding path program 1 times [2025-03-08 11:02:13,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:13,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384343746] [2025-03-08 11:02:13,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:13,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:13,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-08 11:02:13,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-08 11:02:13,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:13,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-03-08 11:02:13,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:13,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384343746] [2025-03-08 11:02:13,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384343746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:13,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:13,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:02:13,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258103199] [2025-03-08 11:02:13,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:13,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:02:13,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:13,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:02:13,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:02:13,985 INFO L87 Difference]: Start difference. First operand 944 states and 1564 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:14,290 INFO L93 Difference]: Finished difference Result 2826 states and 4686 transitions. [2025-03-08 11:02:14,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:02:14,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 606 [2025-03-08 11:02:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:14,301 INFO L225 Difference]: With dead ends: 2826 [2025-03-08 11:02:14,302 INFO L226 Difference]: Without dead ends: 1885 [2025-03-08 11:02:14,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 11:02:14,304 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 237 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:14,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1051 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:02:14,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2025-03-08 11:02:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 1879. [2025-03-08 11:02:14,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1486 states have (on average 1.5881561238223418) internal successors, (2360), 1492 states have internal predecessors, (2360), 376 states have call successors, (376), 16 states have call predecessors, (376), 16 states have return successors, (376), 370 states have call predecessors, (376), 376 states have call successors, (376) [2025-03-08 11:02:14,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 3112 transitions. [2025-03-08 11:02:14,400 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 3112 transitions. Word has length 606 [2025-03-08 11:02:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:14,401 INFO L471 AbstractCegarLoop]: Abstraction has 1879 states and 3112 transitions. [2025-03-08 11:02:14,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 3112 transitions. [2025-03-08 11:02:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-03-08 11:02:14,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:14,405 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:14,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:02:14,405 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:14,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:14,406 INFO L85 PathProgramCache]: Analyzing trace with hash 815294936, now seen corresponding path program 1 times [2025-03-08 11:02:14,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:14,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102611470] [2025-03-08 11:02:14,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:14,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:14,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-08 11:02:14,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-08 11:02:14,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:14,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-03-08 11:02:14,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:14,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102611470] [2025-03-08 11:02:14,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102611470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:14,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:14,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:02:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650028708] [2025-03-08 11:02:14,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:14,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:02:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:14,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:02:14,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:02:14,910 INFO L87 Difference]: Start difference. First operand 1879 states and 3112 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:15,144 INFO L93 Difference]: Finished difference Result 4757 states and 7717 transitions. [2025-03-08 11:02:15,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:02:15,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 606 [2025-03-08 11:02:15,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:15,158 INFO L225 Difference]: With dead ends: 4757 [2025-03-08 11:02:15,158 INFO L226 Difference]: Without dead ends: 2881 [2025-03-08 11:02:15,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:02:15,163 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 416 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:15,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1152 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:02:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2025-03-08 11:02:15,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1871. [2025-03-08 11:02:15,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1478 states have (on average 1.5832205683355887) internal successors, (2340), 1484 states have internal predecessors, (2340), 376 states have call successors, (376), 16 states have call predecessors, (376), 16 states have return successors, (376), 370 states have call predecessors, (376), 376 states have call successors, (376) [2025-03-08 11:02:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 3092 transitions. [2025-03-08 11:02:15,294 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 3092 transitions. Word has length 606 [2025-03-08 11:02:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:15,295 INFO L471 AbstractCegarLoop]: Abstraction has 1871 states and 3092 transitions. [2025-03-08 11:02:15,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 3092 transitions. [2025-03-08 11:02:15,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-03-08 11:02:15,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:15,301 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:15,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:02:15,302 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:15,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:15,302 INFO L85 PathProgramCache]: Analyzing trace with hash 959639096, now seen corresponding path program 1 times [2025-03-08 11:02:15,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:15,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312459214] [2025-03-08 11:02:15,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:15,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:15,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-08 11:02:15,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-08 11:02:15,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:15,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 57 proven. 240 refuted. 0 times theorem prover too weak. 19503 trivial. 0 not checked. [2025-03-08 11:02:15,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:15,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312459214] [2025-03-08 11:02:15,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312459214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:02:15,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290002263] [2025-03-08 11:02:15,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:15,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:02:15,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:02:15,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:02:15,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:02:15,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-08 11:02:16,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-08 11:02:16,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:16,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:16,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 1319 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:02:16,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:02:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 6217 proven. 240 refuted. 0 times theorem prover too weak. 13343 trivial. 0 not checked. [2025-03-08 11:02:16,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:02:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 57 proven. 240 refuted. 0 times theorem prover too weak. 19503 trivial. 0 not checked. [2025-03-08 11:02:17,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290002263] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:02:17,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:02:17,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 11:02:17,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975881540] [2025-03-08 11:02:17,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:02:17,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:02:17,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:17,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:02:17,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:02:17,275 INFO L87 Difference]: Start difference. First operand 1871 states and 3092 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 2 states have call predecessors, (181), 2 states have call successors, (181) [2025-03-08 11:02:17,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:17,730 INFO L93 Difference]: Finished difference Result 3819 states and 6253 transitions. [2025-03-08 11:02:17,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:02:17,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 2 states have call predecessors, (181), 2 states have call successors, (181) Word has length 606 [2025-03-08 11:02:17,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:17,740 INFO L225 Difference]: With dead ends: 3819 [2025-03-08 11:02:17,740 INFO L226 Difference]: Without dead ends: 1951 [2025-03-08 11:02:17,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1219 GetRequests, 1209 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:02:17,744 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 195 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:17,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 752 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:02:17,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2025-03-08 11:02:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1903. [2025-03-08 11:02:17,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1502 states have (on average 1.5579227696404794) internal successors, (2340), 1508 states have internal predecessors, (2340), 376 states have call successors, (376), 24 states have call predecessors, (376), 24 states have return successors, (376), 370 states have call predecessors, (376), 376 states have call successors, (376) [2025-03-08 11:02:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 3092 transitions. [2025-03-08 11:02:17,823 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 3092 transitions. Word has length 606 [2025-03-08 11:02:17,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:17,823 INFO L471 AbstractCegarLoop]: Abstraction has 1903 states and 3092 transitions. [2025-03-08 11:02:17,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 2 states have call predecessors, (181), 2 states have call successors, (181) [2025-03-08 11:02:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 3092 transitions. [2025-03-08 11:02:17,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-03-08 11:02:17,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:17,827 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:17,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 11:02:18,028 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,SelfDestructingSolverStorable12 [2025-03-08 11:02:18,029 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:18,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:18,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1965032676, now seen corresponding path program 1 times [2025-03-08 11:02:18,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:18,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470883387] [2025-03-08 11:02:18,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:18,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:18,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-03-08 11:02:18,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-03-08 11:02:18,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:18,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 123 proven. 174 refuted. 0 times theorem prover too weak. 19503 trivial. 0 not checked. [2025-03-08 11:02:19,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:19,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470883387] [2025-03-08 11:02:19,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470883387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:02:19,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181201728] [2025-03-08 11:02:19,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:19,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:02:19,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:02:19,050 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:02:19,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 11:02:19,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-03-08 11:02:19,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-03-08 11:02:19,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:19,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:19,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 1319 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 11:02:19,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:02:21,466 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 12237 proven. 420 refuted. 0 times theorem prover too weak. 7143 trivial. 0 not checked. [2025-03-08 11:02:21,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:02:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 291 proven. 300 refuted. 0 times theorem prover too weak. 19209 trivial. 0 not checked. [2025-03-08 11:02:22,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181201728] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:02:22,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:02:22,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 11] total 22 [2025-03-08 11:02:22,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62096062] [2025-03-08 11:02:22,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:02:22,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 11:02:22,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:22,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 11:02:22,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-08 11:02:22,261 INFO L87 Difference]: Start difference. First operand 1903 states and 3092 transitions. Second operand has 22 states, 21 states have (on average 10.047619047619047) internal successors, (211), 20 states have internal predecessors, (211), 7 states have call successors, (216), 4 states have call predecessors, (216), 8 states have return successors, (217), 7 states have call predecessors, (217), 7 states have call successors, (217) [2025-03-08 11:02:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:27,341 INFO L93 Difference]: Finished difference Result 13033 states and 20479 transitions. [2025-03-08 11:02:27,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-08 11:02:27,342 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 10.047619047619047) internal successors, (211), 20 states have internal predecessors, (211), 7 states have call successors, (216), 4 states have call predecessors, (216), 8 states have return successors, (217), 7 states have call predecessors, (217), 7 states have call successors, (217) Word has length 607 [2025-03-08 11:02:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:27,403 INFO L225 Difference]: With dead ends: 13033 [2025-03-08 11:02:27,406 INFO L226 Difference]: Without dead ends: 11133 [2025-03-08 11:02:27,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1268 GetRequests, 1208 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1077, Invalid=2705, Unknown=0, NotChecked=0, Total=3782 [2025-03-08 11:02:27,415 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 2173 mSDsluCounter, 2720 mSDsCounter, 0 mSdLazyCounter, 3310 mSolverCounterSat, 1234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2214 SdHoareTripleChecker+Valid, 3338 SdHoareTripleChecker+Invalid, 4544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1234 IncrementalHoareTripleChecker+Valid, 3310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:27,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2214 Valid, 3338 Invalid, 4544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1234 Valid, 3310 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-08 11:02:27,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11133 states. [2025-03-08 11:02:27,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11133 to 6905. [2025-03-08 11:02:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6905 states, 5556 states have (on average 1.5298776097912168) internal successors, (8500), 5584 states have internal predecessors, (8500), 1232 states have call successors, (1232), 116 states have call predecessors, (1232), 116 states have return successors, (1232), 1204 states have call predecessors, (1232), 1232 states have call successors, (1232) [2025-03-08 11:02:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6905 states to 6905 states and 10964 transitions. [2025-03-08 11:02:27,862 INFO L78 Accepts]: Start accepts. Automaton has 6905 states and 10964 transitions. Word has length 607 [2025-03-08 11:02:27,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:27,863 INFO L471 AbstractCegarLoop]: Abstraction has 6905 states and 10964 transitions. [2025-03-08 11:02:27,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 10.047619047619047) internal successors, (211), 20 states have internal predecessors, (211), 7 states have call successors, (216), 4 states have call predecessors, (216), 8 states have return successors, (217), 7 states have call predecessors, (217), 7 states have call successors, (217) [2025-03-08 11:02:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 6905 states and 10964 transitions. [2025-03-08 11:02:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-08 11:02:27,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:27,870 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:27,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 11:02:28,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:02:28,074 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:28,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:28,075 INFO L85 PathProgramCache]: Analyzing trace with hash -550233451, now seen corresponding path program 1 times [2025-03-08 11:02:28,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:28,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285255177] [2025-03-08 11:02:28,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:28,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:28,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 11:02:28,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 11:02:28,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:28,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:28,333 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-03-08 11:02:28,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:28,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285255177] [2025-03-08 11:02:28,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285255177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:28,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:28,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:02:28,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703762324] [2025-03-08 11:02:28,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:28,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:02:28,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:28,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:02:28,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:28,336 INFO L87 Difference]: Start difference. First operand 6905 states and 10964 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:28,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:28,900 INFO L93 Difference]: Finished difference Result 20709 states and 32886 transitions. [2025-03-08 11:02:28,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:02:28,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 608 [2025-03-08 11:02:28,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:28,941 INFO L225 Difference]: With dead ends: 20709 [2025-03-08 11:02:28,941 INFO L226 Difference]: Without dead ends: 13807 [2025-03-08 11:02:28,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:28,957 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 258 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:28,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 824 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:02:28,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13807 states. [2025-03-08 11:02:29,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13807 to 13769. [2025-03-08 11:02:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13769 states, 11072 states have (on average 1.5252890173410405) internal successors, (16888), 11128 states have internal predecessors, (16888), 2464 states have call successors, (2464), 232 states have call predecessors, (2464), 232 states have return successors, (2464), 2408 states have call predecessors, (2464), 2464 states have call successors, (2464) [2025-03-08 11:02:30,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13769 states to 13769 states and 21816 transitions. [2025-03-08 11:02:30,022 INFO L78 Accepts]: Start accepts. Automaton has 13769 states and 21816 transitions. Word has length 608 [2025-03-08 11:02:30,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:30,023 INFO L471 AbstractCegarLoop]: Abstraction has 13769 states and 21816 transitions. [2025-03-08 11:02:30,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:30,023 INFO L276 IsEmpty]: Start isEmpty. Operand 13769 states and 21816 transitions. [2025-03-08 11:02:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-08 11:02:30,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:30,031 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:30,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 11:02:30,031 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:30,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:30,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1511678379, now seen corresponding path program 1 times [2025-03-08 11:02:30,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:30,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146219687] [2025-03-08 11:02:30,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:30,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:30,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 11:02:30,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 11:02:30,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:30,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:02:30,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [160602590] [2025-03-08 11:02:30,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:30,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:02:30,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:02:30,235 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:02:30,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 11:02:30,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 11:02:30,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 11:02:30,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:30,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:30,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 11:02:30,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:02:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-03-08 11:02:32,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:02:32,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:32,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146219687] [2025-03-08 11:02:32,432 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 11:02:32,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160602590] [2025-03-08 11:02:32,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160602590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:32,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:32,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:02:32,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031511421] [2025-03-08 11:02:32,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:32,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:02:32,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:32,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:02:32,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:02:32,434 INFO L87 Difference]: Start difference. First operand 13769 states and 21816 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 6 states have internal predecessors, (111), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:37,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:37,109 INFO L93 Difference]: Finished difference Result 84527 states and 133925 transitions. [2025-03-08 11:02:37,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 11:02:37,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 6 states have internal predecessors, (111), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 608 [2025-03-08 11:02:37,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:37,408 INFO L225 Difference]: With dead ends: 84527 [2025-03-08 11:02:37,409 INFO L226 Difference]: Without dead ends: 70761 [2025-03-08 11:02:37,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2025-03-08 11:02:37,445 INFO L435 NwaCegarLoop]: 1198 mSDtfsCounter, 1590 mSDsluCounter, 2078 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 809 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 3276 SdHoareTripleChecker+Invalid, 3064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 809 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:37,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 3276 Invalid, 3064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [809 Valid, 2255 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 11:02:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70761 states. [2025-03-08 11:02:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70761 to 48163. [2025-03-08 11:02:40,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48163 states, 38726 states have (on average 1.5182048236327015) internal successors, (58794), 38922 states have internal predecessors, (58794), 8624 states have call successors, (8624), 812 states have call predecessors, (8624), 812 states have return successors, (8624), 8428 states have call predecessors, (8624), 8624 states have call successors, (8624) [2025-03-08 11:02:40,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48163 states to 48163 states and 76042 transitions. [2025-03-08 11:02:41,030 INFO L78 Accepts]: Start accepts. Automaton has 48163 states and 76042 transitions. Word has length 608 [2025-03-08 11:02:41,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:41,031 INFO L471 AbstractCegarLoop]: Abstraction has 48163 states and 76042 transitions. [2025-03-08 11:02:41,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 6 states have internal predecessors, (111), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:41,031 INFO L276 IsEmpty]: Start isEmpty. Operand 48163 states and 76042 transitions. [2025-03-08 11:02:41,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-08 11:02:41,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:41,042 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:41,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 11:02:41,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 11:02:41,243 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:41,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:41,244 INFO L85 PathProgramCache]: Analyzing trace with hash -295776084, now seen corresponding path program 1 times [2025-03-08 11:02:41,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:41,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703246622] [2025-03-08 11:02:41,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:41,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:41,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 11:02:41,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 11:02:41,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:41,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:02:41,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1593730033] [2025-03-08 11:02:41,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:41,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:02:41,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:02:41,386 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:02:41,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 11:02:41,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 11:02:41,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 11:02:41,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:41,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:41,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 11:02:41,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:02:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-03-08 11:02:42,231 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:02:42,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:42,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703246622] [2025-03-08 11:02:42,231 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 11:02:42,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593730033] [2025-03-08 11:02:42,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593730033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:42,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:42,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:02:42,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201622662] [2025-03-08 11:02:42,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:42,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:02:42,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:42,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:02:42,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:02:42,233 INFO L87 Difference]: Start difference. First operand 48163 states and 76042 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:48,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:48,312 INFO L93 Difference]: Finished difference Result 178385 states and 281539 transitions. [2025-03-08 11:02:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:02:48,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 608 [2025-03-08 11:02:48,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:48,659 INFO L225 Difference]: With dead ends: 178385 [2025-03-08 11:02:48,660 INFO L226 Difference]: Without dead ends: 130225 [2025-03-08 11:02:48,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 603 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:02:48,751 INFO L435 NwaCegarLoop]: 1292 mSDtfsCounter, 781 mSDsluCounter, 3386 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 4678 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:48,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 4678 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:02:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130225 states. [2025-03-08 11:02:53,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130225 to 64871. [2025-03-08 11:02:53,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64871 states, 52738 states have (on average 1.5175016117410596) internal successors, (80030), 52990 states have internal predecessors, (80030), 11088 states have call successors, (11088), 1044 states have call predecessors, (11088), 1044 states have return successors, (11088), 10836 states have call predecessors, (11088), 11088 states have call successors, (11088) [2025-03-08 11:02:53,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64871 states to 64871 states and 102206 transitions. [2025-03-08 11:02:53,477 INFO L78 Accepts]: Start accepts. Automaton has 64871 states and 102206 transitions. Word has length 608 [2025-03-08 11:02:53,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:53,477 INFO L471 AbstractCegarLoop]: Abstraction has 64871 states and 102206 transitions. [2025-03-08 11:02:53,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:02:53,478 INFO L276 IsEmpty]: Start isEmpty. Operand 64871 states and 102206 transitions. [2025-03-08 11:02:53,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2025-03-08 11:02:53,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:53,491 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:53,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 11:02:53,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 11:02:53,692 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:53,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:53,693 INFO L85 PathProgramCache]: Analyzing trace with hash 248749314, now seen corresponding path program 1 times [2025-03-08 11:02:53,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:53,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707764394] [2025-03-08 11:02:53,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:53,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:53,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-03-08 11:02:54,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-03-08 11:02:54,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:54,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:02:54,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1379583989] [2025-03-08 11:02:54,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:54,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:02:54,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:02:54,014 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:02:54,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 11:02:54,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-03-08 11:02:54,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-03-08 11:02:54,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:54,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:54,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 11:02:54,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:02:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-03-08 11:02:56,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:02:56,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:56,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707764394] [2025-03-08 11:02:56,451 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 11:02:56,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379583989] [2025-03-08 11:02:56,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379583989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:56,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:56,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:02:56,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398177848] [2025-03-08 11:02:56,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:56,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:02:56,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:56,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:02:56,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:02:56,453 INFO L87 Difference]: Start difference. First operand 64871 states and 102206 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:03:01,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:03:01,262 INFO L93 Difference]: Finished difference Result 95547 states and 150380 transitions. [2025-03-08 11:03:01,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:03:01,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 609 [2025-03-08 11:03:01,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:03:01,511 INFO L225 Difference]: With dead ends: 95547 [2025-03-08 11:03:01,511 INFO L226 Difference]: Without dead ends: 81781 [2025-03-08 11:03:01,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:03:01,574 INFO L435 NwaCegarLoop]: 1210 mSDtfsCounter, 1173 mSDsluCounter, 3437 mSDsCounter, 0 mSdLazyCounter, 2530 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 4647 SdHoareTripleChecker+Invalid, 2935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 2530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:03:01,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 4647 Invalid, 2935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 2530 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 11:03:01,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81781 states. [2025-03-08 11:03:06,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81781 to 65383. [2025-03-08 11:03:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65383 states, 53250 states have (on average 1.5221408450704226) internal successors, (81054), 53502 states have internal predecessors, (81054), 11088 states have call successors, (11088), 1044 states have call predecessors, (11088), 1044 states have return successors, (11088), 10836 states have call predecessors, (11088), 11088 states have call successors, (11088) [2025-03-08 11:03:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65383 states to 65383 states and 103230 transitions. [2025-03-08 11:03:06,613 INFO L78 Accepts]: Start accepts. Automaton has 65383 states and 103230 transitions. Word has length 609 [2025-03-08 11:03:06,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:03:06,614 INFO L471 AbstractCegarLoop]: Abstraction has 65383 states and 103230 transitions. [2025-03-08 11:03:06,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-03-08 11:03:06,614 INFO L276 IsEmpty]: Start isEmpty. Operand 65383 states and 103230 transitions. [2025-03-08 11:03:06,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2025-03-08 11:03:06,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:03:06,628 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:03:06,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 11:03:06,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 11:03:06,832 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:03:06,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:03:06,833 INFO L85 PathProgramCache]: Analyzing trace with hash -313381308, now seen corresponding path program 1 times [2025-03-08 11:03:06,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:03:06,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734944948] [2025-03-08 11:03:06,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:06,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:03:06,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-03-08 11:03:06,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-03-08 11:03:06,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:06,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:03:06,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1842964223] [2025-03-08 11:03:06,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:06,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:03:06,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:03:06,997 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:03:06,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 11:03:07,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes.