./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-8.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-8.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 3a780e8c08e2ad68e979e131bc4f4540ca41356fe45ef323c559a838b7c9745a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:11:29,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:11:29,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:11:29,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:11:29,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:11:29,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:11:29,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:11:29,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:11:29,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:11:29,942 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:11:29,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:11:29,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:11:29,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:11:29,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:11:29,943 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:11:29,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:11:29,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:11:29,943 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:11:29,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:11:29,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:11:29,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:11:29,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:11:29,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:11:29,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:11:29,943 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:11:29,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:11:29,943 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:11:29,943 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:11:29,943 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:11:29,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:11:29,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:11:29,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:11:29,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:11:29,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:11:29,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:11:29,944 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:11:29,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:11:29,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:11:29,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:11:29,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:11:29,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:11:29,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:11:29,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:11:29,945 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 -> 3a780e8c08e2ad68e979e131bc4f4540ca41356fe45ef323c559a838b7c9745a [2025-03-03 20:11:30,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:11:30,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:11:30,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:11:30,176 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:11:30,177 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:11:30,178 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-8.i [2025-03-03 20:11:31,323 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b382eb0/b3e9bd5bff934929bd7109245608dc97/FLAG1b8e49b88 [2025-03-03 20:11:31,595 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:11:31,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-8.i [2025-03-03 20:11:31,611 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b382eb0/b3e9bd5bff934929bd7109245608dc97/FLAG1b8e49b88 [2025-03-03 20:11:31,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b382eb0/b3e9bd5bff934929bd7109245608dc97 [2025-03-03 20:11:31,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:11:31,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:11:31,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:11:31,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:11:31,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:11:31,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:11:31" (1/1) ... [2025-03-03 20:11:31,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dfdcf82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:31, skipping insertion in model container [2025-03-03 20:11:31,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:11:31" (1/1) ... [2025-03-03 20:11:31,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:11:31,762 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-8.i[915,928] [2025-03-03 20:11:31,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:11:31,899 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:11:31,906 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-8.i[915,928] [2025-03-03 20:11:31,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:11:31,988 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:11:31,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:31 WrapperNode [2025-03-03 20:11:31,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:11:31,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:11:31,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:11:31,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:11:31,994 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:11:31" (1/1) ... [2025-03-03 20:11:32,012 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:11:31" (1/1) ... [2025-03-03 20:11:32,077 INFO L138 Inliner]: procedures = 26, calls = 147, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 937 [2025-03-03 20:11:32,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:11:32,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:11:32,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:11:32,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:11:32,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:31" (1/1) ... [2025-03-03 20:11:32,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:31" (1/1) ... [2025-03-03 20:11:32,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:31" (1/1) ... [2025-03-03 20:11:32,138 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:11:32,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:31" (1/1) ... [2025-03-03 20:11:32,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:31" (1/1) ... [2025-03-03 20:11:32,169 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:31" (1/1) ... [2025-03-03 20:11:32,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:31" (1/1) ... [2025-03-03 20:11:32,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:31" (1/1) ... [2025-03-03 20:11:32,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:31" (1/1) ... [2025-03-03 20:11:32,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:11:32,203 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:11:32,203 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:11:32,203 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:11:32,204 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:31" (1/1) ... [2025-03-03 20:11:32,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:11:32,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:11:32,229 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:11:32,234 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:11:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:11:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:11:32,250 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:11:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:11:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:11:32,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:11:32,365 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:11:32,367 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:11:33,447 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-03 20:11:33,447 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:11:33,484 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:11:33,487 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:11:33,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:11:33 BoogieIcfgContainer [2025-03-03 20:11:33,488 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:11:33,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:11:33,490 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:11:33,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:11:33,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:11:31" (1/3) ... [2025-03-03 20:11:33,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a95a5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:11:33, skipping insertion in model container [2025-03-03 20:11:33,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:11:31" (2/3) ... [2025-03-03 20:11:33,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a95a5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:11:33, skipping insertion in model container [2025-03-03 20:11:33,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:11:33" (3/3) ... [2025-03-03 20:11:33,495 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-8.i [2025-03-03 20:11:33,506 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:11:33,510 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-8.i that has 2 procedures, 395 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:11:33,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:11:33,570 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;@107b765b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:11:33,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:11:33,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 395 states, 258 states have (on average 1.5891472868217054) internal successors, (410), 259 states have internal predecessors, (410), 134 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-03 20:11:33,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 833 [2025-03-03 20:11:33,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:33,612 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:33,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:33,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:33,616 INFO L85 PathProgramCache]: Analyzing trace with hash -990423976, now seen corresponding path program 1 times [2025-03-03 20:11:33,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:33,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558042541] [2025-03-03 20:11:33,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:33,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:33,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 832 statements into 1 equivalence classes. [2025-03-03 20:11:33,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 832 of 832 statements. [2025-03-03 20:11:33,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:33,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 266 refuted. 0 times theorem prover too weak. 35378 trivial. 0 not checked. [2025-03-03 20:11:34,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:34,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558042541] [2025-03-03 20:11:34,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558042541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:11:34,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626450588] [2025-03-03 20:11:34,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:34,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:11:34,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:11:34,298 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:11:34,300 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:11:34,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 832 statements into 1 equivalence classes. [2025-03-03 20:11:34,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 832 of 832 statements. [2025-03-03 20:11:34,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:34,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:34,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 1851 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:11:34,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:11:34,746 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 35378 trivial. 0 not checked. [2025-03-03 20:11:34,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:11:34,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626450588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:34,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:11:34,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:11:34,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206678166] [2025-03-03 20:11:34,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:34,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:11:34,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:34,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:11:34,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:11:34,771 INFO L87 Difference]: Start difference. First operand has 395 states, 258 states have (on average 1.5891472868217054) internal successors, (410), 259 states have internal predecessors, (410), 134 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) Second operand has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (134), 2 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 2 states have call successors, (134) [2025-03-03 20:11:34,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:34,848 INFO L93 Difference]: Finished difference Result 784 states and 1485 transitions. [2025-03-03 20:11:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:11:34,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (134), 2 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 2 states have call successors, (134) Word has length 832 [2025-03-03 20:11:34,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:34,857 INFO L225 Difference]: With dead ends: 784 [2025-03-03 20:11:34,857 INFO L226 Difference]: Without dead ends: 392 [2025-03-03 20:11:34,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 833 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:11:34,867 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:34,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:11:34,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-03 20:11:34,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-03 20:11:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 256 states have (on average 1.56640625) internal successors, (401), 256 states have internal predecessors, (401), 134 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-03 20:11:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 669 transitions. [2025-03-03 20:11:34,956 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 669 transitions. Word has length 832 [2025-03-03 20:11:34,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:34,958 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 669 transitions. [2025-03-03 20:11:34,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (134), 2 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 2 states have call successors, (134) [2025-03-03 20:11:34,958 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 669 transitions. [2025-03-03 20:11:34,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2025-03-03 20:11:34,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:34,984 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:34,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:11:35,184 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:11:35,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:35,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:35,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1561152184, now seen corresponding path program 1 times [2025-03-03 20:11:35,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:35,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433447478] [2025-03-03 20:11:35,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:35,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:35,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 833 statements into 1 equivalence classes. [2025-03-03 20:11:35,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 833 of 833 statements. [2025-03-03 20:11:35,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:35,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-03-03 20:11:35,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:35,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433447478] [2025-03-03 20:11:35,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433447478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:35,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:35,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:35,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644607632] [2025-03-03 20:11:35,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:35,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:35,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:35,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:35,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:35,949 INFO L87 Difference]: Start difference. First operand 392 states and 669 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-03 20:11:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:36,062 INFO L93 Difference]: Finished difference Result 1001 states and 1721 transitions. [2025-03-03 20:11:36,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:36,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) Word has length 833 [2025-03-03 20:11:36,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:36,071 INFO L225 Difference]: With dead ends: 1001 [2025-03-03 20:11:36,072 INFO L226 Difference]: Without dead ends: 612 [2025-03-03 20:11:36,074 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:11:36,074 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 333 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:36,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1349 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:36,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-03-03 20:11:36,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 609. [2025-03-03 20:11:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 443 states have (on average 1.6320541760722347) internal successors, (723), 444 states have internal predecessors, (723), 163 states have call successors, (163), 2 states have call predecessors, (163), 2 states have return successors, (163), 162 states have call predecessors, (163), 163 states have call successors, (163) [2025-03-03 20:11:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1049 transitions. [2025-03-03 20:11:36,133 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1049 transitions. Word has length 833 [2025-03-03 20:11:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:36,135 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 1049 transitions. [2025-03-03 20:11:36,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-03 20:11:36,136 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1049 transitions. [2025-03-03 20:11:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2025-03-03 20:11:36,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:36,144 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:36,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:11:36,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:36,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:36,145 INFO L85 PathProgramCache]: Analyzing trace with hash -353234009, now seen corresponding path program 1 times [2025-03-03 20:11:36,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:36,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764526897] [2025-03-03 20:11:36,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:36,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:36,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 833 statements into 1 equivalence classes. [2025-03-03 20:11:36,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 833 of 833 statements. [2025-03-03 20:11:36,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:36,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:36,635 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-03-03 20:11:36,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:36,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764526897] [2025-03-03 20:11:36,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764526897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:36,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:36,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:11:36,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558429025] [2025-03-03 20:11:36,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:36,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:11:36,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:36,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:11:36,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:36,641 INFO L87 Difference]: Start difference. First operand 609 states and 1049 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-03 20:11:36,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:36,816 INFO L93 Difference]: Finished difference Result 1815 states and 3129 transitions. [2025-03-03 20:11:36,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:11:36,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) Word has length 833 [2025-03-03 20:11:36,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:36,828 INFO L225 Difference]: With dead ends: 1815 [2025-03-03 20:11:36,828 INFO L226 Difference]: Without dead ends: 1209 [2025-03-03 20:11:36,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:11:36,831 INFO L435 NwaCegarLoop]: 1053 mSDtfsCounter, 620 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 2739 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:36,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 2739 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2025-03-03 20:11:36,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1205. [2025-03-03 20:11:36,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 874 states have (on average 1.6178489702517163) internal successors, (1414), 876 states have internal predecessors, (1414), 326 states have call successors, (326), 4 states have call predecessors, (326), 4 states have return successors, (326), 324 states have call predecessors, (326), 326 states have call successors, (326) [2025-03-03 20:11:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 2066 transitions. [2025-03-03 20:11:36,972 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 2066 transitions. Word has length 833 [2025-03-03 20:11:36,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:36,974 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 2066 transitions. [2025-03-03 20:11:36,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-03 20:11:36,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 2066 transitions. [2025-03-03 20:11:36,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2025-03-03 20:11:36,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:36,981 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:36,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:11:36,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:36,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:36,982 INFO L85 PathProgramCache]: Analyzing trace with hash -482857113, now seen corresponding path program 1 times [2025-03-03 20:11:36,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:36,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509928049] [2025-03-03 20:11:36,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:36,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:37,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 835 statements into 1 equivalence classes. [2025-03-03 20:11:37,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 835 of 835 statements. [2025-03-03 20:11:37,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:37,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-03-03 20:11:37,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:37,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509928049] [2025-03-03 20:11:37,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509928049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:37,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:37,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:11:37,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489900596] [2025-03-03 20:11:37,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:37,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:11:37,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:37,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:11:37,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:11:37,423 INFO L87 Difference]: Start difference. First operand 1205 states and 2066 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 2 states have call predecessors, (134), 2 states have call successors, (134) [2025-03-03 20:11:38,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:38,188 INFO L93 Difference]: Finished difference Result 4399 states and 7553 transitions. [2025-03-03 20:11:38,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:11:38,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 2 states have call predecessors, (134), 2 states have call successors, (134) Word has length 835 [2025-03-03 20:11:38,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:38,209 INFO L225 Difference]: With dead ends: 4399 [2025-03-03 20:11:38,210 INFO L226 Difference]: Without dead ends: 3197 [2025-03-03 20:11:38,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:11:38,215 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 1686 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1686 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:38,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1686 Valid, 1903 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:11:38,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2025-03-03 20:11:38,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 3191. [2025-03-03 20:11:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3191 states, 2398 states have (on average 1.633861551292744) internal successors, (3918), 2406 states have internal predecessors, (3918), 780 states have call successors, (780), 12 states have call predecessors, (780), 12 states have return successors, (780), 772 states have call predecessors, (780), 780 states have call successors, (780) [2025-03-03 20:11:38,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 5478 transitions. [2025-03-03 20:11:38,464 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 5478 transitions. Word has length 835 [2025-03-03 20:11:38,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:38,465 INFO L471 AbstractCegarLoop]: Abstraction has 3191 states and 5478 transitions. [2025-03-03 20:11:38,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 2 states have call predecessors, (134), 2 states have call successors, (134) [2025-03-03 20:11:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 5478 transitions. [2025-03-03 20:11:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2025-03-03 20:11:38,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:38,477 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:38,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:11:38,477 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:38,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:38,478 INFO L85 PathProgramCache]: Analyzing trace with hash 392780515, now seen corresponding path program 1 times [2025-03-03 20:11:38,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:38,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63496372] [2025-03-03 20:11:38,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:38,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:38,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 835 statements into 1 equivalence classes. [2025-03-03 20:11:38,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 835 of 835 statements. [2025-03-03 20:11:38,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:38,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-03-03 20:11:38,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:38,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63496372] [2025-03-03 20:11:38,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63496372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:38,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:38,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:38,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340233065] [2025-03-03 20:11:38,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:38,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:38,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:38,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:38,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:38,727 INFO L87 Difference]: Start difference. First operand 3191 states and 5478 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-03 20:11:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:38,910 INFO L93 Difference]: Finished difference Result 6461 states and 11108 transitions. [2025-03-03 20:11:38,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:38,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) Word has length 835 [2025-03-03 20:11:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:38,929 INFO L225 Difference]: With dead ends: 6461 [2025-03-03 20:11:38,929 INFO L226 Difference]: Without dead ends: 3273 [2025-03-03 20:11:38,937 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:11:38,938 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 614 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:38,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1469 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:38,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2025-03-03 20:11:39,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 3267. [2025-03-03 20:11:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3267 states, 2474 states have (on average 1.6329830234438156) internal successors, (4040), 2482 states have internal predecessors, (4040), 780 states have call successors, (780), 12 states have call predecessors, (780), 12 states have return successors, (780), 772 states have call predecessors, (780), 780 states have call successors, (780) [2025-03-03 20:11:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3267 states to 3267 states and 5600 transitions. [2025-03-03 20:11:39,132 INFO L78 Accepts]: Start accepts. Automaton has 3267 states and 5600 transitions. Word has length 835 [2025-03-03 20:11:39,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:39,133 INFO L471 AbstractCegarLoop]: Abstraction has 3267 states and 5600 transitions. [2025-03-03 20:11:39,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-03 20:11:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3267 states and 5600 transitions. [2025-03-03 20:11:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2025-03-03 20:11:39,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:39,163 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:39,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:11:39,163 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:39,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:39,163 INFO L85 PathProgramCache]: Analyzing trace with hash 361760708, now seen corresponding path program 1 times [2025-03-03 20:11:39,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:39,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809984948] [2025-03-03 20:11:39,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:39,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:39,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 835 statements into 1 equivalence classes. [2025-03-03 20:11:39,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 835 of 835 statements. [2025-03-03 20:11:39,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:39,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-03-03 20:11:39,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:39,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809984948] [2025-03-03 20:11:39,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809984948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:39,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:39,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:11:39,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333340245] [2025-03-03 20:11:39,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:39,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:11:39,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:39,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:11:39,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:11:39,743 INFO L87 Difference]: Start difference. First operand 3267 states and 5600 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-03 20:11:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:40,429 INFO L93 Difference]: Finished difference Result 9807 states and 16818 transitions. [2025-03-03 20:11:40,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:11:40,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) Word has length 835 [2025-03-03 20:11:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:40,466 INFO L225 Difference]: With dead ends: 9807 [2025-03-03 20:11:40,467 INFO L226 Difference]: Without dead ends: 6543 [2025-03-03 20:11:40,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:11:40,479 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 437 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 2106 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:40,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 2106 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:11:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6543 states. [2025-03-03 20:11:40,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6543 to 6523. [2025-03-03 20:11:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6523 states, 4938 states have (on average 1.6281895504252735) internal successors, (8040), 4954 states have internal predecessors, (8040), 1560 states have call successors, (1560), 24 states have call predecessors, (1560), 24 states have return successors, (1560), 1544 states have call predecessors, (1560), 1560 states have call successors, (1560) [2025-03-03 20:11:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6523 states to 6523 states and 11160 transitions. [2025-03-03 20:11:40,957 INFO L78 Accepts]: Start accepts. Automaton has 6523 states and 11160 transitions. Word has length 835 [2025-03-03 20:11:40,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:40,958 INFO L471 AbstractCegarLoop]: Abstraction has 6523 states and 11160 transitions. [2025-03-03 20:11:40,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-03 20:11:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 6523 states and 11160 transitions. [2025-03-03 20:11:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2025-03-03 20:11:40,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:40,971 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:40,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:11:40,971 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:40,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:40,972 INFO L85 PathProgramCache]: Analyzing trace with hash 623723515, now seen corresponding path program 1 times [2025-03-03 20:11:40,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:40,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771607762] [2025-03-03 20:11:40,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:40,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:41,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 836 statements into 1 equivalence classes. [2025-03-03 20:11:41,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 836 of 836 statements. [2025-03-03 20:11:41,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:41,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:44,619 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-03-03 20:11:44,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:44,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771607762] [2025-03-03 20:11:44,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771607762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:44,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:44,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:11:44,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647713176] [2025-03-03 20:11:44,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:44,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:11:44,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:44,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:11:44,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:11:44,624 INFO L87 Difference]: Start difference. First operand 6523 states and 11160 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-03 20:11:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:47,533 INFO L93 Difference]: Finished difference Result 38067 states and 65230 transitions. [2025-03-03 20:11:47,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 20:11:47,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) Word has length 836 [2025-03-03 20:11:47,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:47,668 INFO L225 Difference]: With dead ends: 38067 [2025-03-03 20:11:47,668 INFO L226 Difference]: Without dead ends: 31547 [2025-03-03 20:11:47,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:11:47,697 INFO L435 NwaCegarLoop]: 1065 mSDtfsCounter, 2934 mSDsluCounter, 2622 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2934 SdHoareTripleChecker+Valid, 3687 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:47,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2934 Valid, 3687 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 20:11:47,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31547 states. [2025-03-03 20:11:49,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31547 to 27165. [2025-03-03 20:11:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27165 states, 21428 states have (on average 1.6484972932611537) internal successors, (35324), 21532 states have internal predecessors, (35324), 5616 states have call successors, (5616), 120 states have call predecessors, (5616), 120 states have return successors, (5616), 5512 states have call predecessors, (5616), 5616 states have call successors, (5616) [2025-03-03 20:11:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27165 states to 27165 states and 46556 transitions. [2025-03-03 20:11:49,352 INFO L78 Accepts]: Start accepts. Automaton has 27165 states and 46556 transitions. Word has length 836 [2025-03-03 20:11:49,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:49,354 INFO L471 AbstractCegarLoop]: Abstraction has 27165 states and 46556 transitions. [2025-03-03 20:11:49,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-03 20:11:49,354 INFO L276 IsEmpty]: Start isEmpty. Operand 27165 states and 46556 transitions. [2025-03-03 20:11:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2025-03-03 20:11:49,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:49,375 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:49,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:11:49,376 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:49,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:49,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1732538714, now seen corresponding path program 1 times [2025-03-03 20:11:49,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:49,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906984140] [2025-03-03 20:11:49,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:49,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:49,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 836 statements into 1 equivalence classes. [2025-03-03 20:11:49,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 836 of 836 statements. [2025-03-03 20:11:49,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:49,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:55,434 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-03-03 20:11:55,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:55,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906984140] [2025-03-03 20:11:55,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906984140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:55,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:55,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 20:11:55,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939665879] [2025-03-03 20:11:55,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:55,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 20:11:55,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:55,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 20:11:55,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:11:55,437 INFO L87 Difference]: Start difference. First operand 27165 states and 46556 transitions. Second operand has 17 states, 17 states have (on average 9.941176470588236) internal successors, (169), 17 states have internal predecessors, (169), 3 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 3 states have call predecessors, (134), 3 states have call successors, (134) [2025-03-03 20:12:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:32,558 INFO L93 Difference]: Finished difference Result 233851 states and 400438 transitions. [2025-03-03 20:12:32,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 20:12:32,559 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.941176470588236) internal successors, (169), 17 states have internal predecessors, (169), 3 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 3 states have call predecessors, (134), 3 states have call successors, (134) Word has length 836 [2025-03-03 20:12:32,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:33,374 INFO L225 Difference]: With dead ends: 233851 [2025-03-03 20:12:33,374 INFO L226 Difference]: Without dead ends: 206689 [2025-03-03 20:12:33,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=474, Invalid=1248, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 20:12:33,510 INFO L435 NwaCegarLoop]: 3049 mSDtfsCounter, 10331 mSDsluCounter, 18694 mSDsCounter, 0 mSdLazyCounter, 20427 mSolverCounterSat, 4363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10331 SdHoareTripleChecker+Valid, 21743 SdHoareTripleChecker+Invalid, 24790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4363 IncrementalHoareTripleChecker+Valid, 20427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:33,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10331 Valid, 21743 Invalid, 24790 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4363 Valid, 20427 Invalid, 0 Unknown, 0 Unchecked, 21.9s Time] [2025-03-03 20:12:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206689 states. [2025-03-03 20:12:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206689 to 147553. [2025-03-03 20:12:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147553 states, 117768 states have (on average 1.6482236261123564) internal successors, (194108), 118440 states have internal predecessors, (194108), 29024 states have call successors, (29024), 760 states have call predecessors, (29024), 760 states have return successors, (29024), 28352 states have call predecessors, (29024), 29024 states have call successors, (29024) [2025-03-03 20:12:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147553 states to 147553 states and 252156 transitions. [2025-03-03 20:12:44,963 INFO L78 Accepts]: Start accepts. Automaton has 147553 states and 252156 transitions. Word has length 836 [2025-03-03 20:12:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:44,964 INFO L471 AbstractCegarLoop]: Abstraction has 147553 states and 252156 transitions. [2025-03-03 20:12:44,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.941176470588236) internal successors, (169), 17 states have internal predecessors, (169), 3 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 3 states have call predecessors, (134), 3 states have call successors, (134) [2025-03-03 20:12:44,965 INFO L276 IsEmpty]: Start isEmpty. Operand 147553 states and 252156 transitions. [2025-03-03 20:12:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2025-03-03 20:12:45,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:45,046 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:45,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:12:45,046 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:45,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1869035877, now seen corresponding path program 1 times [2025-03-03 20:12:45,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:45,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685122068] [2025-03-03 20:12:45,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:45,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:45,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 836 statements into 1 equivalence classes. [2025-03-03 20:12:45,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 836 of 836 statements. [2025-03-03 20:12:45,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:45,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 165 proven. 234 refuted. 0 times theorem prover too weak. 35245 trivial. 0 not checked. [2025-03-03 20:12:47,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:47,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685122068] [2025-03-03 20:12:47,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685122068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:12:47,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306308024] [2025-03-03 20:12:47,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:47,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:12:47,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:12:47,704 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:12:47,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:12:47,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 836 statements into 1 equivalence classes. [2025-03-03 20:12:48,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 836 of 836 statements. [2025-03-03 20:12:48,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:48,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:48,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:12:48,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:12:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 5745 proven. 33 refuted. 0 times theorem prover too weak. 29866 trivial. 0 not checked. [2025-03-03 20:12:48,252 INFO L312 TraceCheckSpWp]: Computing backward predicates...