./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_operatoramount_amount500_file-2.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 0f4d1a0f878f07f9b07af3368e16f27fe17adbf3f533e01dbd51821a170a1e65 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:01:53,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:01:54,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:01:54,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:01:54,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:01:54,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:01:54,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:01:54,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:01:54,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:01:54,050 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:01:54,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:01:54,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:01:54,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:01:54,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:01:54,053 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:01:54,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:01:54,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:01:54,054 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:01:54,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:01:54,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:01:54,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:01:54,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:01:54,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:01:54,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:01:54,057 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:01:54,057 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:01:54,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:01:54,058 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:01:54,058 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:01:54,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:01:54,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:01:54,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:01:54,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:01:54,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:01:54,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:01:54,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:01:54,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:01:54,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:01:54,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:01:54,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:01:54,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:01:54,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:01:54,065 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 0f4d1a0f878f07f9b07af3368e16f27fe17adbf3f533e01dbd51821a170a1e65 [2024-11-19 00:01:54,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:01:54,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:01:54,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:01:54,328 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:01:54,328 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:01:54,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.i [2024-11-19 00:01:55,861 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:01:56,139 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:01:56,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.i [2024-11-19 00:01:56,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8ad3862/1cb97130fecc4fbc8b6e744a6df779b9/FLAG51e4185d0 [2024-11-19 00:01:56,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8ad3862/1cb97130fecc4fbc8b6e744a6df779b9 [2024-11-19 00:01:56,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:01:56,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:01:56,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:01:56,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:01:56,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:01:56,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:01:56" (1/1) ... [2024-11-19 00:01:56,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343b6b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:01:56, skipping insertion in model container [2024-11-19 00:01:56,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:01:56" (1/1) ... [2024-11-19 00:01:56,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:01:56,468 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_operatoramount_amount500_file-2.i[915,928] [2024-11-19 00:01:56,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:01:56,741 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:01:56,760 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_operatoramount_amount500_file-2.i[915,928] [2024-11-19 00:01:56,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:01:56,903 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:01:56,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:01:56 WrapperNode [2024-11-19 00:01:56,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:01:56,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:01:56,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:01:56,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:01:56,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:01:56" (1/1) ... [2024-11-19 00:01:56,945 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:01:56" (1/1) ... [2024-11-19 00:01:57,031 INFO L138 Inliner]: procedures = 26, calls = 86, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 705 [2024-11-19 00:01:57,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:01:57,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:01:57,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:01:57,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:01:57,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:01:56" (1/1) ... [2024-11-19 00:01:57,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:01:56" (1/1) ... [2024-11-19 00:01:57,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:01:56" (1/1) ... [2024-11-19 00:01:57,106 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]. [2024-11-19 00:01:57,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:01:56" (1/1) ... [2024-11-19 00:01:57,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:01:56" (1/1) ... [2024-11-19 00:01:57,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:01:56" (1/1) ... [2024-11-19 00:01:57,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:01:56" (1/1) ... [2024-11-19 00:01:57,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:01:56" (1/1) ... [2024-11-19 00:01:57,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:01:56" (1/1) ... [2024-11-19 00:01:57,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:01:57,196 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:01:57,196 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:01:57,196 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:01:57,197 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:01:56" (1/1) ... [2024-11-19 00:01:57,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:01:57,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:01:57,238 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) [2024-11-19 00:01:57,241 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 [2024-11-19 00:01:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:01:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:01:57,290 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:01:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:01:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:01:57,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:01:57,418 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:01:57,421 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:01:58,613 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2024-11-19 00:01:58,613 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:01:58,642 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:01:58,644 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:01:58,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:01:58 BoogieIcfgContainer [2024-11-19 00:01:58,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:01:58,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:01:58,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:01:58,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:01:58,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:01:56" (1/3) ... [2024-11-19 00:01:58,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3571824d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:01:58, skipping insertion in model container [2024-11-19 00:01:58,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:01:56" (2/3) ... [2024-11-19 00:01:58,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3571824d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:01:58, skipping insertion in model container [2024-11-19 00:01:58,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:01:58" (3/3) ... [2024-11-19 00:01:58,656 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-2.i [2024-11-19 00:01:58,673 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:01:58,674 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:01:58,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:01:58,763 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;@1720c4e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:01:58,764 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:01:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 280 states, 204 states have (on average 1.5392156862745099) internal successors, (314), 205 states have internal predecessors, (314), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2024-11-19 00:01:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-11-19 00:01:58,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:01:58,806 INFO L215 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:01:58,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:01:58,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:01:58,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1161289383, now seen corresponding path program 1 times [2024-11-19 00:01:58,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:01:58,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318839527] [2024-11-19 00:01:58,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:01:58,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:01:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:01:59,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2024-11-19 00:01:59,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:01:59,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318839527] [2024-11-19 00:01:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318839527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:01:59,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507343977] [2024-11-19 00:01:59,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:01:59,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:01:59,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:01:59,699 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) [2024-11-19 00:01:59,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:02:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:00,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:02:00,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:02:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2024-11-19 00:02:00,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:02:00,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507343977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:00,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:02:00,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:02:00,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453503103] [2024-11-19 00:02:00,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:00,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:02:00,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:00,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:02:00,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:02:00,274 INFO L87 Difference]: Start difference. First operand has 280 states, 204 states have (on average 1.5392156862745099) internal successors, (314), 205 states have internal predecessors, (314), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2024-11-19 00:02:00,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:00,338 INFO L93 Difference]: Finished difference Result 553 states and 987 transitions. [2024-11-19 00:02:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:02:00,340 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) Word has length 494 [2024-11-19 00:02:00,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:00,357 INFO L225 Difference]: With dead ends: 553 [2024-11-19 00:02:00,358 INFO L226 Difference]: Without dead ends: 276 [2024-11-19 00:02:00,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:02:00,370 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:00,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:02:00,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-19 00:02:00,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-11-19 00:02:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 201 states have (on average 1.527363184079602) internal successors, (307), 201 states have internal predecessors, (307), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2024-11-19 00:02:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 453 transitions. [2024-11-19 00:02:00,464 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 453 transitions. Word has length 494 [2024-11-19 00:02:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:00,466 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 453 transitions. [2024-11-19 00:02:00,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2024-11-19 00:02:00,467 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 453 transitions. [2024-11-19 00:02:00,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-11-19 00:02:00,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:00,482 INFO L215 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:00,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 00:02:00,686 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 [2024-11-19 00:02:00,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:00,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:00,687 INFO L85 PathProgramCache]: Analyzing trace with hash 601828571, now seen corresponding path program 1 times [2024-11-19 00:02:00,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:00,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388952005] [2024-11-19 00:02:00,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:00,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2024-11-19 00:02:01,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:01,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388952005] [2024-11-19 00:02:01,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388952005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:01,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:01,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:02:01,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593029239] [2024-11-19 00:02:01,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:01,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:02:01,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:02:01,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:02:01,246 INFO L87 Difference]: Start difference. First operand 276 states and 453 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:01,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:01,377 INFO L93 Difference]: Finished difference Result 821 states and 1351 transitions. [2024-11-19 00:02:01,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:02:01,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2024-11-19 00:02:01,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:01,385 INFO L225 Difference]: With dead ends: 821 [2024-11-19 00:02:01,385 INFO L226 Difference]: Without dead ends: 548 [2024-11-19 00:02:01,387 INFO L431 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 [2024-11-19 00:02:01,388 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 446 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:01,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1125 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:02:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-19 00:02:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 277. [2024-11-19 00:02:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 202 states have (on average 1.5247524752475248) internal successors, (308), 202 states have internal predecessors, (308), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2024-11-19 00:02:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 454 transitions. [2024-11-19 00:02:01,445 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 454 transitions. Word has length 494 [2024-11-19 00:02:01,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:01,449 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 454 transitions. [2024-11-19 00:02:01,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:01,450 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 454 transitions. [2024-11-19 00:02:01,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-11-19 00:02:01,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:01,459 INFO L215 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:01,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:02:01,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:01,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:01,461 INFO L85 PathProgramCache]: Analyzing trace with hash 656221469, now seen corresponding path program 1 times [2024-11-19 00:02:01,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:01,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094420100] [2024-11-19 00:02:01,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:01,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2024-11-19 00:02:01,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:01,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094420100] [2024-11-19 00:02:01,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094420100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:01,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:01,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:02:01,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950914646] [2024-11-19 00:02:01,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:01,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:02:01,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:01,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:02:01,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:02:01,957 INFO L87 Difference]: Start difference. First operand 277 states and 454 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:02,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:02,064 INFO L93 Difference]: Finished difference Result 813 states and 1336 transitions. [2024-11-19 00:02:02,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:02:02,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2024-11-19 00:02:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:02,074 INFO L225 Difference]: With dead ends: 813 [2024-11-19 00:02:02,074 INFO L226 Difference]: Without dead ends: 539 [2024-11-19 00:02:02,075 INFO L431 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 [2024-11-19 00:02:02,078 INFO L432 NwaCegarLoop]: 678 mSDtfsCounter, 427 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:02,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1116 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:02:02,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-19 00:02:02,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 339. [2024-11-19 00:02:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 264 states have (on average 1.5795454545454546) internal successors, (417), 264 states have internal predecessors, (417), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2024-11-19 00:02:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 563 transitions. [2024-11-19 00:02:02,116 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 563 transitions. Word has length 494 [2024-11-19 00:02:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:02,117 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 563 transitions. [2024-11-19 00:02:02,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 563 transitions. [2024-11-19 00:02:02,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-11-19 00:02:02,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:02,126 INFO L215 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:02,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:02:02,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:02,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:02,127 INFO L85 PathProgramCache]: Analyzing trace with hash 696896219, now seen corresponding path program 1 times [2024-11-19 00:02:02,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:02,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708571008] [2024-11-19 00:02:02,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:02,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2024-11-19 00:02:02,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:02,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708571008] [2024-11-19 00:02:02,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708571008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:02,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:02,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:02:02,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413434561] [2024-11-19 00:02:02,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:02,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:02:02,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:02,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:02:02,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:02:02,512 INFO L87 Difference]: Start difference. First operand 339 states and 563 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:02,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:02,583 INFO L93 Difference]: Finished difference Result 987 states and 1641 transitions. [2024-11-19 00:02:02,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:02:02,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2024-11-19 00:02:02,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:02,590 INFO L225 Difference]: With dead ends: 987 [2024-11-19 00:02:02,591 INFO L226 Difference]: Without dead ends: 651 [2024-11-19 00:02:02,592 INFO L431 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 [2024-11-19 00:02:02,593 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 427 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:02,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 883 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:02:02,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-19 00:02:02,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 341. [2024-11-19 00:02:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 266 states have (on average 1.5751879699248121) internal successors, (419), 266 states have internal predecessors, (419), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2024-11-19 00:02:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 565 transitions. [2024-11-19 00:02:02,622 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 565 transitions. Word has length 494 [2024-11-19 00:02:02,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:02,623 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 565 transitions. [2024-11-19 00:02:02,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 565 transitions. [2024-11-19 00:02:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-11-19 00:02:02,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:02,632 INFO L215 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:02,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:02:02,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:02,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:02,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1049984601, now seen corresponding path program 1 times [2024-11-19 00:02:02,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:02,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439203037] [2024-11-19 00:02:02,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:02,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2024-11-19 00:02:03,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:03,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439203037] [2024-11-19 00:02:03,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439203037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:03,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:03,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:02:03,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636719076] [2024-11-19 00:02:03,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:03,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:02:03,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:03,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:02:03,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:02:03,801 INFO L87 Difference]: Start difference. First operand 341 states and 565 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:04,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:04,100 INFO L93 Difference]: Finished difference Result 1071 states and 1768 transitions. [2024-11-19 00:02:04,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:02:04,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2024-11-19 00:02:04,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:04,108 INFO L225 Difference]: With dead ends: 1071 [2024-11-19 00:02:04,108 INFO L226 Difference]: Without dead ends: 733 [2024-11-19 00:02:04,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:02:04,111 INFO L432 NwaCegarLoop]: 496 mSDtfsCounter, 575 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:04,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1364 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:02:04,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-11-19 00:02:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 564. [2024-11-19 00:02:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 470 states have (on average 1.5957446808510638) internal successors, (750), 471 states have internal predecessors, (750), 91 states have call successors, (91), 2 states have call predecessors, (91), 2 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-19 00:02:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 932 transitions. [2024-11-19 00:02:04,163 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 932 transitions. Word has length 494 [2024-11-19 00:02:04,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:04,165 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 932 transitions. [2024-11-19 00:02:04,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 932 transitions. [2024-11-19 00:02:04,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-11-19 00:02:04,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:04,178 INFO L215 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:04,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:02:04,179 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:04,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:04,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1873175397, now seen corresponding path program 1 times [2024-11-19 00:02:04,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:04,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952219008] [2024-11-19 00:02:04,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:04,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2024-11-19 00:02:05,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:05,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952219008] [2024-11-19 00:02:05,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952219008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:05,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:05,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:02:05,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406348189] [2024-11-19 00:02:05,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:05,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:02:05,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:05,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:02:05,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:02:05,506 INFO L87 Difference]: Start difference. First operand 564 states and 932 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:05,974 INFO L93 Difference]: Finished difference Result 1780 states and 2927 transitions. [2024-11-19 00:02:05,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:02:05,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2024-11-19 00:02:05,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:05,985 INFO L225 Difference]: With dead ends: 1780 [2024-11-19 00:02:05,985 INFO L226 Difference]: Without dead ends: 1219 [2024-11-19 00:02:05,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:02:05,988 INFO L432 NwaCegarLoop]: 800 mSDtfsCounter, 523 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:05,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1841 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:02:05,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2024-11-19 00:02:06,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1167. [2024-11-19 00:02:06,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 980 states have (on average 1.5918367346938775) internal successors, (1560), 982 states have internal predecessors, (1560), 182 states have call successors, (182), 4 states have call predecessors, (182), 4 states have return successors, (182), 180 states have call predecessors, (182), 182 states have call successors, (182) [2024-11-19 00:02:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1924 transitions. [2024-11-19 00:02:06,087 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1924 transitions. Word has length 494 [2024-11-19 00:02:06,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:06,088 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1924 transitions. [2024-11-19 00:02:06,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1924 transitions. [2024-11-19 00:02:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-11-19 00:02:06,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:06,097 INFO L215 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:06,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:02:06,098 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:06,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:06,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1120199899, now seen corresponding path program 1 times [2024-11-19 00:02:06,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:06,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415380652] [2024-11-19 00:02:06,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:06,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2024-11-19 00:02:07,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:07,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415380652] [2024-11-19 00:02:07,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415380652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:07,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:07,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:02:07,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174066420] [2024-11-19 00:02:07,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:07,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:02:07,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:07,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:02:07,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:02:07,502 INFO L87 Difference]: Start difference. First operand 1167 states and 1924 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:07,923 INFO L93 Difference]: Finished difference Result 3314 states and 5482 transitions. [2024-11-19 00:02:07,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:02:07,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2024-11-19 00:02:07,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:07,937 INFO L225 Difference]: With dead ends: 3314 [2024-11-19 00:02:07,937 INFO L226 Difference]: Without dead ends: 2150 [2024-11-19 00:02:07,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:02:07,942 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 372 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:07,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1360 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:02:07,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2024-11-19 00:02:08,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1291. [2024-11-19 00:02:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1030 states have (on average 1.5650485436893204) internal successors, (1612), 1032 states have internal predecessors, (1612), 255 states have call successors, (255), 5 states have call predecessors, (255), 5 states have return successors, (255), 253 states have call predecessors, (255), 255 states have call successors, (255) [2024-11-19 00:02:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 2122 transitions. [2024-11-19 00:02:08,072 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 2122 transitions. Word has length 494 [2024-11-19 00:02:08,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:08,073 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 2122 transitions. [2024-11-19 00:02:08,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2122 transitions. [2024-11-19 00:02:08,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-11-19 00:02:08,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:08,082 INFO L215 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:08,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:02:08,082 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:08,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:08,083 INFO L85 PathProgramCache]: Analyzing trace with hash -192936669, now seen corresponding path program 1 times [2024-11-19 00:02:08,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:08,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581199471] [2024-11-19 00:02:08,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:08,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2024-11-19 00:02:09,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:09,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581199471] [2024-11-19 00:02:09,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581199471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:09,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:09,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:02:09,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332089484] [2024-11-19 00:02:09,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:09,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:02:09,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:09,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:02:09,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:02:09,845 INFO L87 Difference]: Start difference. First operand 1291 states and 2122 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:10,234 INFO L93 Difference]: Finished difference Result 2910 states and 4783 transitions. [2024-11-19 00:02:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:02:10,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2024-11-19 00:02:10,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:10,246 INFO L225 Difference]: With dead ends: 2910 [2024-11-19 00:02:10,247 INFO L226 Difference]: Without dead ends: 1746 [2024-11-19 00:02:10,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:02:10,252 INFO L432 NwaCegarLoop]: 496 mSDtfsCounter, 658 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:10,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1536 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:02:10,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2024-11-19 00:02:10,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1336. [2024-11-19 00:02:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1075 states have (on average 1.5655813953488371) internal successors, (1683), 1077 states have internal predecessors, (1683), 255 states have call successors, (255), 5 states have call predecessors, (255), 5 states have return successors, (255), 253 states have call predecessors, (255), 255 states have call successors, (255) [2024-11-19 00:02:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 2193 transitions. [2024-11-19 00:02:10,385 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 2193 transitions. Word has length 494 [2024-11-19 00:02:10,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:10,386 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 2193 transitions. [2024-11-19 00:02:10,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 2193 transitions. [2024-11-19 00:02:10,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-11-19 00:02:10,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:10,397 INFO L215 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:10,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:02:10,397 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:10,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:10,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1393136995, now seen corresponding path program 1 times [2024-11-19 00:02:10,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:10,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435968703] [2024-11-19 00:02:10,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:10,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2024-11-19 00:02:12,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:12,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435968703] [2024-11-19 00:02:12,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435968703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:12,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:12,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:02:12,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520015170] [2024-11-19 00:02:12,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:12,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:02:12,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:12,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:02:12,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:02:12,032 INFO L87 Difference]: Start difference. First operand 1336 states and 2193 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:12,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:12,457 INFO L93 Difference]: Finished difference Result 3651 states and 5932 transitions. [2024-11-19 00:02:12,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:02:12,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2024-11-19 00:02:12,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:12,472 INFO L225 Difference]: With dead ends: 3651 [2024-11-19 00:02:12,472 INFO L226 Difference]: Without dead ends: 2442 [2024-11-19 00:02:12,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:02:12,477 INFO L432 NwaCegarLoop]: 594 mSDtfsCounter, 300 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:12,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1398 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:02:12,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2024-11-19 00:02:12,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2168. [2024-11-19 00:02:12,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 1826 states have (on average 1.575027382256298) internal successors, (2876), 1832 states have internal predecessors, (2876), 331 states have call successors, (331), 10 states have call predecessors, (331), 10 states have return successors, (331), 325 states have call predecessors, (331), 331 states have call successors, (331) [2024-11-19 00:02:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 3538 transitions. [2024-11-19 00:02:12,630 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 3538 transitions. Word has length 494 [2024-11-19 00:02:12,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:12,631 INFO L471 AbstractCegarLoop]: Abstraction has 2168 states and 3538 transitions. [2024-11-19 00:02:12,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 3538 transitions. [2024-11-19 00:02:12,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-11-19 00:02:12,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:12,641 INFO L215 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:12,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:02:12,642 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:12,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:12,642 INFO L85 PathProgramCache]: Analyzing trace with hash -978602267, now seen corresponding path program 1 times [2024-11-19 00:02:12,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:12,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124774506] [2024-11-19 00:02:12,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:12,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:13,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2024-11-19 00:02:13,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:13,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124774506] [2024-11-19 00:02:13,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124774506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:13,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:13,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:02:13,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047069527] [2024-11-19 00:02:13,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:13,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:02:13,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:13,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:02:13,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:02:13,369 INFO L87 Difference]: Start difference. First operand 2168 states and 3538 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:14,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:14,292 INFO L93 Difference]: Finished difference Result 7563 states and 12320 transitions. [2024-11-19 00:02:14,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:02:14,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2024-11-19 00:02:14,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:14,328 INFO L225 Difference]: With dead ends: 7563 [2024-11-19 00:02:14,329 INFO L226 Difference]: Without dead ends: 5526 [2024-11-19 00:02:14,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:02:14,337 INFO L432 NwaCegarLoop]: 758 mSDtfsCounter, 680 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:14,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 2091 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:02:14,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5526 states. [2024-11-19 00:02:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 5522. [2024-11-19 00:02:14,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5522 states, 4648 states have (on average 1.552065404475043) internal successors, (7214), 4666 states have internal predecessors, (7214), 847 states have call successors, (847), 26 states have call predecessors, (847), 26 states have return successors, (847), 829 states have call predecessors, (847), 847 states have call successors, (847) [2024-11-19 00:02:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 8908 transitions. [2024-11-19 00:02:14,813 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 8908 transitions. Word has length 494 [2024-11-19 00:02:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:14,814 INFO L471 AbstractCegarLoop]: Abstraction has 5522 states and 8908 transitions. [2024-11-19 00:02:14,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 8908 transitions. [2024-11-19 00:02:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-11-19 00:02:14,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:14,830 INFO L215 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:14,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:02:14,830 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:14,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:14,831 INFO L85 PathProgramCache]: Analyzing trace with hash -792297051, now seen corresponding path program 1 times [2024-11-19 00:02:14,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:14,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237696740] [2024-11-19 00:02:14,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:14,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2024-11-19 00:02:16,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:16,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237696740] [2024-11-19 00:02:16,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237696740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:16,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:16,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:02:16,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510757149] [2024-11-19 00:02:16,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:16,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:02:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:16,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:02:16,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:02:16,085 INFO L87 Difference]: Start difference. First operand 5522 states and 8908 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:16,900 INFO L93 Difference]: Finished difference Result 18875 states and 30390 transitions. [2024-11-19 00:02:16,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:02:16,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2024-11-19 00:02:16,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:16,993 INFO L225 Difference]: With dead ends: 18875 [2024-11-19 00:02:16,994 INFO L226 Difference]: Without dead ends: 13484 [2024-11-19 00:02:17,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:02:17,015 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 485 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:17,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1544 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:02:17,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13484 states. [2024-11-19 00:02:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13484 to 11866. [2024-11-19 00:02:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11866 states, 10500 states have (on average 1.5737142857142856) internal successors, (16524), 10542 states have internal predecessors, (16524), 1315 states have call successors, (1315), 50 states have call predecessors, (1315), 50 states have return successors, (1315), 1273 states have call predecessors, (1315), 1315 states have call successors, (1315) [2024-11-19 00:02:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11866 states to 11866 states and 19154 transitions. [2024-11-19 00:02:17,836 INFO L78 Accepts]: Start accepts. Automaton has 11866 states and 19154 transitions. Word has length 494 [2024-11-19 00:02:17,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:17,837 INFO L471 AbstractCegarLoop]: Abstraction has 11866 states and 19154 transitions. [2024-11-19 00:02:17,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:17,838 INFO L276 IsEmpty]: Start isEmpty. Operand 11866 states and 19154 transitions. [2024-11-19 00:02:17,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-11-19 00:02:17,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:17,854 INFO L215 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:17,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:02:17,854 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:17,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:17,855 INFO L85 PathProgramCache]: Analyzing trace with hash -715969723, now seen corresponding path program 1 times [2024-11-19 00:02:17,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:17,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799795338] [2024-11-19 00:02:17,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:17,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2024-11-19 00:02:21,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:21,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799795338] [2024-11-19 00:02:21,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799795338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:21,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:21,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:02:21,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727551119] [2024-11-19 00:02:21,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:21,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:02:21,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:21,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:02:21,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:02:21,723 INFO L87 Difference]: Start difference. First operand 11866 states and 19154 transitions. Second operand has 12 states, 12 states have (on average 11.0) internal successors, (132), 12 states have internal predecessors, (132), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) [2024-11-19 00:02:32,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:32,263 INFO L93 Difference]: Finished difference Result 121374 states and 195592 transitions. [2024-11-19 00:02:32,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-19 00:02:32,265 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.0) internal successors, (132), 12 states have internal predecessors, (132), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) Word has length 494 [2024-11-19 00:02:32,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:32,721 INFO L225 Difference]: With dead ends: 121374 [2024-11-19 00:02:32,722 INFO L226 Difference]: Without dead ends: 109639 [2024-11-19 00:02:32,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=401, Invalid=1005, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 00:02:32,785 INFO L432 NwaCegarLoop]: 910 mSDtfsCounter, 4162 mSDsluCounter, 7236 mSDsCounter, 0 mSdLazyCounter, 3768 mSolverCounterSat, 634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4162 SdHoareTripleChecker+Valid, 8146 SdHoareTripleChecker+Invalid, 4402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 634 IncrementalHoareTripleChecker+Valid, 3768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:32,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4162 Valid, 8146 Invalid, 4402 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [634 Valid, 3768 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-19 00:02:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109639 states. [2024-11-19 00:02:35,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109639 to 51071. [2024-11-19 00:02:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51071 states, 48388 states have (on average 1.5946309002231958) internal successors, (77161), 48547 states have internal predecessors, (77161), 2512 states have call successors, (2512), 170 states have call predecessors, (2512), 170 states have return successors, (2512), 2353 states have call predecessors, (2512), 2512 states have call successors, (2512) [2024-11-19 00:02:35,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51071 states to 51071 states and 82185 transitions. [2024-11-19 00:02:35,737 INFO L78 Accepts]: Start accepts. Automaton has 51071 states and 82185 transitions. Word has length 494 [2024-11-19 00:02:35,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:35,739 INFO L471 AbstractCegarLoop]: Abstraction has 51071 states and 82185 transitions. [2024-11-19 00:02:35,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.0) internal successors, (132), 12 states have internal predecessors, (132), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) [2024-11-19 00:02:35,740 INFO L276 IsEmpty]: Start isEmpty. Operand 51071 states and 82185 transitions. [2024-11-19 00:02:35,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-11-19 00:02:35,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:35,806 INFO L215 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:35,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:02:35,807 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:35,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:35,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1995833401, now seen corresponding path program 1 times [2024-11-19 00:02:35,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:35,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751457947] [2024-11-19 00:02:35,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:35,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2024-11-19 00:02:36,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:36,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751457947] [2024-11-19 00:02:36,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751457947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:36,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:36,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:02:36,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376193656] [2024-11-19 00:02:36,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:36,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:02:36,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:36,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:02:36,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:02:36,893 INFO L87 Difference]: Start difference. First operand 51071 states and 82185 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:39,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:39,134 INFO L93 Difference]: Finished difference Result 151817 states and 244270 transitions. [2024-11-19 00:02:39,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:02:39,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2024-11-19 00:02:39,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:39,460 INFO L225 Difference]: With dead ends: 151817 [2024-11-19 00:02:39,460 INFO L226 Difference]: Without dead ends: 100877 [2024-11-19 00:02:39,557 INFO L431 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 [2024-11-19 00:02:39,558 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 283 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:39,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1207 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:02:39,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100877 states. [2024-11-19 00:02:42,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100877 to 100866. [2024-11-19 00:02:43,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100866 states, 95881 states have (on average 1.5906071067260459) internal successors, (152509), 96208 states have internal predecessors, (152509), 4645 states have call successors, (4645), 339 states have call predecessors, (4645), 339 states have return successors, (4645), 4318 states have call predecessors, (4645), 4645 states have call successors, (4645) [2024-11-19 00:02:43,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100866 states to 100866 states and 161799 transitions. [2024-11-19 00:02:43,937 INFO L78 Accepts]: Start accepts. Automaton has 100866 states and 161799 transitions. Word has length 494 [2024-11-19 00:02:43,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:43,938 INFO L471 AbstractCegarLoop]: Abstraction has 100866 states and 161799 transitions. [2024-11-19 00:02:43,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2024-11-19 00:02:43,938 INFO L276 IsEmpty]: Start isEmpty. Operand 100866 states and 161799 transitions. [2024-11-19 00:02:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-11-19 00:02:44,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:44,057 INFO L215 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:44,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:02:44,057 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:44,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:44,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1721073787, now seen corresponding path program 1 times [2024-11-19 00:02:44,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:44,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234640845] [2024-11-19 00:02:44,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:44,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 57 proven. 159 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2024-11-19 00:02:47,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:47,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234640845] [2024-11-19 00:02:47,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234640845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:02:47,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098511899] [2024-11-19 00:02:47,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:47,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:02:47,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:02:47,827 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) [2024-11-19 00:02:47,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:02:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:48,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 00:02:48,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:02:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 1736 proven. 390 refuted. 0 times theorem prover too weak. 8386 trivial. 0 not checked. [2024-11-19 00:02:50,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:02:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 36 proven. 393 refuted. 0 times theorem prover too weak. 10083 trivial. 0 not checked. [2024-11-19 00:02:51,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098511899] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:02:51,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:02:51,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 21 [2024-11-19 00:02:51,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864684511] [2024-11-19 00:02:51,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:02:51,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 00:02:51,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:51,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 00:02:51,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:02:51,879 INFO L87 Difference]: Start difference. First operand 100866 states and 161799 transitions. Second operand has 21 states, 21 states have (on average 15.761904761904763) internal successors, (331), 21 states have internal predecessors, (331), 8 states have call successors, (219), 4 states have call predecessors, (219), 8 states have return successors, (219), 8 states have call predecessors, (219), 8 states have call successors, (219) [2024-11-19 00:02:56,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:56,610 INFO L93 Difference]: Finished difference Result 245304 states and 393119 transitions. [2024-11-19 00:02:56,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-19 00:02:56,611 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 15.761904761904763) internal successors, (331), 21 states have internal predecessors, (331), 8 states have call successors, (219), 4 states have call predecessors, (219), 8 states have return successors, (219), 8 states have call predecessors, (219), 8 states have call successors, (219) Word has length 494 [2024-11-19 00:02:56,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:57,033 INFO L225 Difference]: With dead ends: 245304 [2024-11-19 00:02:57,034 INFO L226 Difference]: Without dead ends: 144573