./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-86.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 a806d48a99ead9732da218ab0539f2c78630232c1efa4792aeda8612b71a9641 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:34:31,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:34:31,136 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:34:31,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:34:31,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:34:31,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:34:31,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:34:31,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:34:31,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:34:31,168 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:34:31,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:34:31,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:34:31,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:34:31,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:34:31,169 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:34:31,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:34:31,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:34:31,170 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:34:31,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:34:31,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:34:31,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:34:31,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:34:31,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:34:31,171 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:34:31,171 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:34:31,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:34:31,171 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:34:31,171 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:34:31,171 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:34:31,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:34:31,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:34:31,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:34:31,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:34:31,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:34:31,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:34:31,172 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:34:31,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:34:31,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:34:31,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:34:31,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:34:31,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:34:31,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:34:31,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:34:31,173 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 -> a806d48a99ead9732da218ab0539f2c78630232c1efa4792aeda8612b71a9641 [2025-03-08 11:34:31,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:34:31,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:34:31,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:34:31,434 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:34:31,434 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:34:31,435 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-50_file-86.i [2025-03-08 11:34:32,622 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3fd4348/91b022a35ae04b6c88d416d1513c5927/FLAGd19e79cc5 [2025-03-08 11:34:32,954 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:34:32,954 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-86.i [2025-03-08 11:34:32,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3fd4348/91b022a35ae04b6c88d416d1513c5927/FLAGd19e79cc5 [2025-03-08 11:34:32,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3fd4348/91b022a35ae04b6c88d416d1513c5927 [2025-03-08 11:34:32,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:34:32,990 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:34:32,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:34:32,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:34:32,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:34:32,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:34:32" (1/1) ... [2025-03-08 11:34:32,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@597c2246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:34:32, skipping insertion in model container [2025-03-08 11:34:32,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:34:32" (1/1) ... [2025-03-08 11:34:33,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:34:33,126 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-50_file-86.i[915,928] [2025-03-08 11:34:33,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:34:33,218 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:34:33,226 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-50_file-86.i[915,928] [2025-03-08 11:34:33,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:34:33,280 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:34:33,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:34:33 WrapperNode [2025-03-08 11:34:33,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:34:33,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:34:33,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:34:33,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:34:33,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:34:33" (1/1) ... [2025-03-08 11:34:33,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:34:33" (1/1) ... [2025-03-08 11:34:33,339 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2025-03-08 11:34:33,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:34:33,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:34:33,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:34:33,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:34:33,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:34:33" (1/1) ... [2025-03-08 11:34:33,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:34:33" (1/1) ... [2025-03-08 11:34:33,352 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:34:33" (1/1) ... [2025-03-08 11:34:33,377 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:34:33,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:34:33" (1/1) ... [2025-03-08 11:34:33,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:34:33" (1/1) ... [2025-03-08 11:34:33,386 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:34:33" (1/1) ... [2025-03-08 11:34:33,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:34:33" (1/1) ... [2025-03-08 11:34:33,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:34:33" (1/1) ... [2025-03-08 11:34:33,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:34:33" (1/1) ... [2025-03-08 11:34:33,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:34:33,403 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:34:33,403 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:34:33,403 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:34:33,404 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:34:33" (1/1) ... [2025-03-08 11:34:33,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:34:33,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:34:33,433 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:34:33,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:34:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:34:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:34:33,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:34:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:34:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:34:33,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:34:33,532 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:34:33,534 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:34:33,999 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-08 11:34:33,999 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:34:34,021 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:34:34,022 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:34:34,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:34:34 BoogieIcfgContainer [2025-03-08 11:34:34,023 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:34:34,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:34:34,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:34:34,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:34:34,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:34:32" (1/3) ... [2025-03-08 11:34:34,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365bca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:34:34, skipping insertion in model container [2025-03-08 11:34:34,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:34:33" (2/3) ... [2025-03-08 11:34:34,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365bca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:34:34, skipping insertion in model container [2025-03-08 11:34:34,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:34:34" (3/3) ... [2025-03-08 11:34:34,031 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-86.i [2025-03-08 11:34:34,041 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:34:34,044 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-86.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:34:34,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:34:34,093 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;@3f422043, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:34:34,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:34:34,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 69 states have (on average 1.463768115942029) internal successors, (101), 70 states have internal predecessors, (101), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 11:34:34,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 11:34:34,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:34:34,106 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:34:34,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:34:34,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:34:34,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1781146, now seen corresponding path program 1 times [2025-03-08 11:34:34,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:34:34,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29787103] [2025-03-08 11:34:34,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:34:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:34:34,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 11:34:34,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 11:34:34,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:34:34,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:34:34,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-08 11:34:34,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:34:34,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29787103] [2025-03-08 11:34:34,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29787103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:34:34,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695038433] [2025-03-08 11:34:34,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:34:34,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:34:34,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:34:34,385 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:34:34,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:34:34,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 11:34:34,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 11:34:34,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:34:34,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:34:34,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:34:34,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:34:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-08 11:34:34,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:34:34,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695038433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:34:34,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:34:34,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:34:34,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149927802] [2025-03-08 11:34:34,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:34:34,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:34:34,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:34:34,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:34:34,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:34:34,616 INFO L87 Difference]: Start difference. First operand has 103 states, 69 states have (on average 1.463768115942029) internal successors, (101), 70 states have internal predecessors, (101), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:34:34,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:34:34,652 INFO L93 Difference]: Finished difference Result 200 states and 352 transitions. [2025-03-08 11:34:34,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:34:34,655 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 197 [2025-03-08 11:34:34,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:34:34,660 INFO L225 Difference]: With dead ends: 200 [2025-03-08 11:34:34,662 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 11:34:34,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:34:34,668 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:34:34,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:34:34,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 11:34:34,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 11:34:34,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 67 states have internal predecessors, (95), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 11:34:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 157 transitions. [2025-03-08 11:34:34,709 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 157 transitions. Word has length 197 [2025-03-08 11:34:34,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:34:34,710 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 157 transitions. [2025-03-08 11:34:34,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:34:34,710 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 157 transitions. [2025-03-08 11:34:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 11:34:34,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:34:34,713 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:34:34,719 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-08 11:34:34,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:34:34,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:34:34,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:34:34,915 INFO L85 PathProgramCache]: Analyzing trace with hash -505266821, now seen corresponding path program 1 times [2025-03-08 11:34:34,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:34:34,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740357372] [2025-03-08 11:34:34,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:34:34,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:34:34,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 11:34:34,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 11:34:34,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:34:34,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:34:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:34:35,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:34:35,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740357372] [2025-03-08 11:34:35,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740357372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:34:35,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:34:35,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:34:35,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381698928] [2025-03-08 11:34:35,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:34:35,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:34:35,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:34:35,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:34:35,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:34:35,272 INFO L87 Difference]: Start difference. First operand 100 states and 157 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:34:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:34:35,323 INFO L93 Difference]: Finished difference Result 198 states and 313 transitions. [2025-03-08 11:34:35,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:34:35,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-03-08 11:34:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:34:35,326 INFO L225 Difference]: With dead ends: 198 [2025-03-08 11:34:35,326 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 11:34:35,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:34:35,327 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:34:35,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:34:35,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 11:34:35,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-08 11:34:35,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 11:34:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 158 transitions. [2025-03-08 11:34:35,343 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 158 transitions. Word has length 197 [2025-03-08 11:34:35,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:34:35,345 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 158 transitions. [2025-03-08 11:34:35,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:34:35,345 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 158 transitions. [2025-03-08 11:34:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 11:34:35,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:34:35,351 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:34:35,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:34:35,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:34:35,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:34:35,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1502339174, now seen corresponding path program 1 times [2025-03-08 11:34:35,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:34:35,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803801298] [2025-03-08 11:34:35,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:34:35,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:34:35,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 11:34:35,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 11:34:35,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:34:35,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:34:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:34:35,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:34:35,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803801298] [2025-03-08 11:34:35,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803801298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:34:35,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:34:35,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:34:35,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68677546] [2025-03-08 11:34:35,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:34:35,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:34:35,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:34:35,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:34:35,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:34:35,695 INFO L87 Difference]: Start difference. First operand 101 states and 158 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:34:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:34:35,973 INFO L93 Difference]: Finished difference Result 298 states and 469 transitions. [2025-03-08 11:34:35,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:34:35,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-03-08 11:34:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:34:35,977 INFO L225 Difference]: With dead ends: 298 [2025-03-08 11:34:35,978 INFO L226 Difference]: Without dead ends: 200 [2025-03-08 11:34:35,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:34:35,980 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 151 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:34:35,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 519 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:34:35,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-08 11:34:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2025-03-08 11:34:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 115 states have (on average 1.391304347826087) internal successors, (160), 115 states have internal predecessors, (160), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 11:34:36,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 284 transitions. [2025-03-08 11:34:36,013 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 284 transitions. Word has length 197 [2025-03-08 11:34:36,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:34:36,014 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 284 transitions. [2025-03-08 11:34:36,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:34:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 284 transitions. [2025-03-08 11:34:36,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 11:34:36,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:34:36,018 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:34:36,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:34:36,018 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:34:36,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:34:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2007897799, now seen corresponding path program 1 times [2025-03-08 11:34:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:34:36,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198807658] [2025-03-08 11:34:36,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:34:36,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:34:36,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 11:34:36,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 11:34:36,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:34:36,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:34:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:34:42,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:34:42,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198807658] [2025-03-08 11:34:42,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198807658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:34:42,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:34:42,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 11:34:42,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896979314] [2025-03-08 11:34:42,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:34:42,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 11:34:42,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:34:42,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 11:34:42,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:34:42,065 INFO L87 Difference]: Start difference. First operand 180 states and 284 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:34:44,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:34:44,132 INFO L93 Difference]: Finished difference Result 354 states and 545 transitions. [2025-03-08 11:34:44,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 11:34:44,133 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-03-08 11:34:44,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:34:44,135 INFO L225 Difference]: With dead ends: 354 [2025-03-08 11:34:44,135 INFO L226 Difference]: Without dead ends: 256 [2025-03-08 11:34:44,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2025-03-08 11:34:44,137 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 311 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:34:44,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 968 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 11:34:44,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-08 11:34:44,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 197. [2025-03-08 11:34:44,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 11:34:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 307 transitions. [2025-03-08 11:34:44,165 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 307 transitions. Word has length 197 [2025-03-08 11:34:44,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:34:44,167 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 307 transitions. [2025-03-08 11:34:44,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:34:44,167 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 307 transitions. [2025-03-08 11:34:44,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 11:34:44,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:34:44,168 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:34:44,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:34:44,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:34:44,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:34:44,169 INFO L85 PathProgramCache]: Analyzing trace with hash 490118138, now seen corresponding path program 1 times [2025-03-08 11:34:44,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:34:44,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489610593] [2025-03-08 11:34:44,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:34:44,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:34:44,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 11:34:44,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 11:34:44,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:34:44,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:34:44,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:34:44,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:34:44,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489610593] [2025-03-08 11:34:44,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489610593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:34:44,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:34:44,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:34:44,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448989274] [2025-03-08 11:34:44,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:34:44,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:34:44,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:34:44,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:34:44,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:34:44,233 INFO L87 Difference]: Start difference. First operand 197 states and 307 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:34:44,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:34:44,279 INFO L93 Difference]: Finished difference Result 392 states and 615 transitions. [2025-03-08 11:34:44,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:34:44,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-03-08 11:34:44,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:34:44,282 INFO L225 Difference]: With dead ends: 392 [2025-03-08 11:34:44,282 INFO L226 Difference]: Without dead ends: 294 [2025-03-08 11:34:44,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:34:44,284 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 149 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:34:44,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 306 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:34:44,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-08 11:34:44,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2025-03-08 11:34:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 195 states have (on average 1.3846153846153846) internal successors, (270), 195 states have internal predecessors, (270), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 11:34:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 456 transitions. [2025-03-08 11:34:44,312 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 456 transitions. Word has length 197 [2025-03-08 11:34:44,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:34:44,312 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 456 transitions. [2025-03-08 11:34:44,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:34:44,312 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 456 transitions. [2025-03-08 11:34:44,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 11:34:44,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:34:44,313 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:34:44,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:34:44,314 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:34:44,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:34:44,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2027493589, now seen corresponding path program 1 times [2025-03-08 11:34:44,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:34:44,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390414797] [2025-03-08 11:34:44,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:34:44,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:34:44,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 11:34:44,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 11:34:44,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:34:44,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:34:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:34:49,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:34:49,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390414797] [2025-03-08 11:34:49,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390414797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:34:49,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:34:49,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 11:34:49,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966852786] [2025-03-08 11:34:49,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:34:49,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 11:34:49,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:34:49,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 11:34:49,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:34:49,352 INFO L87 Difference]: Start difference. First operand 292 states and 456 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:34:50,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:34:50,119 INFO L93 Difference]: Finished difference Result 342 states and 514 transitions. [2025-03-08 11:34:50,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 11:34:50,119 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2025-03-08 11:34:50,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:34:50,121 INFO L225 Difference]: With dead ends: 342 [2025-03-08 11:34:50,121 INFO L226 Difference]: Without dead ends: 340 [2025-03-08 11:34:50,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2025-03-08 11:34:50,122 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 297 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:34:50,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1083 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:34:50,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-08 11:34:50,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 293. [2025-03-08 11:34:50,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 196 states have (on average 1.3826530612244898) internal successors, (271), 196 states have internal predecessors, (271), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 11:34:50,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 457 transitions. [2025-03-08 11:34:50,143 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 457 transitions. Word has length 198 [2025-03-08 11:34:50,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:34:50,144 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 457 transitions. [2025-03-08 11:34:50,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:34:50,144 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 457 transitions. [2025-03-08 11:34:50,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 11:34:50,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:34:50,146 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:34:50,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:34:50,146 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:34:50,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:34:50,146 INFO L85 PathProgramCache]: Analyzing trace with hash 708683112, now seen corresponding path program 1 times [2025-03-08 11:34:50,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:34:50,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15704757] [2025-03-08 11:34:50,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:34:50,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:34:50,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 11:34:50,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 11:34:50,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:34:50,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:34:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:34:50,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:34:50,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15704757] [2025-03-08 11:34:50,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15704757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:34:50,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:34:50,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:34:50,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231404195] [2025-03-08 11:34:50,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:34:50,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:34:50,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:34:50,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:34:50,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:34:50,341 INFO L87 Difference]: Start difference. First operand 293 states and 457 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:34:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:34:50,380 INFO L93 Difference]: Finished difference Result 497 states and 776 transitions. [2025-03-08 11:34:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:34:50,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2025-03-08 11:34:50,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:34:50,385 INFO L225 Difference]: With dead ends: 497 [2025-03-08 11:34:50,386 INFO L226 Difference]: Without dead ends: 301 [2025-03-08 11:34:50,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:34:50,387 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:34:50,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 288 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:34:50,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-08 11:34:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 293. [2025-03-08 11:34:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 196 states have (on average 1.3673469387755102) internal successors, (268), 196 states have internal predecessors, (268), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 11:34:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 454 transitions. [2025-03-08 11:34:50,424 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 454 transitions. Word has length 198 [2025-03-08 11:34:50,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:34:50,425 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 454 transitions. [2025-03-08 11:34:50,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:34:50,425 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 454 transitions. [2025-03-08 11:34:50,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 11:34:50,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:34:50,427 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:34:50,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:34:50,427 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:34:50,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:34:50,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1596186793, now seen corresponding path program 1 times [2025-03-08 11:34:50,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:34:50,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946446212] [2025-03-08 11:34:50,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:34:50,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:34:50,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 11:34:50,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 11:34:50,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:34:50,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:34:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:34:53,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:34:53,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946446212] [2025-03-08 11:34:53,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946446212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:34:53,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:34:53,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 11:34:53,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820032739] [2025-03-08 11:34:53,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:34:53,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 11:34:53,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:34:53,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 11:34:53,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-08 11:34:53,073 INFO L87 Difference]: Start difference. First operand 293 states and 454 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:34:54,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:34:54,131 INFO L93 Difference]: Finished difference Result 342 states and 509 transitions. [2025-03-08 11:34:54,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 11:34:54,132 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 198 [2025-03-08 11:34:54,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:34:54,134 INFO L225 Difference]: With dead ends: 342 [2025-03-08 11:34:54,134 INFO L226 Difference]: Without dead ends: 340 [2025-03-08 11:34:54,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2025-03-08 11:34:54,135 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 292 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:34:54,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 1332 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:34:54,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-08 11:34:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 293. [2025-03-08 11:34:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 196 states have (on average 1.3673469387755102) internal successors, (268), 196 states have internal predecessors, (268), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 11:34:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 454 transitions. [2025-03-08 11:34:54,153 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 454 transitions. Word has length 198 [2025-03-08 11:34:54,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:34:54,153 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 454 transitions. [2025-03-08 11:34:54,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:34:54,153 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 454 transitions. [2025-03-08 11:34:54,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 11:34:54,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:34:54,155 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:34:54,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:34:54,155 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:34:54,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:34:54,155 INFO L85 PathProgramCache]: Analyzing trace with hash 82131527, now seen corresponding path program 1 times [2025-03-08 11:34:54,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:34:54,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234976776] [2025-03-08 11:34:54,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:34:54,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:34:54,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 11:34:54,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 11:34:54,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:34:54,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:34:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:34:58,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:34:58,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234976776] [2025-03-08 11:34:58,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234976776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:34:58,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:34:58,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 11:34:58,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468258125] [2025-03-08 11:34:58,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:34:58,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 11:34:58,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:34:58,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 11:34:58,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:34:58,113 INFO L87 Difference]: Start difference. First operand 293 states and 454 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-08 11:35:00,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:35:00,117 INFO L93 Difference]: Finished difference Result 363 states and 533 transitions. [2025-03-08 11:35:00,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 11:35:00,118 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 198 [2025-03-08 11:35:00,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:35:00,123 INFO L225 Difference]: With dead ends: 363 [2025-03-08 11:35:00,123 INFO L226 Difference]: Without dead ends: 361 [2025-03-08 11:35:00,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=285, Invalid=771, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 11:35:00,124 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 581 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:35:00,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1192 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 11:35:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-08 11:35:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 303. [2025-03-08 11:35:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 206 states have (on average 1.3640776699029127) internal successors, (281), 206 states have internal predecessors, (281), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 11:35:00,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 467 transitions. [2025-03-08 11:35:00,146 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 467 transitions. Word has length 198 [2025-03-08 11:35:00,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:35:00,147 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 467 transitions. [2025-03-08 11:35:00,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-08 11:35:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 467 transitions. [2025-03-08 11:35:00,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 11:35:00,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:35:00,149 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:35:00,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:35:00,149 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:35:00,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:35:00,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1725322936, now seen corresponding path program 1 times [2025-03-08 11:35:00,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:35:00,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421828807] [2025-03-08 11:35:00,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:35:00,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:35:00,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 11:35:00,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 11:35:00,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:35:00,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:35:08,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:35:08,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:35:08,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421828807] [2025-03-08 11:35:08,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421828807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:35:08,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:35:08,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 11:35:08,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050483944] [2025-03-08 11:35:08,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:35:08,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 11:35:08,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:35:08,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 11:35:08,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:35:08,628 INFO L87 Difference]: Start difference. First operand 303 states and 467 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:35:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:35:18,384 INFO L93 Difference]: Finished difference Result 357 states and 527 transitions. [2025-03-08 11:35:18,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 11:35:18,385 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2025-03-08 11:35:18,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:35:18,387 INFO L225 Difference]: With dead ends: 357 [2025-03-08 11:35:18,387 INFO L226 Difference]: Without dead ends: 355 [2025-03-08 11:35:18,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=304, Invalid=818, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 11:35:18,387 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 281 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:35:18,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1039 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 11:35:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-08 11:35:18,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 303. [2025-03-08 11:35:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 206 states have (on average 1.3640776699029127) internal successors, (281), 206 states have internal predecessors, (281), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 11:35:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 467 transitions. [2025-03-08 11:35:18,407 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 467 transitions. Word has length 198 [2025-03-08 11:35:18,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:35:18,408 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 467 transitions. [2025-03-08 11:35:18,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:35:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 467 transitions. [2025-03-08 11:35:18,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-08 11:35:18,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:35:18,409 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:35:18,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:35:18,411 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:35:18,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:35:18,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1707746921, now seen corresponding path program 1 times [2025-03-08 11:35:18,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:35:18,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061814122] [2025-03-08 11:35:18,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:35:18,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:35:18,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 11:35:18,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 11:35:18,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:35:18,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:35:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:35:27,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:35:27,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061814122] [2025-03-08 11:35:27,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061814122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:35:27,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:35:27,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 11:35:27,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879386687] [2025-03-08 11:35:27,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:35:27,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 11:35:27,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:35:27,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 11:35:27,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:35:27,665 INFO L87 Difference]: Start difference. First operand 303 states and 467 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:35:34,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:35:34,597 INFO L93 Difference]: Finished difference Result 366 states and 538 transitions. [2025-03-08 11:35:34,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 11:35:34,598 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2025-03-08 11:35:34,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:35:34,600 INFO L225 Difference]: With dead ends: 366 [2025-03-08 11:35:34,600 INFO L226 Difference]: Without dead ends: 364 [2025-03-08 11:35:34,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=318, Invalid=804, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 11:35:34,602 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 332 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:35:34,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 975 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 11:35:34,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-08 11:35:34,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 307. [2025-03-08 11:35:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 210 states have (on average 1.361904761904762) internal successors, (286), 210 states have internal predecessors, (286), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 11:35:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 472 transitions. [2025-03-08 11:35:34,619 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 472 transitions. Word has length 199 [2025-03-08 11:35:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:35:34,619 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 472 transitions. [2025-03-08 11:35:34,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:35:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 472 transitions. [2025-03-08 11:35:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-08 11:35:34,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:35:34,621 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:35:34,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:35:34,621 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:35:34,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:35:34,621 INFO L85 PathProgramCache]: Analyzing trace with hash 779765912, now seen corresponding path program 1 times [2025-03-08 11:35:34,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:35:34,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714946824] [2025-03-08 11:35:34,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:35:34,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:35:34,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 11:35:34,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 11:35:34,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:35:34,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:35:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:35:46,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:35:46,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714946824] [2025-03-08 11:35:46,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714946824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:35:46,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:35:46,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 11:35:46,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324322291] [2025-03-08 11:35:46,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:35:46,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 11:35:46,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:35:46,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 11:35:46,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-03-08 11:35:46,452 INFO L87 Difference]: Start difference. First operand 307 states and 472 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:35:57,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:35:57,391 INFO L93 Difference]: Finished difference Result 362 states and 533 transitions. [2025-03-08 11:35:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 11:35:57,392 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 199 [2025-03-08 11:35:57,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:35:57,394 INFO L225 Difference]: With dead ends: 362 [2025-03-08 11:35:57,394 INFO L226 Difference]: Without dead ends: 360 [2025-03-08 11:35:57,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=384, Invalid=948, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 11:35:57,395 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 347 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:35:57,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1156 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 11:35:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-08 11:35:57,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 304. [2025-03-08 11:35:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 207 states have (on average 1.3623188405797102) internal successors, (282), 207 states have internal predecessors, (282), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 11:35:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 468 transitions. [2025-03-08 11:35:57,413 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 468 transitions. Word has length 199 [2025-03-08 11:35:57,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:35:57,414 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 468 transitions. [2025-03-08 11:35:57,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:35:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 468 transitions. [2025-03-08 11:35:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-08 11:35:57,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:35:57,417 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:35:57,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:35:57,417 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:35:57,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:35:57,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1970020933, now seen corresponding path program 1 times [2025-03-08 11:35:57,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:35:57,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688669507] [2025-03-08 11:35:57,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:35:57,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:35:57,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 11:35:57,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 11:35:57,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:35:57,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:36:00,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:36:00,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:36:00,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688669507] [2025-03-08 11:36:00,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688669507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:36:00,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:36:00,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 11:36:00,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319570523] [2025-03-08 11:36:00,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:36:00,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 11:36:00,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:36:00,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 11:36:00,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:36:00,032 INFO L87 Difference]: Start difference. First operand 304 states and 468 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:36:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:36:01,172 INFO L93 Difference]: Finished difference Result 348 states and 517 transitions. [2025-03-08 11:36:01,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 11:36:01,173 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 199 [2025-03-08 11:36:01,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:36:01,175 INFO L225 Difference]: With dead ends: 348 [2025-03-08 11:36:01,175 INFO L226 Difference]: Without dead ends: 346 [2025-03-08 11:36:01,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2025-03-08 11:36:01,175 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 449 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:36:01,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1247 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:36:01,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-08 11:36:01,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 301. [2025-03-08 11:36:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 204 states have (on average 1.3627450980392157) internal successors, (278), 204 states have internal predecessors, (278), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 11:36:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 464 transitions. [2025-03-08 11:36:01,191 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 464 transitions. Word has length 199 [2025-03-08 11:36:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:36:01,191 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 464 transitions. [2025-03-08 11:36:01,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:36:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 464 transitions. [2025-03-08 11:36:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-08 11:36:01,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:36:01,193 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:36:01,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 11:36:01,193 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:36:01,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:36:01,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1660170402, now seen corresponding path program 1 times [2025-03-08 11:36:01,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:36:01,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467979158] [2025-03-08 11:36:01,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:36:01,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:36:01,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 11:36:01,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 11:36:01,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:36:01,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat