./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-11.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 568715a232aa16d18571b6e9b4b6f71d3297e66e84733db9163f76f7b8e7e31f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:43:23,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:43:23,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:43:23,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:43:23,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:43:23,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:43:23,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:43:23,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:43:23,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:43:23,405 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:43:23,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:43:23,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:43:23,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:43:23,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:43:23,407 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:43:23,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:43:23,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:43:23,407 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:43:23,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:43:23,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:43:23,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:43:23,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:43:23,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:43:23,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:43:23,408 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:43:23,408 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:43:23,408 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:43:23,408 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:43:23,408 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:43:23,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:43:23,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:43:23,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:43:23,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:43:23,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:43:23,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:43:23,409 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:43:23,409 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:43:23,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:43:23,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:43:23,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:43:23,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:43:23,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:43:23,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:43:23,410 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 -> 568715a232aa16d18571b6e9b4b6f71d3297e66e84733db9163f76f7b8e7e31f [2025-03-03 19:43:23,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:43:23,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:43:23,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:43:23,652 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:43:23,652 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:43:23,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-11.i [2025-03-03 19:43:24,840 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44992a3ed/633858b02e6340b8944ec6a9b9bfb1dc/FLAGc442bce3a [2025-03-03 19:43:25,152 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:43:25,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-11.i [2025-03-03 19:43:25,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44992a3ed/633858b02e6340b8944ec6a9b9bfb1dc/FLAGc442bce3a [2025-03-03 19:43:25,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44992a3ed/633858b02e6340b8944ec6a9b9bfb1dc [2025-03-03 19:43:25,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:43:25,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:43:25,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:43:25,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:43:25,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:43:25,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:43:25" (1/1) ... [2025-03-03 19:43:25,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:25, skipping insertion in model container [2025-03-03 19:43:25,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:43:25" (1/1) ... [2025-03-03 19:43:25,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:43:25,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-11.i[916,929] [2025-03-03 19:43:25,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:43:25,424 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:43:25,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-11.i[916,929] [2025-03-03 19:43:25,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:43:25,511 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:43:25,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:25 WrapperNode [2025-03-03 19:43:25,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:43:25,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:43:25,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:43:25,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:43:25,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:25" (1/1) ... [2025-03-03 19:43:25,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:25" (1/1) ... [2025-03-03 19:43:25,561 INFO L138 Inliner]: procedures = 26, calls = 94, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 551 [2025-03-03 19:43:25,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:43:25,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:43:25,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:43:25,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:43:25,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:25" (1/1) ... [2025-03-03 19:43:25,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:25" (1/1) ... [2025-03-03 19:43:25,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:25" (1/1) ... [2025-03-03 19:43:25,598 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:43:25,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:25" (1/1) ... [2025-03-03 19:43:25,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:25" (1/1) ... [2025-03-03 19:43:25,616 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:25" (1/1) ... [2025-03-03 19:43:25,622 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:25" (1/1) ... [2025-03-03 19:43:25,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:25" (1/1) ... [2025-03-03 19:43:25,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:25" (1/1) ... [2025-03-03 19:43:25,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:43:25,634 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:43:25,634 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:43:25,634 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:43:25,637 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:25" (1/1) ... [2025-03-03 19:43:25,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:43:25,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:43:25,670 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:43:25,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:43:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:43:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:43:25,691 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:43:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:43:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:43:25,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:43:25,777 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:43:25,778 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:43:26,444 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-03 19:43:26,444 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:43:26,473 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:43:26,473 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:43:26,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:43:26 BoogieIcfgContainer [2025-03-03 19:43:26,475 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:43:26,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:43:26,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:43:26,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:43:26,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:43:25" (1/3) ... [2025-03-03 19:43:26,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59cada8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:43:26, skipping insertion in model container [2025-03-03 19:43:26,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:25" (2/3) ... [2025-03-03 19:43:26,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59cada8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:43:26, skipping insertion in model container [2025-03-03 19:43:26,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:43:26" (3/3) ... [2025-03-03 19:43:26,483 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-11.i [2025-03-03 19:43:26,494 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:43:26,497 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-11.i that has 2 procedures, 237 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:43:26,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:43:26,561 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;@76107aeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:43:26,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:43:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 153 states have (on average 1.5294117647058822) internal successors, (234), 154 states have internal predecessors, (234), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 19:43:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-03 19:43:26,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:26,593 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:26,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:26,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:26,599 INFO L85 PathProgramCache]: Analyzing trace with hash -433829847, now seen corresponding path program 1 times [2025-03-03 19:43:26,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:26,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289418684] [2025-03-03 19:43:26,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:26,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:26,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-03 19:43:26,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-03 19:43:26,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:26,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 12800 trivial. 0 not checked. [2025-03-03 19:43:27,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:27,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289418684] [2025-03-03 19:43:27,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289418684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:43:27,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860640979] [2025-03-03 19:43:27,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:27,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:43:27,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:43:27,113 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:43:27,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:43:27,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-03 19:43:27,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-03 19:43:27,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:27,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:27,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:43:27,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:43:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 12800 trivial. 0 not checked. [2025-03-03 19:43:27,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:43:27,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860640979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:27,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:43:27,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:43:27,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167761362] [2025-03-03 19:43:27,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:27,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:43:27,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:27,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:43:27,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:43:27,492 INFO L87 Difference]: Start difference. First operand has 237 states, 153 states have (on average 1.5294117647058822) internal successors, (234), 154 states have internal predecessors, (234), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) Second operand has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-03 19:43:27,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:27,547 INFO L93 Difference]: Finished difference Result 468 states and 868 transitions. [2025-03-03 19:43:27,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:43:27,549 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) Word has length 496 [2025-03-03 19:43:27,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:27,554 INFO L225 Difference]: With dead ends: 468 [2025-03-03 19:43:27,554 INFO L226 Difference]: Without dead ends: 234 [2025-03-03 19:43:27,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:43:27,565 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:27,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 380 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:43:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-03 19:43:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-03-03 19:43:27,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 151 states have (on average 1.5033112582781456) internal successors, (227), 151 states have internal predecessors, (227), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 19:43:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 389 transitions. [2025-03-03 19:43:27,627 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 389 transitions. Word has length 496 [2025-03-03 19:43:27,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:27,629 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 389 transitions. [2025-03-03 19:43:27,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-03 19:43:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 389 transitions. [2025-03-03 19:43:27,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-03 19:43:27,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:27,641 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:27,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 19:43:27,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:43:27,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:27,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:27,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1490755034, now seen corresponding path program 1 times [2025-03-03 19:43:27,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:27,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29270059] [2025-03-03 19:43:27,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:27,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:27,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-03 19:43:27,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-03 19:43:27,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:27,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:43:28,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:28,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29270059] [2025-03-03 19:43:28,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29270059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:28,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:28,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:43:28,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829522917] [2025-03-03 19:43:28,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:28,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:43:28,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:28,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:43:28,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:43:28,329 INFO L87 Difference]: Start difference. First operand 234 states and 389 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:43:28,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:28,419 INFO L93 Difference]: Finished difference Result 595 states and 993 transitions. [2025-03-03 19:43:28,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:43:28,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 496 [2025-03-03 19:43:28,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:28,427 INFO L225 Difference]: With dead ends: 595 [2025-03-03 19:43:28,427 INFO L226 Difference]: Without dead ends: 364 [2025-03-03 19:43:28,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:43:28,429 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 228 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:28,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 882 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:43:28,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-03 19:43:28,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2025-03-03 19:43:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 246 states have (on average 1.5406504065040652) internal successors, (379), 247 states have internal predecessors, (379), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 19:43:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 603 transitions. [2025-03-03 19:43:28,484 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 603 transitions. Word has length 496 [2025-03-03 19:43:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:28,488 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 603 transitions. [2025-03-03 19:43:28,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:43:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 603 transitions. [2025-03-03 19:43:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-03-03 19:43:28,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:28,494 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:28,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:43:28,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:28,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:28,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1496040359, now seen corresponding path program 1 times [2025-03-03 19:43:28,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:28,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522903668] [2025-03-03 19:43:28,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:28,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:28,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-03-03 19:43:28,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-03-03 19:43:28,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:28,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:43:29,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:29,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522903668] [2025-03-03 19:43:29,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522903668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:29,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:29,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:43:29,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648107573] [2025-03-03 19:43:29,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:29,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:43:29,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:29,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:43:29,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:43:29,088 INFO L87 Difference]: Start difference. First operand 361 states and 603 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:43:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:29,524 INFO L93 Difference]: Finished difference Result 992 states and 1652 transitions. [2025-03-03 19:43:29,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:43:29,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 497 [2025-03-03 19:43:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:29,533 INFO L225 Difference]: With dead ends: 992 [2025-03-03 19:43:29,534 INFO L226 Difference]: Without dead ends: 634 [2025-03-03 19:43:29,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:43:29,535 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 507 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:29,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1204 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:43:29,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-03-03 19:43:29,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 598. [2025-03-03 19:43:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 445 states have (on average 1.5887640449438203) internal successors, (707), 448 states have internal predecessors, (707), 146 states have call successors, (146), 6 states have call predecessors, (146), 6 states have return successors, (146), 143 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-03 19:43:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 999 transitions. [2025-03-03 19:43:29,577 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 999 transitions. Word has length 497 [2025-03-03 19:43:29,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:29,578 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 999 transitions. [2025-03-03 19:43:29,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:43:29,578 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 999 transitions. [2025-03-03 19:43:29,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-03 19:43:29,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:29,581 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:29,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:43:29,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:29,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:29,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1889650927, now seen corresponding path program 1 times [2025-03-03 19:43:29,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:29,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491621426] [2025-03-03 19:43:29,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:29,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:29,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-03 19:43:29,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-03 19:43:29,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:29,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:43:30,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:30,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491621426] [2025-03-03 19:43:30,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491621426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:30,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:30,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:43:30,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886274850] [2025-03-03 19:43:30,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:30,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:43:30,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:30,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:43:30,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:43:30,509 INFO L87 Difference]: Start difference. First operand 598 states and 999 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:43:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:30,590 INFO L93 Difference]: Finished difference Result 1235 states and 2052 transitions. [2025-03-03 19:43:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:43:30,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 498 [2025-03-03 19:43:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:30,595 INFO L225 Difference]: With dead ends: 1235 [2025-03-03 19:43:30,595 INFO L226 Difference]: Without dead ends: 640 [2025-03-03 19:43:30,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:43:30,597 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 42 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:30,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 753 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:43:30,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-03 19:43:30,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 614. [2025-03-03 19:43:30,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 461 states have (on average 1.5856832971800434) internal successors, (731), 464 states have internal predecessors, (731), 146 states have call successors, (146), 6 states have call predecessors, (146), 6 states have return successors, (146), 143 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-03 19:43:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1023 transitions. [2025-03-03 19:43:30,644 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1023 transitions. Word has length 498 [2025-03-03 19:43:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:30,645 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 1023 transitions. [2025-03-03 19:43:30,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:43:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1023 transitions. [2025-03-03 19:43:30,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-03 19:43:30,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:30,651 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:30,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:43:30,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:30,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:30,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1888727406, now seen corresponding path program 1 times [2025-03-03 19:43:30,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:30,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090230723] [2025-03-03 19:43:30,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:30,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:30,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-03 19:43:30,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-03 19:43:30,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:30,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:43:31,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:31,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090230723] [2025-03-03 19:43:31,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090230723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:31,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:31,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:43:31,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277274171] [2025-03-03 19:43:31,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:31,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:43:31,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:31,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:43:31,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:43:31,158 INFO L87 Difference]: Start difference. First operand 614 states and 1023 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:43:31,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:31,710 INFO L93 Difference]: Finished difference Result 1725 states and 2890 transitions. [2025-03-03 19:43:31,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:43:31,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 498 [2025-03-03 19:43:31,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:31,718 INFO L225 Difference]: With dead ends: 1725 [2025-03-03 19:43:31,719 INFO L226 Difference]: Without dead ends: 1114 [2025-03-03 19:43:31,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:43:31,722 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 350 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:31,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1328 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:43:31,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2025-03-03 19:43:31,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1032. [2025-03-03 19:43:31,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 795 states have (on average 1.618867924528302) internal successors, (1287), 798 states have internal predecessors, (1287), 227 states have call successors, (227), 9 states have call predecessors, (227), 9 states have return successors, (227), 224 states have call predecessors, (227), 227 states have call successors, (227) [2025-03-03 19:43:31,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1741 transitions. [2025-03-03 19:43:31,809 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1741 transitions. Word has length 498 [2025-03-03 19:43:31,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:31,809 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1741 transitions. [2025-03-03 19:43:31,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:43:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1741 transitions. [2025-03-03 19:43:31,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-03 19:43:31,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:31,812 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:31,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:43:31,813 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:31,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:31,815 INFO L85 PathProgramCache]: Analyzing trace with hash -522547150, now seen corresponding path program 1 times [2025-03-03 19:43:31,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:31,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648093260] [2025-03-03 19:43:31,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:31,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:31,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-03 19:43:31,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-03 19:43:31,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:31,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:43:32,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:32,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648093260] [2025-03-03 19:43:32,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648093260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:32,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:32,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:43:32,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471148327] [2025-03-03 19:43:32,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:32,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:43:32,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:32,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:43:32,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:43:32,326 INFO L87 Difference]: Start difference. First operand 1032 states and 1741 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:43:32,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:32,444 INFO L93 Difference]: Finished difference Result 2460 states and 4151 transitions. [2025-03-03 19:43:32,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:43:32,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 499 [2025-03-03 19:43:32,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:32,455 INFO L225 Difference]: With dead ends: 2460 [2025-03-03 19:43:32,455 INFO L226 Difference]: Without dead ends: 1783 [2025-03-03 19:43:32,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:43:32,458 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 234 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:32,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 817 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:43:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2025-03-03 19:43:32,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1781. [2025-03-03 19:43:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1392 states have (on average 1.6221264367816093) internal successors, (2258), 1398 states have internal predecessors, (2258), 373 states have call successors, (373), 15 states have call predecessors, (373), 15 states have return successors, (373), 367 states have call predecessors, (373), 373 states have call successors, (373) [2025-03-03 19:43:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 3004 transitions. [2025-03-03 19:43:32,562 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 3004 transitions. Word has length 499 [2025-03-03 19:43:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:32,563 INFO L471 AbstractCegarLoop]: Abstraction has 1781 states and 3004 transitions. [2025-03-03 19:43:32,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:43:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 3004 transitions. [2025-03-03 19:43:32,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-03 19:43:32,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:32,566 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:32,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:43:32,567 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:32,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:32,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2145079933, now seen corresponding path program 1 times [2025-03-03 19:43:32,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:32,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569393363] [2025-03-03 19:43:32,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:32,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:32,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-03 19:43:32,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-03 19:43:32,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:32,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:43:34,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:34,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569393363] [2025-03-03 19:43:34,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569393363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:34,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:34,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 19:43:34,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858996565] [2025-03-03 19:43:34,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:34,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:43:34,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:34,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:43:34,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:43:34,656 INFO L87 Difference]: Start difference. First operand 1781 states and 3004 transitions. Second operand has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:43:42,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:42,027 INFO L93 Difference]: Finished difference Result 16321 states and 27566 transitions. [2025-03-03 19:43:42,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 19:43:42,028 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 500 [2025-03-03 19:43:42,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:42,093 INFO L225 Difference]: With dead ends: 16321 [2025-03-03 19:43:42,094 INFO L226 Difference]: Without dead ends: 14728 [2025-03-03 19:43:42,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=393, Invalid=1089, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 19:43:42,103 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 6253 mSDsluCounter, 4789 mSDsCounter, 0 mSdLazyCounter, 2488 mSolverCounterSat, 1717 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6253 SdHoareTripleChecker+Valid, 5482 SdHoareTripleChecker+Invalid, 4205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1717 IncrementalHoareTripleChecker+Valid, 2488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:42,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6253 Valid, 5482 Invalid, 4205 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1717 Valid, 2488 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-03 19:43:42,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14728 states. [2025-03-03 19:43:42,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14728 to 3081. [2025-03-03 19:43:42,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 2524 states have (on average 1.6311410459587956) internal successors, (4117), 2528 states have internal predecessors, (4117), 529 states have call successors, (529), 27 states have call predecessors, (529), 27 states have return successors, (529), 525 states have call predecessors, (529), 529 states have call successors, (529) [2025-03-03 19:43:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 5175 transitions. [2025-03-03 19:43:42,525 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 5175 transitions. Word has length 500 [2025-03-03 19:43:42,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:42,526 INFO L471 AbstractCegarLoop]: Abstraction has 3081 states and 5175 transitions. [2025-03-03 19:43:42,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:43:42,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 5175 transitions. [2025-03-03 19:43:42,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-03 19:43:42,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:42,529 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:42,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:43:42,530 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:42,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:42,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1140136250, now seen corresponding path program 1 times [2025-03-03 19:43:42,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:42,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58214922] [2025-03-03 19:43:42,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:42,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:42,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-03 19:43:42,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-03 19:43:42,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:42,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:43:44,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:44,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58214922] [2025-03-03 19:43:44,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58214922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:44,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:44,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 19:43:44,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902782374] [2025-03-03 19:43:44,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:44,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 19:43:44,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:44,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 19:43:44,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:43:44,149 INFO L87 Difference]: Start difference. First operand 3081 states and 5175 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:43:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:52,619 INFO L93 Difference]: Finished difference Result 25275 states and 42224 transitions. [2025-03-03 19:43:52,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 19:43:52,620 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 500 [2025-03-03 19:43:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:52,690 INFO L225 Difference]: With dead ends: 25275 [2025-03-03 19:43:52,690 INFO L226 Difference]: Without dead ends: 22793 [2025-03-03 19:43:52,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=372, Invalid=1110, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 19:43:52,701 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 5157 mSDsluCounter, 4727 mSDsCounter, 0 mSdLazyCounter, 3142 mSolverCounterSat, 1536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5157 SdHoareTripleChecker+Valid, 5652 SdHoareTripleChecker+Invalid, 4678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1536 IncrementalHoareTripleChecker+Valid, 3142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:52,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5157 Valid, 5652 Invalid, 4678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1536 Valid, 3142 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-03 19:43:52,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22793 states. [2025-03-03 19:43:53,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22793 to 5255. [2025-03-03 19:43:53,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5255 states, 4226 states have (on average 1.6097964978703265) internal successors, (6803), 4234 states have internal predecessors, (6803), 977 states have call successors, (977), 51 states have call predecessors, (977), 51 states have return successors, (977), 969 states have call predecessors, (977), 977 states have call successors, (977) [2025-03-03 19:43:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5255 states to 5255 states and 8757 transitions. [2025-03-03 19:43:53,315 INFO L78 Accepts]: Start accepts. Automaton has 5255 states and 8757 transitions. Word has length 500 [2025-03-03 19:43:53,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:53,318 INFO L471 AbstractCegarLoop]: Abstraction has 5255 states and 8757 transitions. [2025-03-03 19:43:53,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:43:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 5255 states and 8757 transitions. [2025-03-03 19:43:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-03 19:43:53,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:53,322 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:53,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:43:53,322 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:53,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:53,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1057063079, now seen corresponding path program 1 times [2025-03-03 19:43:53,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:53,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847592168] [2025-03-03 19:43:53,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:53,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:53,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-03 19:43:53,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-03 19:43:53,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:53,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 9 proven. 231 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-03 19:43:53,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:53,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847592168] [2025-03-03 19:43:53,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847592168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:43:53,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092988617] [2025-03-03 19:43:53,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:53,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:43:53,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:43:53,845 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:43:53,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:43:53,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-03 19:43:54,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-03 19:43:54,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:54,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:54,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:43:54,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:43:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 6540 proven. 126 refuted. 0 times theorem prover too weak. 6294 trivial. 0 not checked. [2025-03-03 19:43:54,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:43:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 114 proven. 126 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-03 19:43:54,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092988617] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:43:54,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:43:54,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-03 19:43:54,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143441919] [2025-03-03 19:43:54,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:43:54,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:43:54,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:54,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:43:54,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:43:54,739 INFO L87 Difference]: Start difference. First operand 5255 states and 8757 transitions. Second operand has 9 states, 9 states have (on average 21.0) internal successors, (189), 9 states have internal predecessors, (189), 3 states have call successors, (200), 2 states have call predecessors, (200), 4 states have return successors, (202), 3 states have call predecessors, (202), 3 states have call successors, (202) [2025-03-03 19:43:55,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:55,376 INFO L93 Difference]: Finished difference Result 7877 states and 13010 transitions. [2025-03-03 19:43:55,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 19:43:55,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 21.0) internal successors, (189), 9 states have internal predecessors, (189), 3 states have call successors, (200), 2 states have call predecessors, (200), 4 states have return successors, (202), 3 states have call predecessors, (202), 3 states have call successors, (202) Word has length 500 [2025-03-03 19:43:55,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:55,389 INFO L225 Difference]: With dead ends: 7877 [2025-03-03 19:43:55,389 INFO L226 Difference]: Without dead ends: 3018 [2025-03-03 19:43:55,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 999 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2025-03-03 19:43:55,397 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 366 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:55,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 870 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:43:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2025-03-03 19:43:55,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 2940. [2025-03-03 19:43:55,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2940 states, 2360 states have (on average 1.5720338983050848) internal successors, (3710), 2364 states have internal predecessors, (3710), 529 states have call successors, (529), 50 states have call predecessors, (529), 50 states have return successors, (529), 525 states have call predecessors, (529), 529 states have call successors, (529) [2025-03-03 19:43:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2940 states to 2940 states and 4768 transitions. [2025-03-03 19:43:55,674 INFO L78 Accepts]: Start accepts. Automaton has 2940 states and 4768 transitions. Word has length 500 [2025-03-03 19:43:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:55,675 INFO L471 AbstractCegarLoop]: Abstraction has 2940 states and 4768 transitions. [2025-03-03 19:43:55,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.0) internal successors, (189), 9 states have internal predecessors, (189), 3 states have call successors, (200), 2 states have call predecessors, (200), 4 states have return successors, (202), 3 states have call predecessors, (202), 3 states have call successors, (202) [2025-03-03 19:43:55,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2940 states and 4768 transitions. [2025-03-03 19:43:55,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-03-03 19:43:55,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:55,685 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:55,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 19:43:55,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 19:43:55,886 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:55,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:55,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1790086997, now seen corresponding path program 1 times [2025-03-03 19:43:55,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:55,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101461509] [2025-03-03 19:43:55,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:55,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:55,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-03-03 19:43:56,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-03-03 19:43:56,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:56,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 123 proven. 117 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-03 19:43:56,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:56,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101461509] [2025-03-03 19:43:56,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101461509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:43:56,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878183843] [2025-03-03 19:43:56,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:56,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:43:56,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:43:56,274 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:43:56,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:43:56,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-03-03 19:43:56,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-03-03 19:43:56,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:56,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:56,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 19:43:56,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:44:05,266 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification. DAG size of input: 31 DAG size of output: 26 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 19:44:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 6180 proven. 90 refuted. 0 times theorem prover too weak. 6690 trivial. 0 not checked. [2025-03-03 19:44:14,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:44:22,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878183843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:44:22,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:44:22,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 11 [2025-03-03 19:44:22,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907949209] [2025-03-03 19:44:22,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:44:22,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:44:22,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:22,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:44:22,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=202, Unknown=1, NotChecked=0, Total=272 [2025-03-03 19:44:22,925 INFO L87 Difference]: Start difference. First operand 2940 states and 4768 transitions. Second operand has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 3 states have call successors, (120), 2 states have call predecessors, (120), 3 states have return successors, (121), 3 states have call predecessors, (121), 3 states have call successors, (121) [2025-03-03 19:44:38,675 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 19:44:45,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []