./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-500_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 f3d43f98d4e2db5588660687641290344946e641f9add1ceab76c578184e0600 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:05:00,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:05:00,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:05:00,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:05:00,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:05:00,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:05:00,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:05:00,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:05:00,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:05:00,464 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:05:00,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:05:00,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:05:00,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:05:00,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:05:00,466 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:05:00,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:05:00,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:05:00,466 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:05:00,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:05:00,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:05:00,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:05:00,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:05:00,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:05:00,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:05:00,467 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:05:00,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:05:00,467 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:05:00,467 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:05:00,467 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:05:00,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:05:00,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:05:00,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:05:00,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:05:00,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:05:00,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:05:00,469 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:05:00,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:05:00,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:05:00,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:05:00,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:05:00,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:05:00,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:05:00,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:05:00,469 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 -> f3d43f98d4e2db5588660687641290344946e641f9add1ceab76c578184e0600 [2025-03-03 20:05:00,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:05:00,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:05:00,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:05:00,683 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:05:00,683 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:05:00,684 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-500_file-1.i [2025-03-03 20:05:01,749 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58de3dfa5/c655add24317424b80b6674291b4bd7a/FLAGc40891b94 [2025-03-03 20:05:02,048 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:05:02,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-1.i [2025-03-03 20:05:02,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58de3dfa5/c655add24317424b80b6674291b4bd7a/FLAGc40891b94 [2025-03-03 20:05:02,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58de3dfa5/c655add24317424b80b6674291b4bd7a [2025-03-03 20:05:02,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:05:02,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:05:02,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:05:02,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:05:02,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:05:02,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:05:02" (1/1) ... [2025-03-03 20:05:02,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c0d2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:02, skipping insertion in model container [2025-03-03 20:05:02,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:05:02" (1/1) ... [2025-03-03 20:05:02,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:05:02,224 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-500_file-1.i[915,928] [2025-03-03 20:05:02,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:05:02,342 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:05:02,349 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-500_file-1.i[915,928] [2025-03-03 20:05:02,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:05:02,428 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:05:02,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:02 WrapperNode [2025-03-03 20:05:02,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:05:02,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:05:02,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:05:02,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:05:02,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:02" (1/1) ... [2025-03-03 20:05:02,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:02" (1/1) ... [2025-03-03 20:05:02,509 INFO L138 Inliner]: procedures = 26, calls = 118, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 849 [2025-03-03 20:05:02,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:05:02,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:05:02,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:05:02,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:05:02,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:02" (1/1) ... [2025-03-03 20:05:02,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:02" (1/1) ... [2025-03-03 20:05:02,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:02" (1/1) ... [2025-03-03 20:05:02,565 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-03 20:05:02,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:02" (1/1) ... [2025-03-03 20:05:02,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:02" (1/1) ... [2025-03-03 20:05:02,593 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:02" (1/1) ... [2025-03-03 20:05:02,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:02" (1/1) ... [2025-03-03 20:05:02,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:02" (1/1) ... [2025-03-03 20:05:02,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:02" (1/1) ... [2025-03-03 20:05:02,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:05:02,624 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:05:02,625 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:05:02,625 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:05:02,626 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:02" (1/1) ... [2025-03-03 20:05:02,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:05:02,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:05:02,651 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-03 20:05:02,654 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-03 20:05:02,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:05:02,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:05:02,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:05:02,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:05:02,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:05:02,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:05:02,781 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:05:02,782 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:05:03,753 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-03 20:05:03,754 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:05:03,786 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:05:03,786 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 20:05:03,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:05:03 BoogieIcfgContainer [2025-03-03 20:05:03,786 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:05:03,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:05:03,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:05:03,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:05:03,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:05:02" (1/3) ... [2025-03-03 20:05:03,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ed890b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:05:03, skipping insertion in model container [2025-03-03 20:05:03,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:02" (2/3) ... [2025-03-03 20:05:03,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ed890b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:05:03, skipping insertion in model container [2025-03-03 20:05:03,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:05:03" (3/3) ... [2025-03-03 20:05:03,792 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-1.i [2025-03-03 20:05:03,802 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:05:03,805 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-1.i that has 2 procedures, 352 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:05:03,864 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:05:03,875 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;@2b68621, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:05:03,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:05:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 352 states, 244 states have (on average 1.610655737704918) internal successors, (393), 245 states have internal predecessors, (393), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 20:05:03,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-03 20:05:03,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:03,922 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:05:03,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:03,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:03,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1131831759, now seen corresponding path program 1 times [2025-03-03 20:05:03,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:03,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972958995] [2025-03-03 20:05:03,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:03,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:04,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-03 20:05:04,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-03 20:05:04,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:04,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:04,480 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked. [2025-03-03 20:05:04,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:04,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972958995] [2025-03-03 20:05:04,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972958995] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:05:04,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233563374] [2025-03-03 20:05:04,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:04,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:05:04,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:05:04,485 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-03 20:05:04,487 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-03 20:05:04,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-03 20:05:04,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-03 20:05:04,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:04,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:04,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 1559 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:05:04,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:05:04,917 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked. [2025-03-03 20:05:04,917 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:05:04,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233563374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:04,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:05:04,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:05:04,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663901475] [2025-03-03 20:05:04,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:04,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:05:04,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:04,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:05:04,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:05:04,944 INFO L87 Difference]: Start difference. First operand has 352 states, 244 states have (on average 1.610655737704918) internal successors, (393), 245 states have internal predecessors, (393), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) Second operand has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) [2025-03-03 20:05:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:05,039 INFO L93 Difference]: Finished difference Result 696 states and 1302 transitions. [2025-03-03 20:05:05,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:05:05,041 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) Word has length 680 [2025-03-03 20:05:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:05,052 INFO L225 Difference]: With dead ends: 696 [2025-03-03 20:05:05,052 INFO L226 Difference]: Without dead ends: 347 [2025-03-03 20:05:05,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 681 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-03 20:05:05,061 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:05,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:05:05,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-03 20:05:05,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2025-03-03 20:05:05,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 240 states have (on average 1.5833333333333333) internal successors, (380), 240 states have internal predecessors, (380), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 20:05:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 590 transitions. [2025-03-03 20:05:05,145 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 590 transitions. Word has length 680 [2025-03-03 20:05:05,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:05,147 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 590 transitions. [2025-03-03 20:05:05,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) [2025-03-03 20:05:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 590 transitions. [2025-03-03 20:05:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-03 20:05:05,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:05,163 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:05:05,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:05:05,367 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-03 20:05:05,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:05,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:05,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1847263246, now seen corresponding path program 1 times [2025-03-03 20:05:05,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:05,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648477076] [2025-03-03 20:05:05,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:05,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:05,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-03 20:05:05,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-03 20:05:05,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:05,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:05:06,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:06,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648477076] [2025-03-03 20:05:06,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648477076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:06,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:06,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:06,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109922586] [2025-03-03 20:05:06,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:06,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:06,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:06,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:06,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:06,043 INFO L87 Difference]: Start difference. First operand 347 states and 590 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:06,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:06,158 INFO L93 Difference]: Finished difference Result 913 states and 1557 transitions. [2025-03-03 20:05:06,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:06,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-03 20:05:06,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:06,168 INFO L225 Difference]: With dead ends: 913 [2025-03-03 20:05:06,170 INFO L226 Difference]: Without dead ends: 569 [2025-03-03 20:05:06,172 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-03 20:05:06,172 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 352 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:06,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1267 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:05:06,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-03 20:05:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2025-03-03 20:05:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 404 states have (on average 1.5940594059405941) internal successors, (644), 405 states have internal predecessors, (644), 159 states have call successors, (159), 2 states have call predecessors, (159), 2 states have return successors, (159), 158 states have call predecessors, (159), 159 states have call successors, (159) [2025-03-03 20:05:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 962 transitions. [2025-03-03 20:05:06,248 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 962 transitions. Word has length 680 [2025-03-03 20:05:06,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:06,250 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 962 transitions. [2025-03-03 20:05:06,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:06,251 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 962 transitions. [2025-03-03 20:05:06,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-03 20:05:06,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:06,264 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:05:06,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:05:06,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:06,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:06,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1199737776, now seen corresponding path program 1 times [2025-03-03 20:05:06,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:06,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857244939] [2025-03-03 20:05:06,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:06,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:06,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-03 20:05:06,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-03 20:05:06,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:06,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:05:06,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857244939] [2025-03-03 20:05:06,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857244939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:06,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:06,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:06,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123029379] [2025-03-03 20:05:06,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:06,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:06,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:06,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:06,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:06,819 INFO L87 Difference]: Start difference. First operand 566 states and 962 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:06,932 INFO L93 Difference]: Finished difference Result 1692 states and 2880 transitions. [2025-03-03 20:05:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:06,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-03 20:05:06,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:06,945 INFO L225 Difference]: With dead ends: 1692 [2025-03-03 20:05:06,945 INFO L226 Difference]: Without dead ends: 1129 [2025-03-03 20:05:06,949 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-03 20:05:06,950 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 365 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:06,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1219 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:05:06,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2025-03-03 20:05:07,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1127. [2025-03-03 20:05:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 804 states have (on average 1.5945273631840795) internal successors, (1282), 806 states have internal predecessors, (1282), 318 states have call successors, (318), 4 states have call predecessors, (318), 4 states have return successors, (318), 316 states have call predecessors, (318), 318 states have call successors, (318) [2025-03-03 20:05:07,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1918 transitions. [2025-03-03 20:05:07,095 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1918 transitions. Word has length 680 [2025-03-03 20:05:07,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:07,096 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1918 transitions. [2025-03-03 20:05:07,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:07,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1918 transitions. [2025-03-03 20:05:07,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-03 20:05:07,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:07,108 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:05:07,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:05:07,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:07,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:07,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1075664529, now seen corresponding path program 1 times [2025-03-03 20:05:07,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:07,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435123118] [2025-03-03 20:05:07,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:07,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:07,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-03 20:05:07,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-03 20:05:07,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:07,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:05:07,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:07,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435123118] [2025-03-03 20:05:07,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435123118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:07,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:07,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:07,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457323557] [2025-03-03 20:05:07,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:07,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:07,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:07,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:07,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:07,380 INFO L87 Difference]: Start difference. First operand 1127 states and 1918 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:07,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:07,495 INFO L93 Difference]: Finished difference Result 3065 states and 5232 transitions. [2025-03-03 20:05:07,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:07,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-03 20:05:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:07,513 INFO L225 Difference]: With dead ends: 3065 [2025-03-03 20:05:07,514 INFO L226 Difference]: Without dead ends: 1941 [2025-03-03 20:05:07,518 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-03 20:05:07,519 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 321 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1137 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.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:07,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1137 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:05:07,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2025-03-03 20:05:07,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1935. [2025-03-03 20:05:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1935 states, 1456 states have (on average 1.6236263736263736) internal successors, (2364), 1462 states have internal predecessors, (2364), 470 states have call successors, (470), 8 states have call predecessors, (470), 8 states have return successors, (470), 464 states have call predecessors, (470), 470 states have call successors, (470) [2025-03-03 20:05:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 3304 transitions. [2025-03-03 20:05:07,681 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 3304 transitions. Word has length 680 [2025-03-03 20:05:07,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:07,682 INFO L471 AbstractCegarLoop]: Abstraction has 1935 states and 3304 transitions. [2025-03-03 20:05:07,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:07,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 3304 transitions. [2025-03-03 20:05:07,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-03 20:05:07,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:07,697 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:05:07,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:05:07,697 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:07,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:07,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1493821870, now seen corresponding path program 1 times [2025-03-03 20:05:07,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:07,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177062083] [2025-03-03 20:05:07,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:07,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:07,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-03 20:05:07,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-03 20:05:07,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:07,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:05:08,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:08,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177062083] [2025-03-03 20:05:08,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177062083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:08,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:08,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:08,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661847840] [2025-03-03 20:05:08,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:08,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:08,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:08,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:08,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:08,157 INFO L87 Difference]: Start difference. First operand 1935 states and 3304 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:08,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:08,433 INFO L93 Difference]: Finished difference Result 5225 states and 8915 transitions. [2025-03-03 20:05:08,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:08,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-03 20:05:08,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:08,454 INFO L225 Difference]: With dead ends: 5225 [2025-03-03 20:05:08,455 INFO L226 Difference]: Without dead ends: 3293 [2025-03-03 20:05:08,461 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-03 20:05:08,462 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 354 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:08,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1136 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:05:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2025-03-03 20:05:08,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3287. [2025-03-03 20:05:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3287 states, 2461 states have (on average 1.617635107679805) internal successors, (3981), 2470 states have internal predecessors, (3981), 810 states have call successors, (810), 15 states have call predecessors, (810), 15 states have return successors, (810), 801 states have call predecessors, (810), 810 states have call successors, (810) [2025-03-03 20:05:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 5601 transitions. [2025-03-03 20:05:08,673 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 5601 transitions. Word has length 680 [2025-03-03 20:05:08,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:08,674 INFO L471 AbstractCegarLoop]: Abstraction has 3287 states and 5601 transitions. [2025-03-03 20:05:08,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 5601 transitions. [2025-03-03 20:05:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-03 20:05:08,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:08,682 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:05:08,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:05:08,682 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:08,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:08,684 INFO L85 PathProgramCache]: Analyzing trace with hash 617468499, now seen corresponding path program 1 times [2025-03-03 20:05:08,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:08,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943723907] [2025-03-03 20:05:08,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:08,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:08,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-03 20:05:08,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-03 20:05:08,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:08,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:05:08,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:08,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943723907] [2025-03-03 20:05:08,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943723907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:08,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:08,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:08,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998752778] [2025-03-03 20:05:08,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:08,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:08,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:08,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:08,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:08,922 INFO L87 Difference]: Start difference. First operand 3287 states and 5601 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:09,163 INFO L93 Difference]: Finished difference Result 9145 states and 15634 transitions. [2025-03-03 20:05:09,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:09,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-03 20:05:09,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:09,197 INFO L225 Difference]: With dead ends: 9145 [2025-03-03 20:05:09,197 INFO L226 Difference]: Without dead ends: 5949 [2025-03-03 20:05:09,208 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-03 20:05:09,209 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 326 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:09,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1126 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:05:09,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2025-03-03 20:05:09,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 5941. [2025-03-03 20:05:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5941 states, 4634 states have (on average 1.6318515321536469) internal successors, (7562), 4655 states have internal predecessors, (7562), 1278 states have call successors, (1278), 28 states have call predecessors, (1278), 28 states have return successors, (1278), 1257 states have call predecessors, (1278), 1278 states have call successors, (1278) [2025-03-03 20:05:09,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5941 states to 5941 states and 10118 transitions. [2025-03-03 20:05:09,526 INFO L78 Accepts]: Start accepts. Automaton has 5941 states and 10118 transitions. Word has length 680 [2025-03-03 20:05:09,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:09,527 INFO L471 AbstractCegarLoop]: Abstraction has 5941 states and 10118 transitions. [2025-03-03 20:05:09,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:09,528 INFO L276 IsEmpty]: Start isEmpty. Operand 5941 states and 10118 transitions. [2025-03-03 20:05:09,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-03 20:05:09,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:09,537 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:05:09,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:05:09,537 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:09,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:09,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1471120299, now seen corresponding path program 1 times [2025-03-03 20:05:09,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:09,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460787821] [2025-03-03 20:05:09,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:09,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:09,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-03 20:05:09,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-03 20:05:09,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:09,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:09,840 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:05:09,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:09,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460787821] [2025-03-03 20:05:09,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460787821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:09,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:09,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:05:09,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401081360] [2025-03-03 20:05:09,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:09,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:05:09,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:09,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:05:09,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:05:09,843 INFO L87 Difference]: Start difference. First operand 5941 states and 10118 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:10,785 INFO L93 Difference]: Finished difference Result 22669 states and 38198 transitions. [2025-03-03 20:05:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:05:10,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-03 20:05:10,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:10,864 INFO L225 Difference]: With dead ends: 22669 [2025-03-03 20:05:10,865 INFO L226 Difference]: Without dead ends: 16823 [2025-03-03 20:05:10,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:05:10,885 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 843 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:10,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1931 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:05:10,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16823 states. [2025-03-03 20:05:11,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16823 to 16789. [2025-03-03 20:05:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16789 states, 12184 states have (on average 1.5633617859487854) internal successors, (19048), 12277 states have internal predecessors, (19048), 4498 states have call successors, (4498), 106 states have call predecessors, (4498), 106 states have return successors, (4498), 4405 states have call predecessors, (4498), 4498 states have call successors, (4498) [2025-03-03 20:05:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16789 states to 16789 states and 28044 transitions. [2025-03-03 20:05:11,825 INFO L78 Accepts]: Start accepts. Automaton has 16789 states and 28044 transitions. Word has length 680 [2025-03-03 20:05:11,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:11,826 INFO L471 AbstractCegarLoop]: Abstraction has 16789 states and 28044 transitions. [2025-03-03 20:05:11,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 16789 states and 28044 transitions. [2025-03-03 20:05:11,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-03 20:05:11,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:11,847 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:05:11,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:05:11,847 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:11,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:11,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1826774644, now seen corresponding path program 1 times [2025-03-03 20:05:11,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:11,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890110964] [2025-03-03 20:05:11,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:11,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:11,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-03 20:05:11,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-03 20:05:11,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:11,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:05:12,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:12,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890110964] [2025-03-03 20:05:12,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890110964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:12,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:12,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:12,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90776978] [2025-03-03 20:05:12,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:12,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:12,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:12,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:12,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:12,250 INFO L87 Difference]: Start difference. First operand 16789 states and 28044 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:13,498 INFO L93 Difference]: Finished difference Result 47529 states and 79313 transitions. [2025-03-03 20:05:13,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:13,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-03 20:05:13,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:13,625 INFO L225 Difference]: With dead ends: 47529 [2025-03-03 20:05:13,625 INFO L226 Difference]: Without dead ends: 30835 [2025-03-03 20:05:13,684 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-03 20:05:13,685 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 295 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:13,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1107 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:05:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30835 states. [2025-03-03 20:05:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30835 to 30809. [2025-03-03 20:05:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30809 states, 22267 states have (on average 1.5558000628733102) internal successors, (34643), 22456 states have internal predecessors, (34643), 8338 states have call successors, (8338), 203 states have call predecessors, (8338), 203 states have return successors, (8338), 8149 states have call predecessors, (8338), 8338 states have call successors, (8338) [2025-03-03 20:05:15,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30809 states to 30809 states and 51319 transitions. [2025-03-03 20:05:15,504 INFO L78 Accepts]: Start accepts. Automaton has 30809 states and 51319 transitions. Word has length 680 [2025-03-03 20:05:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:15,505 INFO L471 AbstractCegarLoop]: Abstraction has 30809 states and 51319 transitions. [2025-03-03 20:05:15,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:15,506 INFO L276 IsEmpty]: Start isEmpty. Operand 30809 states and 51319 transitions. [2025-03-03 20:05:15,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-03 20:05:15,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:15,537 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:05:15,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:05:15,538 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:15,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:15,538 INFO L85 PathProgramCache]: Analyzing trace with hash 904091061, now seen corresponding path program 1 times [2025-03-03 20:05:15,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:15,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371191439] [2025-03-03 20:05:15,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:15,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:15,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-03 20:05:15,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-03 20:05:15,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:15,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:16,211 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:05:16,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:16,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371191439] [2025-03-03 20:05:16,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371191439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:16,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:16,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:16,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728170857] [2025-03-03 20:05:16,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:16,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:16,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:16,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:16,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:16,215 INFO L87 Difference]: Start difference. First operand 30809 states and 51319 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:17,516 INFO L93 Difference]: Finished difference Result 61519 states and 102488 transitions. [2025-03-03 20:05:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:17,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-03 20:05:17,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:17,659 INFO L225 Difference]: With dead ends: 61519 [2025-03-03 20:05:17,659 INFO L226 Difference]: Without dead ends: 30809 [2025-03-03 20:05:17,729 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-03 20:05:17,730 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 349 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:17,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 573 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:05:17,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30809 states. [2025-03-03 20:05:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30809 to 30809. [2025-03-03 20:05:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30809 states, 22267 states have (on average 1.5493330938159608) internal successors, (34499), 22456 states have internal predecessors, (34499), 8338 states have call successors, (8338), 203 states have call predecessors, (8338), 203 states have return successors, (8338), 8149 states have call predecessors, (8338), 8338 states have call successors, (8338) [2025-03-03 20:05:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30809 states to 30809 states and 51175 transitions. [2025-03-03 20:05:19,125 INFO L78 Accepts]: Start accepts. Automaton has 30809 states and 51175 transitions. Word has length 680 [2025-03-03 20:05:19,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:19,126 INFO L471 AbstractCegarLoop]: Abstraction has 30809 states and 51175 transitions. [2025-03-03 20:05:19,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:19,127 INFO L276 IsEmpty]: Start isEmpty. Operand 30809 states and 51175 transitions. [2025-03-03 20:05:19,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-03 20:05:19,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:19,153 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:05:19,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:05:19,153 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:19,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:19,154 INFO L85 PathProgramCache]: Analyzing trace with hash 495266836, now seen corresponding path program 1 times [2025-03-03 20:05:19,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:19,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619810417] [2025-03-03 20:05:19,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:19,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:19,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-03 20:05:19,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-03 20:05:19,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:19,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:19,781 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:05:19,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:19,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619810417] [2025-03-03 20:05:19,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619810417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:19,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:19,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:19,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040503138] [2025-03-03 20:05:19,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:19,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:19,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:19,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:19,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:19,783 INFO L87 Difference]: Start difference. First operand 30809 states and 51175 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:22,622 INFO L93 Difference]: Finished difference Result 92229 states and 153225 transitions. [2025-03-03 20:05:22,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:22,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-03 20:05:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:22,931 INFO L225 Difference]: With dead ends: 92229 [2025-03-03 20:05:22,932 INFO L226 Difference]: Without dead ends: 61519 [2025-03-03 20:05:23,042 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-03 20:05:23,042 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 331 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:23,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1144 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:05:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61519 states. [2025-03-03 20:05:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61519 to 61517. [2025-03-03 20:05:26,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61517 states, 44491 states have (on average 1.5455485379065428) internal successors, (68763), 44868 states have internal predecessors, (68763), 16622 states have call successors, (16622), 403 states have call predecessors, (16622), 403 states have return successors, (16622), 16245 states have call predecessors, (16622), 16622 states have call successors, (16622) [2025-03-03 20:05:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61517 states to 61517 states and 102007 transitions. [2025-03-03 20:05:26,639 INFO L78 Accepts]: Start accepts. Automaton has 61517 states and 102007 transitions. Word has length 680 [2025-03-03 20:05:26,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:26,640 INFO L471 AbstractCegarLoop]: Abstraction has 61517 states and 102007 transitions. [2025-03-03 20:05:26,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 61517 states and 102007 transitions. [2025-03-03 20:05:26,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2025-03-03 20:05:26,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:26,671 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:05:26,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:05:26,671 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:26,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:26,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1728565040, now seen corresponding path program 1 times [2025-03-03 20:05:26,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:26,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219837845] [2025-03-03 20:05:26,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:26,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:26,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 681 statements into 1 equivalence classes. [2025-03-03 20:05:26,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 681 of 681 statements. [2025-03-03 20:05:26,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:26,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:27,209 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-03 20:05:27,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:27,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219837845] [2025-03-03 20:05:27,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219837845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:27,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:27,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:27,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707531667] [2025-03-03 20:05:27,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:27,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:27,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:27,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:27,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:27,213 INFO L87 Difference]: Start difference. First operand 61517 states and 102007 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-03 20:05:32,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:32,410 INFO L93 Difference]: Finished difference Result 184353 states and 305721 transitions. [2025-03-03 20:05:32,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:32,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 681 [2025-03-03 20:05:32,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:32,872 INFO L225 Difference]: With dead ends: 184353 [2025-03-03 20:05:32,872 INFO L226 Difference]: Without dead ends: 122935 [2025-03-03 20:05:33,040 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-03 20:05:33,040 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 400 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:33,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1334 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:05:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122935 states.