./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-1.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 ff58e464b123872f2b28a99edb663fa498c1ac359472073283f17fa308a136da --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:02:00,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:02:00,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:02:00,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:02:00,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:02:00,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:02:00,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:02:00,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:02:00,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:02:00,383 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:02:00,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:02:00,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:02:00,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:02:00,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:02:00,383 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:02:00,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:02:00,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:02:00,383 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:02:00,384 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:02:00,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:02:00,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:02:00,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:02:00,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:02:00,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:02:00,384 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:02:00,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:02:00,384 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:02:00,384 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:02:00,384 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:02:00,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:02:00,384 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:02:00,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:02:00,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:02:00,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:02:00,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:02:00,384 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:02:00,385 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:02:00,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:02:00,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:02:00,385 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:02:00,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:02:00,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:02:00,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:02:00,385 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 -> ff58e464b123872f2b28a99edb663fa498c1ac359472073283f17fa308a136da [2025-03-17 00:02:00,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:02:00,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:02:00,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:02:00,655 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:02:00,656 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:02:00,657 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-1.i [2025-03-17 00:02:01,916 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fbcef4a8/d371452eb1674d7eab673735cb7b45c9/FLAG87456e5ef [2025-03-17 00:02:02,253 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:02:02,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-1.i [2025-03-17 00:02:02,264 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fbcef4a8/d371452eb1674d7eab673735cb7b45c9/FLAG87456e5ef [2025-03-17 00:02:02,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fbcef4a8/d371452eb1674d7eab673735cb7b45c9 [2025-03-17 00:02:02,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:02:02,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:02:02,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:02:02,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:02:02,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:02:02,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:02:02" (1/1) ... [2025-03-17 00:02:02,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@135809f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:02, skipping insertion in model container [2025-03-17 00:02:02,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:02:02" (1/1) ... [2025-03-17 00:02:02,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:02:02,658 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-1.i[915,928] [2025-03-17 00:02:02,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:02:02,808 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:02:02,819 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-1.i[915,928] [2025-03-17 00:02:02,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:02:02,918 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:02:02,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:02 WrapperNode [2025-03-17 00:02:02,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:02:02,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:02:02,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:02:02,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:02:02,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:02" (1/1) ... [2025-03-17 00:02:02,947 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:02" (1/1) ... [2025-03-17 00:02:03,012 INFO L138 Inliner]: procedures = 26, calls = 105, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 638 [2025-03-17 00:02:03,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:02:03,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:02:03,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:02:03,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:02:03,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:02" (1/1) ... [2025-03-17 00:02:03,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:02" (1/1) ... [2025-03-17 00:02:03,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:02" (1/1) ... [2025-03-17 00:02:03,062 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:02:03,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:02" (1/1) ... [2025-03-17 00:02:03,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:02" (1/1) ... [2025-03-17 00:02:03,078 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:02" (1/1) ... [2025-03-17 00:02:03,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:02" (1/1) ... [2025-03-17 00:02:03,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:02" (1/1) ... [2025-03-17 00:02:03,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:02" (1/1) ... [2025-03-17 00:02:03,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:02:03,099 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:02:03,099 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:02:03,099 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:02:03,100 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:02" (1/1) ... [2025-03-17 00:02:03,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:02:03,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:02:03,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:02:03,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:02:03,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:02:03,154 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:02:03,154 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:02:03,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:02:03,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:02:03,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:02:03,256 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:02:03,258 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:02:03,961 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-17 00:02:03,961 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:02:03,992 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:02:03,993 INFO L336 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-17 00:02:03,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:02:03 BoogieIcfgContainer [2025-03-17 00:02:03,993 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:02:03,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:02:03,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:02:04,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:02:04,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:02:02" (1/3) ... [2025-03-17 00:02:04,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2037bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:02:04, skipping insertion in model container [2025-03-17 00:02:04,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:02" (2/3) ... [2025-03-17 00:02:04,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2037bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:02:04, skipping insertion in model container [2025-03-17 00:02:04,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:02:03" (3/3) ... [2025-03-17 00:02:04,003 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-1.i [2025-03-17 00:02:04,015 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:02:04,020 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-1.i that has 2 procedures, 261 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:02:04,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:02:04,097 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;@60719f37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:02:04,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:02:04,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 261 states, 166 states have (on average 1.5301204819277108) internal successors, (254), 167 states have internal predecessors, (254), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-17 00:02:04,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-17 00:02:04,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:04,129 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:04,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:04,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:04,134 INFO L85 PathProgramCache]: Analyzing trace with hash -28864356, now seen corresponding path program 1 times [2025-03-17 00:02:04,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:04,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142504388] [2025-03-17 00:02:04,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:04,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:04,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-17 00:02:04,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-17 00:02:04,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:04,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:04,690 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 16562 trivial. 0 not checked. [2025-03-17 00:02:04,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:04,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142504388] [2025-03-17 00:02:04,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142504388] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:02:04,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102372346] [2025-03-17 00:02:04,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:04,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:02:04,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:02:04,697 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:02:04,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:02:04,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-17 00:02:04,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-17 00:02:04,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:04,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:04,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:02:05,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:02:05,081 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 16562 trivial. 0 not checked. [2025-03-17 00:02:05,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:02:05,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102372346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:05,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:02:05,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:02:05,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861636069] [2025-03-17 00:02:05,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:05,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:02:05,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:05,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:02:05,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:02:05,110 INFO L87 Difference]: Start difference. First operand has 261 states, 166 states have (on average 1.5301204819277108) internal successors, (254), 167 states have internal predecessors, (254), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) Second operand has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 2 states have call successors, (92) [2025-03-17 00:02:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:05,192 INFO L93 Difference]: Finished difference Result 519 states and 966 transitions. [2025-03-17 00:02:05,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:02:05,195 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 2 states have call successors, (92) Word has length 569 [2025-03-17 00:02:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:05,202 INFO L225 Difference]: With dead ends: 519 [2025-03-17 00:02:05,202 INFO L226 Difference]: Without dead ends: 259 [2025-03-17 00:02:05,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 570 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-17 00:02:05,213 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:05,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 416 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:02:05,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-17 00:02:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-03-17 00:02:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 165 states have (on average 1.490909090909091) internal successors, (246), 165 states have internal predecessors, (246), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-17 00:02:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 430 transitions. [2025-03-17 00:02:05,295 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 430 transitions. Word has length 569 [2025-03-17 00:02:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:05,296 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 430 transitions. [2025-03-17 00:02:05,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 2 states have call successors, (92) [2025-03-17 00:02:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 430 transitions. [2025-03-17 00:02:05,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-17 00:02:05,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:05,307 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:05,317 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-17 00:02:05,512 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-17 00:02:05,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:05,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:05,514 INFO L85 PathProgramCache]: Analyzing trace with hash 113926041, now seen corresponding path program 1 times [2025-03-17 00:02:05,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:05,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138979462] [2025-03-17 00:02:05,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:05,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:05,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-17 00:02:05,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-17 00:02:05,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:05,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-17 00:02:06,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:06,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138979462] [2025-03-17 00:02:06,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138979462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:06,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:06,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:02:06,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720474686] [2025-03-17 00:02:06,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:06,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:02:06,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:06,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:02:06,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:02:06,128 INFO L87 Difference]: Start difference. First operand 259 states and 430 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-17 00:02:06,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:06,257 INFO L93 Difference]: Finished difference Result 668 states and 1101 transitions. [2025-03-17 00:02:06,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:02:06,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 569 [2025-03-17 00:02:06,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:06,266 INFO L225 Difference]: With dead ends: 668 [2025-03-17 00:02:06,266 INFO L226 Difference]: Without dead ends: 410 [2025-03-17 00:02:06,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:02:06,269 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 233 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:06,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 819 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:02:06,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-17 00:02:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 407. [2025-03-17 00:02:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 247 states have (on average 1.437246963562753) internal successors, (355), 248 states have internal predecessors, (355), 157 states have call successors, (157), 2 states have call predecessors, (157), 2 states have return successors, (157), 156 states have call predecessors, (157), 157 states have call successors, (157) [2025-03-17 00:02:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 669 transitions. [2025-03-17 00:02:06,342 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 669 transitions. Word has length 569 [2025-03-17 00:02:06,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:06,343 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 669 transitions. [2025-03-17 00:02:06,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-17 00:02:06,343 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 669 transitions. [2025-03-17 00:02:06,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-17 00:02:06,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:06,353 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:06,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:02:06,354 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:06,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:06,354 INFO L85 PathProgramCache]: Analyzing trace with hash 325276954, now seen corresponding path program 1 times [2025-03-17 00:02:06,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:06,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122599564] [2025-03-17 00:02:06,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:06,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:06,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-17 00:02:06,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-17 00:02:06,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:06,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-17 00:02:07,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:07,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122599564] [2025-03-17 00:02:07,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122599564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:07,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:07,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:02:07,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853637563] [2025-03-17 00:02:07,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:07,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:02:07,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:07,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:02:07,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:02:07,137 INFO L87 Difference]: Start difference. First operand 407 states and 669 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-17 00:02:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:07,267 INFO L93 Difference]: Finished difference Result 1219 states and 2005 transitions. [2025-03-17 00:02:07,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:02:07,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 569 [2025-03-17 00:02:07,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:07,278 INFO L225 Difference]: With dead ends: 1219 [2025-03-17 00:02:07,280 INFO L226 Difference]: Without dead ends: 813 [2025-03-17 00:02:07,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:02:07,284 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 424 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:07,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 820 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:02:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-03-17 00:02:07,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 484. [2025-03-17 00:02:07,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 324 states have (on average 1.5030864197530864) internal successors, (487), 325 states have internal predecessors, (487), 157 states have call successors, (157), 2 states have call predecessors, (157), 2 states have return successors, (157), 156 states have call predecessors, (157), 157 states have call successors, (157) [2025-03-17 00:02:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 801 transitions. [2025-03-17 00:02:07,402 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 801 transitions. Word has length 569 [2025-03-17 00:02:07,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:07,404 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 801 transitions. [2025-03-17 00:02:07,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-17 00:02:07,405 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 801 transitions. [2025-03-17 00:02:07,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-17 00:02:07,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:07,415 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:07,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:02:07,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:07,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:07,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1964963909, now seen corresponding path program 1 times [2025-03-17 00:02:07,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:07,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675372834] [2025-03-17 00:02:07,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:07,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:07,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-17 00:02:07,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-17 00:02:07,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:07,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:08,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-17 00:02:08,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:08,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675372834] [2025-03-17 00:02:08,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675372834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:08,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:08,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:02:08,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456852636] [2025-03-17 00:02:08,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:08,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:02:08,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:08,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:02:08,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:02:08,236 INFO L87 Difference]: Start difference. First operand 484 states and 801 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-17 00:02:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:08,354 INFO L93 Difference]: Finished difference Result 1450 states and 2401 transitions. [2025-03-17 00:02:08,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:02:08,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 569 [2025-03-17 00:02:08,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:08,362 INFO L225 Difference]: With dead ends: 1450 [2025-03-17 00:02:08,362 INFO L226 Difference]: Without dead ends: 967 [2025-03-17 00:02:08,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:02:08,365 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 230 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 829 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:08,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 829 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:02:08,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2025-03-17 00:02:08,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 965. [2025-03-17 00:02:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 646 states have (on average 1.501547987616099) internal successors, (970), 648 states have internal predecessors, (970), 314 states have call successors, (314), 4 states have call predecessors, (314), 4 states have return successors, (314), 312 states have call predecessors, (314), 314 states have call successors, (314) [2025-03-17 00:02:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1598 transitions. [2025-03-17 00:02:08,529 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1598 transitions. Word has length 569 [2025-03-17 00:02:08,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:08,530 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1598 transitions. [2025-03-17 00:02:08,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-17 00:02:08,530 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1598 transitions. [2025-03-17 00:02:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-17 00:02:08,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:08,538 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:08,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:02:08,538 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:08,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:08,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1639487734, now seen corresponding path program 1 times [2025-03-17 00:02:08,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:08,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6078655] [2025-03-17 00:02:08,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:08,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:08,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-17 00:02:08,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-17 00:02:08,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:08,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-17 00:02:09,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:09,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6078655] [2025-03-17 00:02:09,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6078655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:09,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:09,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:02:09,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581632143] [2025-03-17 00:02:09,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:09,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:02:09,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:09,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:02:09,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:02:09,508 INFO L87 Difference]: Start difference. First operand 965 states and 1598 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-17 00:02:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:09,980 INFO L93 Difference]: Finished difference Result 2579 states and 4254 transitions. [2025-03-17 00:02:09,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:02:09,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 570 [2025-03-17 00:02:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:09,996 INFO L225 Difference]: With dead ends: 2579 [2025-03-17 00:02:09,996 INFO L226 Difference]: Without dead ends: 1615 [2025-03-17 00:02:10,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:02:10,003 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 336 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:10,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 949 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:02:10,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2025-03-17 00:02:10,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1609. [2025-03-17 00:02:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1050 states have (on average 1.4704761904761905) internal successors, (1544), 1056 states have internal predecessors, (1544), 550 states have call successors, (550), 8 states have call predecessors, (550), 8 states have return successors, (550), 544 states have call predecessors, (550), 550 states have call successors, (550) [2025-03-17 00:02:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2644 transitions. [2025-03-17 00:02:10,188 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2644 transitions. Word has length 570 [2025-03-17 00:02:10,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:10,189 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2644 transitions. [2025-03-17 00:02:10,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-17 00:02:10,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2644 transitions. [2025-03-17 00:02:10,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-17 00:02:10,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:10,200 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:10,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:02:10,200 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:10,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:10,201 INFO L85 PathProgramCache]: Analyzing trace with hash 437721609, now seen corresponding path program 1 times [2025-03-17 00:02:10,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:10,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238297599] [2025-03-17 00:02:10,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:10,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:10,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-17 00:02:10,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-17 00:02:10,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:10,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-17 00:02:10,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:10,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238297599] [2025-03-17 00:02:10,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238297599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:10,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:10,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:02:10,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187478749] [2025-03-17 00:02:10,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:10,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:02:10,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:10,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:02:10,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:02:10,832 INFO L87 Difference]: Start difference. First operand 1609 states and 2644 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-17 00:02:11,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:11,588 INFO L93 Difference]: Finished difference Result 4829 states and 7938 transitions. [2025-03-17 00:02:11,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:02:11,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 570 [2025-03-17 00:02:11,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:11,614 INFO L225 Difference]: With dead ends: 4829 [2025-03-17 00:02:11,614 INFO L226 Difference]: Without dead ends: 3221 [2025-03-17 00:02:11,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:02:11,622 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 413 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:11,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1370 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:02:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3221 states. [2025-03-17 00:02:11,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3221 to 3219. [2025-03-17 00:02:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2102 states have (on average 1.4700285442435777) internal successors, (3090), 2114 states have internal predecessors, (3090), 1100 states have call successors, (1100), 16 states have call predecessors, (1100), 16 states have return successors, (1100), 1088 states have call predecessors, (1100), 1100 states have call successors, (1100) [2025-03-17 00:02:12,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 5290 transitions. [2025-03-17 00:02:12,031 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 5290 transitions. Word has length 570 [2025-03-17 00:02:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:12,032 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 5290 transitions. [2025-03-17 00:02:12,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-17 00:02:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 5290 transitions. [2025-03-17 00:02:12,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-17 00:02:12,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:12,045 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:12,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:02:12,045 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:12,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:12,046 INFO L85 PathProgramCache]: Analyzing trace with hash 458058984, now seen corresponding path program 1 times [2025-03-17 00:02:12,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:12,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542350477] [2025-03-17 00:02:12,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:12,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:12,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-17 00:02:12,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-17 00:02:12,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:12,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-17 00:02:12,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:12,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542350477] [2025-03-17 00:02:12,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542350477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:12,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:12,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 00:02:12,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055123955] [2025-03-17 00:02:12,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:12,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:02:12,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:12,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:02:12,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:02:12,977 INFO L87 Difference]: Start difference. First operand 3219 states and 5290 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 2 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 2 states have call predecessors, (92), 2 states have call successors, (92) [2025-03-17 00:02:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:14,658 INFO L93 Difference]: Finished difference Result 6267 states and 10019 transitions. [2025-03-17 00:02:14,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:02:14,660 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 2 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 2 states have call predecessors, (92), 2 states have call successors, (92) Word has length 570 [2025-03-17 00:02:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:14,696 INFO L225 Difference]: With dead ends: 6267 [2025-03-17 00:02:14,696 INFO L226 Difference]: Without dead ends: 4657 [2025-03-17 00:02:14,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:02:14,706 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 486 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:14,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1498 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 00:02:14,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4657 states. [2025-03-17 00:02:15,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4657 to 3459. [2025-03-17 00:02:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 2326 states have (on average 1.4591573516766982) internal successors, (3394), 2338 states have internal predecessors, (3394), 1100 states have call successors, (1100), 32 states have call predecessors, (1100), 32 states have return successors, (1100), 1088 states have call predecessors, (1100), 1100 states have call successors, (1100) [2025-03-17 00:02:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 5594 transitions. [2025-03-17 00:02:15,242 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 5594 transitions. Word has length 570 [2025-03-17 00:02:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:15,245 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 5594 transitions. [2025-03-17 00:02:15,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 2 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 2 states have call predecessors, (92), 2 states have call successors, (92) [2025-03-17 00:02:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 5594 transitions. [2025-03-17 00:02:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-17 00:02:15,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:15,252 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:15,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:02:15,253 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:15,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:15,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1316039784, now seen corresponding path program 1 times [2025-03-17 00:02:15,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:15,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618173813] [2025-03-17 00:02:15,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:15,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:15,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-17 00:02:15,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-17 00:02:15,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:15,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-17 00:02:15,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:15,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618173813] [2025-03-17 00:02:15,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618173813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:15,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:15,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:02:15,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845715812] [2025-03-17 00:02:15,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:15,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:02:15,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:15,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:02:15,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:02:15,782 INFO L87 Difference]: Start difference. First operand 3459 states and 5594 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-17 00:02:16,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:16,727 INFO L93 Difference]: Finished difference Result 10103 states and 16364 transitions. [2025-03-17 00:02:16,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:02:16,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 570 [2025-03-17 00:02:16,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:16,775 INFO L225 Difference]: With dead ends: 10103 [2025-03-17 00:02:16,776 INFO L226 Difference]: Without dead ends: 6645 [2025-03-17 00:02:16,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:02:16,793 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 420 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:16,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1798 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:02:16,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6645 states. [2025-03-17 00:02:17,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6645 to 3459. [2025-03-17 00:02:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 2326 states have (on average 1.4453998280309543) internal successors, (3362), 2338 states have internal predecessors, (3362), 1100 states have call successors, (1100), 32 states have call predecessors, (1100), 32 states have return successors, (1100), 1088 states have call predecessors, (1100), 1100 states have call successors, (1100) [2025-03-17 00:02:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 5562 transitions. [2025-03-17 00:02:17,359 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 5562 transitions. Word has length 570 [2025-03-17 00:02:17,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:17,360 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 5562 transitions. [2025-03-17 00:02:17,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-17 00:02:17,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 5562 transitions. [2025-03-17 00:02:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-17 00:02:17,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:17,365 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:17,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:02:17,366 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:17,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:17,366 INFO L85 PathProgramCache]: Analyzing trace with hash 261545479, now seen corresponding path program 1 times [2025-03-17 00:02:17,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:17,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041816060] [2025-03-17 00:02:17,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:17,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:17,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-17 00:02:17,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-17 00:02:17,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:17,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-17 00:02:17,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:17,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041816060] [2025-03-17 00:02:17,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041816060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:17,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:17,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:02:17,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345191430] [2025-03-17 00:02:17,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:17,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:02:17,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:17,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:02:17,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:02:17,954 INFO L87 Difference]: Start difference. First operand 3459 states and 5562 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-17 00:02:18,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:18,745 INFO L93 Difference]: Finished difference Result 6923 states and 11132 transitions. [2025-03-17 00:02:18,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:02:18,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 570 [2025-03-17 00:02:18,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:18,782 INFO L225 Difference]: With dead ends: 6923 [2025-03-17 00:02:18,782 INFO L226 Difference]: Without dead ends: 3465 [2025-03-17 00:02:18,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:02:18,799 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 267 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:18,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1175 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:02:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2025-03-17 00:02:19,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 1733. [2025-03-17 00:02:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1166 states have (on average 1.444253859348199) internal successors, (1684), 1172 states have internal predecessors, (1684), 550 states have call successors, (550), 16 states have call predecessors, (550), 16 states have return successors, (550), 544 states have call predecessors, (550), 550 states have call successors, (550) [2025-03-17 00:02:19,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2784 transitions. [2025-03-17 00:02:19,144 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2784 transitions. Word has length 570 [2025-03-17 00:02:19,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:19,145 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2784 transitions. [2025-03-17 00:02:19,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-17 00:02:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2784 transitions. [2025-03-17 00:02:19,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-17 00:02:19,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:19,152 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:19,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:02:19,152 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:19,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:19,153 INFO L85 PathProgramCache]: Analyzing trace with hash -929285267, now seen corresponding path program 1 times [2025-03-17 00:02:19,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:19,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995102519] [2025-03-17 00:02:19,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:19,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:19,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-17 00:02:19,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-17 00:02:19,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:19,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:19,856 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-17 00:02:19,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:19,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995102519] [2025-03-17 00:02:19,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995102519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:19,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:19,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:02:19,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525941825] [2025-03-17 00:02:19,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:19,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:02:19,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:19,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:02:19,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:02:19,859 INFO L87 Difference]: Start difference. First operand 1733 states and 2784 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 2 states have call predecessors, (92), 2 states have call successors, (92) [2025-03-17 00:02:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:20,498 INFO L93 Difference]: Finished difference Result 2922 states and 4651 transitions. [2025-03-17 00:02:20,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 00:02:20,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 2 states have call predecessors, (92), 2 states have call successors, (92) Word has length 571 [2025-03-17 00:02:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:20,521 INFO L225 Difference]: With dead ends: 2922 [2025-03-17 00:02:20,522 INFO L226 Difference]: Without dead ends: 2055 [2025-03-17 00:02:20,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:02:20,529 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 375 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:20,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1015 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:02:20,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2025-03-17 00:02:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1733. [2025-03-17 00:02:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1166 states have (on average 1.444253859348199) internal successors, (1684), 1172 states have internal predecessors, (1684), 550 states have call successors, (550), 16 states have call predecessors, (550), 16 states have return successors, (550), 544 states have call predecessors, (550), 550 states have call successors, (550) [2025-03-17 00:02:20,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2784 transitions. [2025-03-17 00:02:20,742 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2784 transitions. Word has length 571 [2025-03-17 00:02:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:20,744 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2784 transitions. [2025-03-17 00:02:20,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 2 states have call predecessors, (92), 2 states have call successors, (92) [2025-03-17 00:02:20,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2784 transitions. [2025-03-17 00:02:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-17 00:02:20,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:20,750 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:20,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:02:20,750 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:20,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:20,751 INFO L85 PathProgramCache]: Analyzing trace with hash -71304467, now seen corresponding path program 1 times [2025-03-17 00:02:20,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:20,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164606089] [2025-03-17 00:02:20,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:20,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:20,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-17 00:02:20,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-17 00:02:20,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:20,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-17 00:02:21,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:21,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164606089] [2025-03-17 00:02:21,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164606089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:21,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:21,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:02:21,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542003963] [2025-03-17 00:02:21,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:21,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:02:21,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:21,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:02:21,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:02:21,182 INFO L87 Difference]: Start difference. First operand 1733 states and 2784 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-17 00:02:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:21,372 INFO L93 Difference]: Finished difference Result 3481 states and 5599 transitions. [2025-03-17 00:02:21,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:02:21,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 571 [2025-03-17 00:02:21,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:21,393 INFO L225 Difference]: With dead ends: 3481 [2025-03-17 00:02:21,394 INFO L226 Difference]: Without dead ends: 1749 [2025-03-17 00:02:21,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:02:21,403 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 0 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:21,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 825 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:02:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2025-03-17 00:02:21,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1749. [2025-03-17 00:02:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1749 states, 1182 states have (on average 1.4382402707275803) internal successors, (1700), 1188 states have internal predecessors, (1700), 550 states have call successors, (550), 16 states have call predecessors, (550), 16 states have return successors, (550), 544 states have call predecessors, (550), 550 states have call successors, (550) [2025-03-17 00:02:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2800 transitions. [2025-03-17 00:02:21,644 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2800 transitions. Word has length 571 [2025-03-17 00:02:21,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:21,646 INFO L471 AbstractCegarLoop]: Abstraction has 1749 states and 2800 transitions. [2025-03-17 00:02:21,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-17 00:02:21,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2800 transitions. [2025-03-17 00:02:21,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-17 00:02:21,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:21,652 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:21,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:02:21,652 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:21,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:21,653 INFO L85 PathProgramCache]: Analyzing trace with hash -326041012, now seen corresponding path program 1 times [2025-03-17 00:02:21,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:21,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95003603] [2025-03-17 00:02:21,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:21,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:21,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-17 00:02:21,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-17 00:02:21,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:21,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:22,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-17 00:02:22,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:22,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95003603] [2025-03-17 00:02:22,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95003603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:22,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:22,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:02:22,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833016029] [2025-03-17 00:02:22,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:22,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:02:22,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:22,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:02:22,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:02:22,234 INFO L87 Difference]: Start difference. First operand 1749 states and 2800 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-17 00:02:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:22,768 INFO L93 Difference]: Finished difference Result 4661 states and 7438 transitions. [2025-03-17 00:02:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:02:22,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 571 [2025-03-17 00:02:22,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:22,793 INFO L225 Difference]: With dead ends: 4661 [2025-03-17 00:02:22,794 INFO L226 Difference]: Without dead ends: 2913 [2025-03-17 00:02:22,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:02:22,804 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 410 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:22,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1245 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:02:22,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2025-03-17 00:02:23,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2903. [2025-03-17 00:02:23,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2903 states, 2136 states have (on average 1.4784644194756553) internal successors, (3158), 2150 states have internal predecessors, (3158), 734 states have call successors, (734), 32 states have call predecessors, (734), 32 states have return successors, (734), 720 states have call predecessors, (734), 734 states have call successors, (734) [2025-03-17 00:02:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 4626 transitions. [2025-03-17 00:02:23,232 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 4626 transitions. Word has length 571 [2025-03-17 00:02:23,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:23,233 INFO L471 AbstractCegarLoop]: Abstraction has 2903 states and 4626 transitions. [2025-03-17 00:02:23,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-17 00:02:23,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 4626 transitions. [2025-03-17 00:02:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-17 00:02:23,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:23,239 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:23,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 00:02:23,240 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:23,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:23,241 INFO L85 PathProgramCache]: Analyzing trace with hash -201967765, now seen corresponding path program 1 times [2025-03-17 00:02:23,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:23,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094628323] [2025-03-17 00:02:23,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:23,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:23,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-17 00:02:23,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-17 00:02:23,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:23,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 99 proven. 174 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-17 00:02:24,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:24,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094628323] [2025-03-17 00:02:24,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094628323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:02:24,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960806174] [2025-03-17 00:02:24,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:24,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:02:24,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:02:24,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:02:24,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 00:02:24,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-17 00:02:24,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-17 00:02:24,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:24,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:24,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 00:02:25,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:02:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 7533 proven. 90 refuted. 0 times theorem prover too weak. 9121 trivial. 0 not checked. [2025-03-17 00:02:25,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:02:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 183 proven. 90 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-17 00:02:26,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960806174] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:02:26,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:02:26,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2025-03-17 00:02:26,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286288235] [2025-03-17 00:02:26,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:02:26,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 00:02:26,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:26,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 00:02:26,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-03-17 00:02:26,119 INFO L87 Difference]: Start difference. First operand 2903 states and 4626 transitions. Second operand has 18 states, 18 states have (on average 12.444444444444445) internal successors, (224), 18 states have internal predecessors, (224), 4 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (182), 4 states have call predecessors, (182), 4 states have call successors, (182) [2025-03-17 00:02:32,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:32,461 INFO L93 Difference]: Finished difference Result 17199 states and 26578 transitions. [2025-03-17 00:02:32,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-17 00:02:32,463 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 12.444444444444445) internal successors, (224), 18 states have internal predecessors, (224), 4 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (182), 4 states have call predecessors, (182), 4 states have call successors, (182) Word has length 571 [2025-03-17 00:02:32,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:32,515 INFO L225 Difference]: With dead ends: 17199 [2025-03-17 00:02:32,515 INFO L226 Difference]: Without dead ends: 14293 [2025-03-17 00:02:32,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1217 GetRequests, 1149 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1198, Invalid=3632, Unknown=0, NotChecked=0, Total=4830 [2025-03-17 00:02:32,531 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 4616 mSDsluCounter, 2446 mSDsCounter, 0 mSdLazyCounter, 3236 mSolverCounterSat, 1878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4618 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 5114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1878 IncrementalHoareTripleChecker+Valid, 3236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:32,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4618 Valid, 2818 Invalid, 5114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1878 Valid, 3236 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-17 00:02:32,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14293 states. [2025-03-17 00:02:33,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14293 to 8301. [2025-03-17 00:02:33,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8301 states, 6318 states have (on average 1.4761000316555872) internal successors, (9326), 6366 states have internal predecessors, (9326), 1846 states have call successors, (1846), 136 states have call predecessors, (1846), 136 states have return successors, (1846), 1798 states have call predecessors, (1846), 1846 states have call successors, (1846) [2025-03-17 00:02:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8301 states to 8301 states and 13018 transitions. [2025-03-17 00:02:33,553 INFO L78 Accepts]: Start accepts. Automaton has 8301 states and 13018 transitions. Word has length 571 [2025-03-17 00:02:33,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:33,554 INFO L471 AbstractCegarLoop]: Abstraction has 8301 states and 13018 transitions. [2025-03-17 00:02:33,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.444444444444445) internal successors, (224), 18 states have internal predecessors, (224), 4 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (182), 4 states have call predecessors, (182), 4 states have call successors, (182) [2025-03-17 00:02:33,555 INFO L276 IsEmpty]: Start isEmpty. Operand 8301 states and 13018 transitions. [2025-03-17 00:02:33,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-17 00:02:33,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:33,566 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:33,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 00:02:33,770 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-17 00:02:33,771 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:33,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:33,772 INFO L85 PathProgramCache]: Analyzing trace with hash 360435666, now seen corresponding path program 1 times [2025-03-17 00:02:33,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:33,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817656372] [2025-03-17 00:02:33,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:33,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:33,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-17 00:02:33,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-17 00:02:33,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:33,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 99 proven. 174 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-17 00:02:34,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:34,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817656372] [2025-03-17 00:02:34,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817656372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:02:34,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041195131] [2025-03-17 00:02:34,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:34,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:02:34,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:02:34,578 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:02:34,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 00:02:34,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-17 00:02:34,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-17 00:02:34,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:34,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:34,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 00:02:34,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:02:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 7813 proven. 174 refuted. 0 times theorem prover too weak. 8757 trivial. 0 not checked. [2025-03-17 00:02:35,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:02:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 99 proven. 174 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-17 00:02:36,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041195131] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:02:36,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:02:36,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-17 00:02:36,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207165068] [2025-03-17 00:02:36,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:02:36,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 00:02:36,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:36,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 00:02:36,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:02:36,303 INFO L87 Difference]: Start difference. First operand 8301 states and 13018 transitions. Second operand has 14 states, 14 states have (on average 14.142857142857142) internal successors, (198), 14 states have internal predecessors, (198), 3 states have call successors, (208), 2 states have call predecessors, (208), 4 states have return successors, (209), 3 states have call predecessors, (209), 3 states have call successors, (209) [2025-03-17 00:02:42,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:42,177 INFO L93 Difference]: Finished difference Result 35800 states and 54908 transitions. [2025-03-17 00:02:42,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-17 00:02:42,178 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 14.142857142857142) internal successors, (198), 14 states have internal predecessors, (198), 3 states have call successors, (208), 2 states have call predecessors, (208), 4 states have return successors, (209), 3 states have call predecessors, (209), 3 states have call successors, (209) Word has length 571 [2025-03-17 00:02:42,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:42,369 INFO L225 Difference]: With dead ends: 35800 [2025-03-17 00:02:42,370 INFO L226 Difference]: Without dead ends: 27540 [2025-03-17 00:02:42,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1208 GetRequests, 1146 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=957, Invalid=3075, Unknown=0, NotChecked=0, Total=4032 [2025-03-17 00:02:42,421 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 2429 mSDsluCounter, 3283 mSDsCounter, 0 mSdLazyCounter, 2414 mSolverCounterSat, 949 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2464 SdHoareTripleChecker+Valid, 3759 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 949 IncrementalHoareTripleChecker+Valid, 2414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:42,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2464 Valid, 3759 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [949 Valid, 2414 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 00:02:42,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27540 states. [2025-03-17 00:02:44,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27540 to 9861. [2025-03-17 00:02:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9861 states, 7370 states have (on average 1.4754409769335142) internal successors, (10874), 7416 states have internal predecessors, (10874), 2310 states have call successors, (2310), 180 states have call predecessors, (2310), 180 states have return successors, (2310), 2264 states have call predecessors, (2310), 2310 states have call successors, (2310) [2025-03-17 00:02:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9861 states to 9861 states and 15494 transitions. [2025-03-17 00:02:44,821 INFO L78 Accepts]: Start accepts. Automaton has 9861 states and 15494 transitions. Word has length 571 [2025-03-17 00:02:44,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:44,826 INFO L471 AbstractCegarLoop]: Abstraction has 9861 states and 15494 transitions. [2025-03-17 00:02:44,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.142857142857142) internal successors, (198), 14 states have internal predecessors, (198), 3 states have call successors, (208), 2 states have call predecessors, (208), 4 states have return successors, (209), 3 states have call predecessors, (209), 3 states have call successors, (209) [2025-03-17 00:02:44,826 INFO L276 IsEmpty]: Start isEmpty. Operand 9861 states and 15494 transitions. [2025-03-17 00:02:44,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-17 00:02:44,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:44,853 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:44,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 00:02:45,053 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-17 00:02:45,055 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:45,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:45,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1803052718, now seen corresponding path program 1 times [2025-03-17 00:02:45,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:45,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674648123] [2025-03-17 00:02:45,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:45,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:45,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-17 00:02:45,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-17 00:02:45,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:45,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 99 proven. 174 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-17 00:02:47,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:47,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674648123] [2025-03-17 00:02:47,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674648123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:02:47,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522703854] [2025-03-17 00:02:47,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:47,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:02:47,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:02:47,078 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:02:47,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 00:02:47,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-17 00:02:47,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-17 00:02:47,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:47,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:47,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 1249 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 00:02:47,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:02:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 11123 proven. 267 refuted. 0 times theorem prover too weak. 5354 trivial. 0 not checked. [2025-03-17 00:02:48,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:02:49,425 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 99 proven. 174 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-17 00:02:49,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522703854] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:02:49,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:02:49,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2025-03-17 00:02:49,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881372919] [2025-03-17 00:02:49,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:02:49,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 00:02:49,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:49,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 00:02:49,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-03-17 00:02:49,428 INFO L87 Difference]: Start difference. First operand 9861 states and 15494 transitions. Second operand has 22 states, 22 states have (on average 12.590909090909092) internal successors, (277), 22 states have internal predecessors, (277), 6 states have call successors, (242), 3 states have call predecessors, (242), 6 states have return successors, (243), 6 states have call predecessors, (243), 6 states have call successors, (243) [2025-03-17 00:03:03,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:03:03,318 INFO L93 Difference]: Finished difference Result 71874 states and 109798 transitions. [2025-03-17 00:03:03,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-03-17 00:03:03,318 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 12.590909090909092) internal successors, (277), 22 states have internal predecessors, (277), 6 states have call successors, (242), 3 states have call predecessors, (242), 6 states have return successors, (243), 6 states have call predecessors, (243), 6 states have call successors, (243) Word has length 571 [2025-03-17 00:03:03,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:03:03,524 INFO L225 Difference]: With dead ends: 71874 [2025-03-17 00:03:03,524 INFO L226 Difference]: Without dead ends: 62014 [2025-03-17 00:03:03,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1213 GetRequests, 1139 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1605 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1255, Invalid=4445, Unknown=0, NotChecked=0, Total=5700 [2025-03-17 00:03:03,570 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 3243 mSDsluCounter, 6369 mSDsCounter, 0 mSdLazyCounter, 5733 mSolverCounterSat, 1109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3299 SdHoareTripleChecker+Valid, 7078 SdHoareTripleChecker+Invalid, 6842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1109 IncrementalHoareTripleChecker+Valid, 5733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:03:03,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3299 Valid, 7078 Invalid, 6842 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1109 Valid, 5733 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-17 00:03:03,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62014 states.