./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-36.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 5db290f428815e90a4f018b6e59020b3b572c51fa983142ee856b69fd7fa99fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:07:27,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:07:27,346 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:07:27,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:07:27,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:07:27,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:07:27,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:07:27,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:07:27,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:07:27,374 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:07:27,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:07:27,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:07:27,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:07:27,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:07:27,375 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:07:27,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:07:27,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:07:27,375 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:07:27,376 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:07:27,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:07:27,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:07:27,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:07:27,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:07:27,377 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 -> 5db290f428815e90a4f018b6e59020b3b572c51fa983142ee856b69fd7fa99fb [2025-03-03 20:07:27,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:07:27,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:07:27,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:07:27,619 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:07:27,619 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:07:27,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-36.i [2025-03-03 20:07:28,777 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86a2e79a/4cdb659694f14159b2c5dee5372a3bfd/FLAGeb2b26814 [2025-03-03 20:07:29,039 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:07:29,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-36.i [2025-03-03 20:07:29,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86a2e79a/4cdb659694f14159b2c5dee5372a3bfd/FLAGeb2b26814 [2025-03-03 20:07:29,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86a2e79a/4cdb659694f14159b2c5dee5372a3bfd [2025-03-03 20:07:29,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:07:29,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:07:29,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:07:29,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:07:29,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:07:29,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:07:29" (1/1) ... [2025-03-03 20:07:29,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:29, skipping insertion in model container [2025-03-03 20:07:29,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:07:29" (1/1) ... [2025-03-03 20:07:29,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:07:29,475 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-36.i[916,929] [2025-03-03 20:07:29,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:07:29,674 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:07:29,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-36.i[916,929] [2025-03-03 20:07:29,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:07:29,786 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:07:29,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:29 WrapperNode [2025-03-03 20:07:29,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:07:29,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:07:29,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:07:29,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:07:29,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:29" (1/1) ... [2025-03-03 20:07:29,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:29" (1/1) ... [2025-03-03 20:07:29,892 INFO L138 Inliner]: procedures = 26, calls = 106, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 868 [2025-03-03 20:07:29,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:07:29,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:07:29,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:07:29,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:07:29,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:29" (1/1) ... [2025-03-03 20:07:29,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:29" (1/1) ... [2025-03-03 20:07:29,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:29" (1/1) ... [2025-03-03 20:07:29,962 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:07:29,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:29" (1/1) ... [2025-03-03 20:07:29,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:29" (1/1) ... [2025-03-03 20:07:29,994 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:29" (1/1) ... [2025-03-03 20:07:30,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:29" (1/1) ... [2025-03-03 20:07:30,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:29" (1/1) ... [2025-03-03 20:07:30,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:29" (1/1) ... [2025-03-03 20:07:30,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:07:30,038 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:07:30,038 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:07:30,038 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:07:30,039 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:29" (1/1) ... [2025-03-03 20:07:30,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:07:30,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:07:30,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:07:30,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:07:30,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:07:30,082 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:07:30,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:07:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:07:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:07:30,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:07:30,239 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:07:30,241 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:07:31,301 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-03 20:07:31,302 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:07:31,366 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:07:31,368 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 20:07:31,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:07:31 BoogieIcfgContainer [2025-03-03 20:07:31,368 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:07:31,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:07:31,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:07:31,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:07:31,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:07:29" (1/3) ... [2025-03-03 20:07:31,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d70ef83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:07:31, skipping insertion in model container [2025-03-03 20:07:31,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:29" (2/3) ... [2025-03-03 20:07:31,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d70ef83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:07:31, skipping insertion in model container [2025-03-03 20:07:31,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:07:31" (3/3) ... [2025-03-03 20:07:31,382 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-36.i [2025-03-03 20:07:31,410 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:07:31,413 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-36.i that has 2 procedures, 351 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:07:31,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:07:31,487 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;@21286209, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:07:31,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:07:31,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 351 states, 255 states have (on average 1.619607843137255) internal successors, (413), 256 states have internal predecessors, (413), 93 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 20:07:31,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-03 20:07:31,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:31,533 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:31,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:31,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:31,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1060049068, now seen corresponding path program 1 times [2025-03-03 20:07:31,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:31,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922251677] [2025-03-03 20:07:31,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:31,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:31,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-03 20:07:31,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-03 20:07:31,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:31,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 16928 trivial. 0 not checked. [2025-03-03 20:07:32,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:32,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922251677] [2025-03-03 20:07:32,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922251677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:07:32,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130415888] [2025-03-03 20:07:32,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:32,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:07:32,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:07:32,108 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:07:32,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:07:32,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-03 20:07:32,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-03 20:07:32,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:32,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:32,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 1416 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:07:32,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:07:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 16928 trivial. 0 not checked. [2025-03-03 20:07:32,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:07:32,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130415888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:32,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:07:32,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:07:32,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312829766] [2025-03-03 20:07:32,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:32,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:07:32,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:32,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:07:32,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:07:32,546 INFO L87 Difference]: Start difference. First operand has 351 states, 255 states have (on average 1.619607843137255) internal successors, (413), 256 states have internal predecessors, (413), 93 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) Second operand has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (93), 2 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 2 states have call successors, (93) [2025-03-03 20:07:32,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:32,655 INFO L93 Difference]: Finished difference Result 693 states and 1281 transitions. [2025-03-03 20:07:32,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:07:32,660 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (93), 2 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 2 states have call successors, (93) Word has length 608 [2025-03-03 20:07:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:32,670 INFO L225 Difference]: With dead ends: 693 [2025-03-03 20:07:32,670 INFO L226 Difference]: Without dead ends: 345 [2025-03-03 20:07:32,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:07:32,680 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:32,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:07:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-03 20:07:32,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-03 20:07:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 250 states have (on average 1.604) internal successors, (401), 250 states have internal predecessors, (401), 93 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 20:07:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 587 transitions. [2025-03-03 20:07:32,760 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 587 transitions. Word has length 608 [2025-03-03 20:07:32,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:32,762 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 587 transitions. [2025-03-03 20:07:32,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (93), 2 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 2 states have call successors, (93) [2025-03-03 20:07:32,763 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 587 transitions. [2025-03-03 20:07:32,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-03 20:07:32,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:32,775 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:32,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:07:32,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:07:32,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:32,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:32,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1011260203, now seen corresponding path program 1 times [2025-03-03 20:07:32,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:32,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304407472] [2025-03-03 20:07:32,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:32,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:33,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-03 20:07:33,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-03 20:07:33,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:33,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:33,671 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-03 20:07:33,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:33,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304407472] [2025-03-03 20:07:33,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304407472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:33,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:33,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:33,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216247555] [2025-03-03 20:07:33,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:33,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:33,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:33,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:33,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:33,676 INFO L87 Difference]: Start difference. First operand 345 states and 587 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-03 20:07:33,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:33,831 INFO L93 Difference]: Finished difference Result 920 states and 1575 transitions. [2025-03-03 20:07:33,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:33,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-03-03 20:07:33,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:33,838 INFO L225 Difference]: With dead ends: 920 [2025-03-03 20:07:33,838 INFO L226 Difference]: Without dead ends: 578 [2025-03-03 20:07:33,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:33,840 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 403 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:33,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1348 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:33,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-03 20:07:33,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 575. [2025-03-03 20:07:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 449 states have (on average 1.6481069042316259) internal successors, (740), 450 states have internal predecessors, (740), 123 states have call successors, (123), 2 states have call predecessors, (123), 2 states have return successors, (123), 122 states have call predecessors, (123), 123 states have call successors, (123) [2025-03-03 20:07:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 986 transitions. [2025-03-03 20:07:33,915 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 986 transitions. Word has length 608 [2025-03-03 20:07:33,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:33,917 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 986 transitions. [2025-03-03 20:07:33,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-03 20:07:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 986 transitions. [2025-03-03 20:07:33,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-03 20:07:33,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:33,928 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:33,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:07:33,928 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:33,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:33,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1131380076, now seen corresponding path program 1 times [2025-03-03 20:07:33,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:33,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046213849] [2025-03-03 20:07:33,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:33,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:33,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-03 20:07:34,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-03 20:07:34,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:34,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-03 20:07:34,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:34,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046213849] [2025-03-03 20:07:34,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046213849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:34,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:34,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:34,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952924665] [2025-03-03 20:07:34,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:34,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:34,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:34,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:34,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:34,276 INFO L87 Difference]: Start difference. First operand 575 states and 986 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-03 20:07:34,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:34,399 INFO L93 Difference]: Finished difference Result 1601 states and 2756 transitions. [2025-03-03 20:07:34,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:34,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-03-03 20:07:34,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:34,412 INFO L225 Difference]: With dead ends: 1601 [2025-03-03 20:07:34,412 INFO L226 Difference]: Without dead ends: 1029 [2025-03-03 20:07:34,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:34,416 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 380 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:34,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1092 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:34,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-03-03 20:07:34,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1025. [2025-03-03 20:07:34,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 849 states have (on average 1.6772673733804475) internal successors, (1424), 852 states have internal predecessors, (1424), 171 states have call successors, (171), 4 states have call predecessors, (171), 4 states have return successors, (171), 168 states have call predecessors, (171), 171 states have call successors, (171) [2025-03-03 20:07:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1766 transitions. [2025-03-03 20:07:34,473 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1766 transitions. Word has length 608 [2025-03-03 20:07:34,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:34,474 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1766 transitions. [2025-03-03 20:07:34,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-03 20:07:34,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1766 transitions. [2025-03-03 20:07:34,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-03 20:07:34,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:34,483 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:34,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:07:34,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:34,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:34,484 INFO L85 PathProgramCache]: Analyzing trace with hash -676467445, now seen corresponding path program 1 times [2025-03-03 20:07:34,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:34,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903298438] [2025-03-03 20:07:34,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:34,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:34,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-03 20:07:34,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-03 20:07:34,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:34,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-03 20:07:34,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:34,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903298438] [2025-03-03 20:07:34,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903298438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:34,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:34,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:34,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080090503] [2025-03-03 20:07:34,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:34,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:34,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:34,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:34,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:34,706 INFO L87 Difference]: Start difference. First operand 1025 states and 1766 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-03 20:07:34,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:34,829 INFO L93 Difference]: Finished difference Result 2690 states and 4621 transitions. [2025-03-03 20:07:34,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:34,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-03-03 20:07:34,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:34,840 INFO L225 Difference]: With dead ends: 2690 [2025-03-03 20:07:34,840 INFO L226 Difference]: Without dead ends: 1668 [2025-03-03 20:07:34,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:34,845 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 313 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:34,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1239 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:34,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2025-03-03 20:07:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1665. [2025-03-03 20:07:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1365 states have (on average 1.6600732600732602) internal successors, (2266), 1372 states have internal predecessors, (2266), 291 states have call successors, (291), 8 states have call predecessors, (291), 8 states have return successors, (291), 284 states have call predecessors, (291), 291 states have call successors, (291) [2025-03-03 20:07:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2848 transitions. [2025-03-03 20:07:34,934 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2848 transitions. Word has length 608 [2025-03-03 20:07:34,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:34,935 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2848 transitions. [2025-03-03 20:07:34,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-03 20:07:34,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2848 transitions. [2025-03-03 20:07:34,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-03 20:07:34,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:34,940 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:34,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:07:34,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:34,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:34,941 INFO L85 PathProgramCache]: Analyzing trace with hash 92702570, now seen corresponding path program 1 times [2025-03-03 20:07:34,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:34,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438289625] [2025-03-03 20:07:34,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:34,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:34,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-03 20:07:34,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-03 20:07:34,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:34,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-03 20:07:35,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:35,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438289625] [2025-03-03 20:07:35,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438289625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:35,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:35,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:35,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616216193] [2025-03-03 20:07:35,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:35,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:35,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:35,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:35,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:35,152 INFO L87 Difference]: Start difference. First operand 1665 states and 2848 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-03 20:07:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:35,316 INFO L93 Difference]: Finished difference Result 4833 states and 8274 transitions. [2025-03-03 20:07:35,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:35,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-03-03 20:07:35,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:35,334 INFO L225 Difference]: With dead ends: 4833 [2025-03-03 20:07:35,335 INFO L226 Difference]: Without dead ends: 3171 [2025-03-03 20:07:35,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:35,342 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 370 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:35,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1215 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:35,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2025-03-03 20:07:35,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3167. [2025-03-03 20:07:35,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 2627 states have (on average 1.6627331556909022) internal successors, (4368), 2642 states have internal predecessors, (4368), 523 states have call successors, (523), 16 states have call predecessors, (523), 16 states have return successors, (523), 508 states have call predecessors, (523), 523 states have call successors, (523) [2025-03-03 20:07:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 5414 transitions. [2025-03-03 20:07:35,528 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 5414 transitions. Word has length 608 [2025-03-03 20:07:35,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:35,530 INFO L471 AbstractCegarLoop]: Abstraction has 3167 states and 5414 transitions. [2025-03-03 20:07:35,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-03 20:07:35,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 5414 transitions. [2025-03-03 20:07:35,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-03 20:07:35,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:35,539 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:35,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:07:35,539 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:35,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:35,541 INFO L85 PathProgramCache]: Analyzing trace with hash -291084597, now seen corresponding path program 1 times [2025-03-03 20:07:35,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:35,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198883719] [2025-03-03 20:07:35,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:35,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:35,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-03 20:07:35,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-03 20:07:35,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:35,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-03 20:07:35,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:35,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198883719] [2025-03-03 20:07:35,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198883719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:35,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:35,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:35,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279743612] [2025-03-03 20:07:35,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:35,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:35,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:35,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:35,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:35,774 INFO L87 Difference]: Start difference. First operand 3167 states and 5414 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-03 20:07:36,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:36,041 INFO L93 Difference]: Finished difference Result 9415 states and 16100 transitions. [2025-03-03 20:07:36,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:36,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-03-03 20:07:36,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:36,071 INFO L225 Difference]: With dead ends: 9415 [2025-03-03 20:07:36,072 INFO L226 Difference]: Without dead ends: 6251 [2025-03-03 20:07:36,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:36,081 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 561 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:36,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1114 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:36,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2025-03-03 20:07:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 6249. [2025-03-03 20:07:36,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6249 states, 5170 states have (on average 1.6502901353965185) internal successors, (8532), 5200 states have internal predecessors, (8532), 1046 states have call successors, (1046), 32 states have call predecessors, (1046), 32 states have return successors, (1046), 1016 states have call predecessors, (1046), 1046 states have call successors, (1046) [2025-03-03 20:07:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6249 states to 6249 states and 10624 transitions. [2025-03-03 20:07:36,385 INFO L78 Accepts]: Start accepts. Automaton has 6249 states and 10624 transitions. Word has length 608 [2025-03-03 20:07:36,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:36,386 INFO L471 AbstractCegarLoop]: Abstraction has 6249 states and 10624 transitions. [2025-03-03 20:07:36,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-03 20:07:36,386 INFO L276 IsEmpty]: Start isEmpty. Operand 6249 states and 10624 transitions. [2025-03-03 20:07:36,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-03 20:07:36,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:36,396 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:36,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:07:36,396 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:36,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:36,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1434533622, now seen corresponding path program 1 times [2025-03-03 20:07:36,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:36,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584611634] [2025-03-03 20:07:36,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:36,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:36,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-03 20:07:36,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-03 20:07:36,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:36,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-03 20:07:36,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:36,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584611634] [2025-03-03 20:07:36,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584611634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:36,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:36,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:36,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22171266] [2025-03-03 20:07:36,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:36,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:36,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:36,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:36,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:36,581 INFO L87 Difference]: Start difference. First operand 6249 states and 10624 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-03 20:07:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:36,834 INFO L93 Difference]: Finished difference Result 12507 states and 21254 transitions. [2025-03-03 20:07:36,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:36,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-03-03 20:07:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:36,865 INFO L225 Difference]: With dead ends: 12507 [2025-03-03 20:07:36,865 INFO L226 Difference]: Without dead ends: 6261 [2025-03-03 20:07:36,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:36,878 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 270 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:36,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1230 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:36,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6261 states. [2025-03-03 20:07:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6261 to 5005. [2025-03-03 20:07:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5005 states, 4412 states have (on average 1.6858567543064369) internal successors, (7438), 4426 states have internal predecessors, (7438), 574 states have call successors, (574), 18 states have call predecessors, (574), 18 states have return successors, (574), 560 states have call predecessors, (574), 574 states have call successors, (574) [2025-03-03 20:07:37,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5005 states to 5005 states and 8586 transitions. [2025-03-03 20:07:37,106 INFO L78 Accepts]: Start accepts. Automaton has 5005 states and 8586 transitions. Word has length 608 [2025-03-03 20:07:37,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:37,107 INFO L471 AbstractCegarLoop]: Abstraction has 5005 states and 8586 transitions. [2025-03-03 20:07:37,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-03 20:07:37,112 INFO L276 IsEmpty]: Start isEmpty. Operand 5005 states and 8586 transitions. [2025-03-03 20:07:37,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-03 20:07:37,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:37,123 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:37,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:07:37,123 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:37,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:37,124 INFO L85 PathProgramCache]: Analyzing trace with hash -81223925, now seen corresponding path program 1 times [2025-03-03 20:07:37,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:37,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879658580] [2025-03-03 20:07:37,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:37,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:37,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-03 20:07:37,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-03 20:07:37,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:37,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-03 20:07:37,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:37,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879658580] [2025-03-03 20:07:37,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879658580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:37,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:37,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:07:37,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704610785] [2025-03-03 20:07:37,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:37,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:07:37,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:37,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:07:37,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:07:37,676 INFO L87 Difference]: Start difference. First operand 5005 states and 8586 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-03 20:07:39,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:39,555 INFO L93 Difference]: Finished difference Result 27825 states and 47606 transitions. [2025-03-03 20:07:39,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:07:39,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-03-03 20:07:39,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:39,626 INFO L225 Difference]: With dead ends: 27825 [2025-03-03 20:07:39,626 INFO L226 Difference]: Without dead ends: 22823 [2025-03-03 20:07:39,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:07:39,642 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 2460 mSDsluCounter, 1836 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2460 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:39,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2460 Valid, 2679 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 20:07:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22823 states. [2025-03-03 20:07:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22823 to 18560. [2025-03-03 20:07:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18560 states, 16530 states have (on average 1.6834845735027224) internal successors, (27828), 16593 states have internal predecessors, (27828), 1940 states have call successors, (1940), 89 states have call predecessors, (1940), 89 states have return successors, (1940), 1877 states have call predecessors, (1940), 1940 states have call successors, (1940) [2025-03-03 20:07:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18560 states to 18560 states and 31708 transitions. [2025-03-03 20:07:40,391 INFO L78 Accepts]: Start accepts. Automaton has 18560 states and 31708 transitions. Word has length 608 [2025-03-03 20:07:40,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:40,392 INFO L471 AbstractCegarLoop]: Abstraction has 18560 states and 31708 transitions. [2025-03-03 20:07:40,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-03 20:07:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 18560 states and 31708 transitions. [2025-03-03 20:07:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-03 20:07:40,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:40,418 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:40,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:07:40,419 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:40,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:40,420 INFO L85 PathProgramCache]: Analyzing trace with hash -689300788, now seen corresponding path program 1 times [2025-03-03 20:07:40,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:40,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528362058] [2025-03-03 20:07:40,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:40,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:40,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-03 20:07:40,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-03 20:07:40,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:40,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-03 20:07:40,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:40,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528362058] [2025-03-03 20:07:40,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528362058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:40,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:40,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:07:40,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85399827] [2025-03-03 20:07:40,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:40,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:07:40,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:40,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:07:40,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:40,806 INFO L87 Difference]: Start difference. First operand 18560 states and 31708 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-03 20:07:41,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:41,977 INFO L93 Difference]: Finished difference Result 50315 states and 86010 transitions. [2025-03-03 20:07:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:07:41,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-03-03 20:07:41,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:42,071 INFO L225 Difference]: With dead ends: 50315 [2025-03-03 20:07:42,072 INFO L226 Difference]: Without dead ends: 31805 [2025-03-03 20:07:42,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:42,114 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 775 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:42,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 2138 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:07:42,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31805 states. [2025-03-03 20:07:42,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31805 to 23035. [2025-03-03 20:07:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23035 states, 20497 states have (on average 1.6803922525247597) internal successors, (34443), 20576 states have internal predecessors, (34443), 2422 states have call successors, (2422), 115 states have call predecessors, (2422), 115 states have return successors, (2422), 2343 states have call predecessors, (2422), 2422 states have call successors, (2422) [2025-03-03 20:07:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23035 states to 23035 states and 39287 transitions. [2025-03-03 20:07:43,061 INFO L78 Accepts]: Start accepts. Automaton has 23035 states and 39287 transitions. Word has length 608 [2025-03-03 20:07:43,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:43,062 INFO L471 AbstractCegarLoop]: Abstraction has 23035 states and 39287 transitions. [2025-03-03 20:07:43,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-03 20:07:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 23035 states and 39287 transitions. [2025-03-03 20:07:43,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-03 20:07:43,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:43,103 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:43,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:07:43,103 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:43,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1751737494, now seen corresponding path program 1 times [2025-03-03 20:07:43,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:43,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662282934] [2025-03-03 20:07:43,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:43,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:43,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-03 20:07:43,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-03 20:07:43,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:43,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-03 20:07:43,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:43,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662282934] [2025-03-03 20:07:43,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662282934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:43,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:43,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:07:43,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811122850] [2025-03-03 20:07:43,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:43,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:07:43,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:43,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:07:43,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:43,715 INFO L87 Difference]: Start difference. First operand 23035 states and 39287 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-03 20:07:46,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:46,742 INFO L93 Difference]: Finished difference Result 101949 states and 173935 transitions. [2025-03-03 20:07:46,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:07:46,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-03-03 20:07:46,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:46,955 INFO L225 Difference]: With dead ends: 101949 [2025-03-03 20:07:46,955 INFO L226 Difference]: Without dead ends: 78987 [2025-03-03 20:07:46,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:46,998 INFO L435 NwaCegarLoop]: 1054 mSDtfsCounter, 1751 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 2441 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:46,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1751 Valid, 2441 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:07:47,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78987 states. [2025-03-03 20:07:48,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78987 to 55631. [2025-03-03 20:07:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55631 states, 50595 states have (on average 1.6946931514971835) internal successors, (85743), 50752 states have internal predecessors, (85743), 4808 states have call successors, (4808), 227 states have call predecessors, (4808), 227 states have return successors, (4808), 4651 states have call predecessors, (4808), 4808 states have call successors, (4808) [2025-03-03 20:07:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55631 states to 55631 states and 95359 transitions. [2025-03-03 20:07:48,963 INFO L78 Accepts]: Start accepts. Automaton has 55631 states and 95359 transitions. Word has length 608 [2025-03-03 20:07:48,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:48,965 INFO L471 AbstractCegarLoop]: Abstraction has 55631 states and 95359 transitions. [2025-03-03 20:07:48,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-03 20:07:48,965 INFO L276 IsEmpty]: Start isEmpty. Operand 55631 states and 95359 transitions. [2025-03-03 20:07:49,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-03 20:07:49,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:49,026 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:49,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:07:49,027 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:49,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:49,028 INFO L85 PathProgramCache]: Analyzing trace with hash 160381703, now seen corresponding path program 1 times [2025-03-03 20:07:49,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:49,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128839318] [2025-03-03 20:07:49,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:49,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:49,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-03 20:07:49,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-03 20:07:49,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:49,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-03 20:07:49,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:49,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128839318] [2025-03-03 20:07:49,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128839318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:49,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:49,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:07:49,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312954701] [2025-03-03 20:07:49,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:49,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:07:49,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:49,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:07:49,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:07:49,943 INFO L87 Difference]: Start difference. First operand 55631 states and 95359 transitions. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 3 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 3 states have call predecessors, (93), 3 states have call successors, (93) [2025-03-03 20:07:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:58,202 INFO L93 Difference]: Finished difference Result 255409 states and 436449 transitions. [2025-03-03 20:07:58,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 20:07:58,202 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 3 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 3 states have call predecessors, (93), 3 states have call successors, (93) Word has length 608 [2025-03-03 20:07:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:58,814 INFO L225 Difference]: With dead ends: 255409 [2025-03-03 20:07:58,815 INFO L226 Difference]: Without dead ends: 199851 [2025-03-03 20:07:58,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2025-03-03 20:07:58,931 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 5519 mSDsluCounter, 3823 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 996 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5519 SdHoareTripleChecker+Valid, 4820 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 996 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:58,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5519 Valid, 4820 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [996 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 20:07:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199851 states. [2025-03-03 20:08:05,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199851 to 158033. [2025-03-03 20:08:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158033 states, 143350 states have (on average 1.686041158004883) internal successors, (241694), 143827 states have internal predecessors, (241694), 13984 states have call successors, (13984), 698 states have call predecessors, (13984), 698 states have return successors, (13984), 13507 states have call predecessors, (13984), 13984 states have call successors, (13984) [2025-03-03 20:08:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158033 states to 158033 states and 269662 transitions. [2025-03-03 20:08:05,835 INFO L78 Accepts]: Start accepts. Automaton has 158033 states and 269662 transitions. Word has length 608 [2025-03-03 20:08:05,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:05,835 INFO L471 AbstractCegarLoop]: Abstraction has 158033 states and 269662 transitions. [2025-03-03 20:08:05,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 3 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 3 states have call predecessors, (93), 3 states have call successors, (93) [2025-03-03 20:08:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 158033 states and 269662 transitions. [2025-03-03 20:08:05,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-03 20:08:05,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:05,974 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:05,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:08:05,975 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:05,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:05,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2014298394, now seen corresponding path program 1 times [2025-03-03 20:08:05,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:05,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034697261] [2025-03-03 20:08:05,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:05,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:06,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-03 20:08:06,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-03 20:08:06,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:06,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-03 20:08:06,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:06,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034697261] [2025-03-03 20:08:06,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034697261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:06,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:06,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:08:06,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132859793] [2025-03-03 20:08:06,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:06,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:08:06,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:06,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:08:06,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:08:06,818 INFO L87 Difference]: Start difference. First operand 158033 states and 269662 transitions. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 2 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 2 states have call predecessors, (93), 2 states have call successors, (93)