./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label21.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 cddd396d9051dbeeab842f0229e49128c7a3af364245c973ac8bbf7d2e9e624d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:36:56,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:36:56,806 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:36:56,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:36:56,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:36:56,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:36:56,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:36:56,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:36:56,832 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:36:56,832 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:36:56,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:36:56,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:36:56,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:36:56,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:36:56,834 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:36:56,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:36:56,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:36:56,835 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:36:56,836 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:36:56,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:36:56,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:36:56,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:36:56,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:36:56,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:36:56,838 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:36:56,838 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:36:56,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:36:56,839 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:36:56,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:36:56,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:36:56,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:36:56,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:36:56,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:36:56,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:36:56,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:36:56,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:36:56,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:36:56,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:36:56,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:36:56,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:36:56,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:36:56,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:36:56,845 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-clean/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-clean/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 -> cddd396d9051dbeeab842f0229e49128c7a3af364245c973ac8bbf7d2e9e624d [2024-10-10 22:36:57,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:36:57,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:36:57,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:36:57,124 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:36:57,125 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:36:57,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label21.c [2024-10-10 22:36:58,688 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:36:59,030 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:36:59,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label21.c [2024-10-10 22:36:59,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e9bee36db/4ee53144d67f4d3ab06c193819bc9cb7/FLAGba84b64d4 [2024-10-10 22:36:59,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e9bee36db/4ee53144d67f4d3ab06c193819bc9cb7 [2024-10-10 22:36:59,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:36:59,075 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:36:59,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:36:59,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:36:59,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:36:59,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:36:59" (1/1) ... [2024-10-10 22:36:59,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@466b3d86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:59, skipping insertion in model container [2024-10-10 22:36:59,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:36:59" (1/1) ... [2024-10-10 22:36:59,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:36:59,730 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label21.c[61500,61513] [2024-10-10 22:36:59,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:36:59,769 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:36:59,964 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label21.c[61500,61513] [2024-10-10 22:36:59,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:36:59,992 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:36:59,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:59 WrapperNode [2024-10-10 22:36:59,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:36:59,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:36:59,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:36:59,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:37:00,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:59" (1/1) ... [2024-10-10 22:37:00,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:59" (1/1) ... [2024-10-10 22:37:00,125 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-10 22:37:00,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:37:00,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:37:00,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:37:00,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:37:00,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:59" (1/1) ... [2024-10-10 22:37:00,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:59" (1/1) ... [2024-10-10 22:37:00,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:59" (1/1) ... [2024-10-10 22:37:00,197 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-10-10 22:37:00,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:59" (1/1) ... [2024-10-10 22:37:00,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:59" (1/1) ... [2024-10-10 22:37:00,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:59" (1/1) ... [2024-10-10 22:37:00,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:59" (1/1) ... [2024-10-10 22:37:00,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:59" (1/1) ... [2024-10-10 22:37:00,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:59" (1/1) ... [2024-10-10 22:37:00,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:37:00,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:37:00,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:37:00,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:37:00,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:59" (1/1) ... [2024-10-10 22:37:00,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:37:00,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:00,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:37:00,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:37:00,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:37:00,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:37:00,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:37:00,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:37:00,480 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:37:00,482 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:37:02,232 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-10 22:37:02,232 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:37:02,282 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:37:02,282 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:37:02,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:37:02 BoogieIcfgContainer [2024-10-10 22:37:02,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:37:02,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:37:02,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:37:02,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:37:02,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:36:59" (1/3) ... [2024-10-10 22:37:02,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644db7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:37:02, skipping insertion in model container [2024-10-10 22:37:02,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:59" (2/3) ... [2024-10-10 22:37:02,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644db7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:37:02, skipping insertion in model container [2024-10-10 22:37:02,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:37:02" (3/3) ... [2024-10-10 22:37:02,294 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label21.c [2024-10-10 22:37:02,310 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:37:02,310 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:37:02,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:37:02,381 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;@23e53274, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:37:02,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:37:02,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-10 22:37:02,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:02,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:02,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:02,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:02,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1008769054, now seen corresponding path program 1 times [2024-10-10 22:37:02,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:02,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214456585] [2024-10-10 22:37:02,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:03,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:03,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214456585] [2024-10-10 22:37:03,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214456585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:03,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:03,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:03,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302687256] [2024-10-10 22:37:03,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:03,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:37:03,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:03,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:37:03,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:37:03,123 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:03,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:03,179 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-10 22:37:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:37:03,183 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2024-10-10 22:37:03,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:03,196 INFO L225 Difference]: With dead ends: 479 [2024-10-10 22:37:03,196 INFO L226 Difference]: Without dead ends: 238 [2024-10-10 22:37:03,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-10-10 22:37:03,202 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:03,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:37:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-10 22:37:03,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-10 22:37:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:03,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-10 22:37:03,250 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 201 [2024-10-10 22:37:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:03,251 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-10 22:37:03,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-10 22:37:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-10 22:37:03,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:03,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:03,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:37:03,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:03,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:03,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1445388072, now seen corresponding path program 1 times [2024-10-10 22:37:03,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:03,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952541922] [2024-10-10 22:37:03,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:03,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:03,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:03,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952541922] [2024-10-10 22:37:03,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952541922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:03,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:03,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:03,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985686567] [2024-10-10 22:37:03,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:03,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:03,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:03,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:03,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:03,898 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:04,816 INFO L93 Difference]: Finished difference Result 698 states and 1151 transitions. [2024-10-10 22:37:04,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:04,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2024-10-10 22:37:04,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:04,823 INFO L225 Difference]: With dead ends: 698 [2024-10-10 22:37:04,823 INFO L226 Difference]: Without dead ends: 461 [2024-10-10 22:37:04,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-10 22:37:04,827 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 54 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:04,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 148 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 22:37:04,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-10-10 22:37:04,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2024-10-10 22:37:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.539301310043668) internal successors, (705), 458 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:04,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 705 transitions. [2024-10-10 22:37:04,856 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 705 transitions. Word has length 201 [2024-10-10 22:37:04,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:04,857 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 705 transitions. [2024-10-10 22:37:04,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:04,857 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 705 transitions. [2024-10-10 22:37:04,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-10 22:37:04,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:04,862 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:04,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:37:04,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:04,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:04,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1853258745, now seen corresponding path program 1 times [2024-10-10 22:37:04,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:04,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829702374] [2024-10-10 22:37:04,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:04,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:05,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:05,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:05,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829702374] [2024-10-10 22:37:05,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829702374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:05,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:05,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:05,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163556892] [2024-10-10 22:37:05,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:05,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:05,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:05,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:05,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:05,074 INFO L87 Difference]: Start difference. First operand 459 states and 705 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:05,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:05,861 INFO L93 Difference]: Finished difference Result 1343 states and 2078 transitions. [2024-10-10 22:37:05,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:05,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2024-10-10 22:37:05,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:05,865 INFO L225 Difference]: With dead ends: 1343 [2024-10-10 22:37:05,865 INFO L226 Difference]: Without dead ends: 885 [2024-10-10 22:37:05,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-10 22:37:05,867 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:05,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 90 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:37:05,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-10 22:37:05,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 869. [2024-10-10 22:37:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.512672811059908) internal successors, (1313), 868 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1313 transitions. [2024-10-10 22:37:05,902 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1313 transitions. Word has length 209 [2024-10-10 22:37:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:05,902 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1313 transitions. [2024-10-10 22:37:05,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:05,903 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1313 transitions. [2024-10-10 22:37:05,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-10 22:37:05,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:05,908 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:05,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:37:05,908 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:05,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:05,909 INFO L85 PathProgramCache]: Analyzing trace with hash -706598290, now seen corresponding path program 1 times [2024-10-10 22:37:05,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:05,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529034237] [2024-10-10 22:37:05,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:05,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:37:06,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:06,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529034237] [2024-10-10 22:37:06,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529034237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:06,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:06,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:06,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741922692] [2024-10-10 22:37:06,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:06,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:06,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:06,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:06,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:06,284 INFO L87 Difference]: Start difference. First operand 869 states and 1313 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:07,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:07,099 INFO L93 Difference]: Finished difference Result 2553 states and 3868 transitions. [2024-10-10 22:37:07,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:07,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2024-10-10 22:37:07,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:07,106 INFO L225 Difference]: With dead ends: 2553 [2024-10-10 22:37:07,106 INFO L226 Difference]: Without dead ends: 1685 [2024-10-10 22:37:07,108 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-10-10 22:37:07,109 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 233 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:07,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 413 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:37:07,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2024-10-10 22:37:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1683. [2024-10-10 22:37:07,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1682 states have (on average 1.3370986920332937) internal successors, (2249), 1682 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2249 transitions. [2024-10-10 22:37:07,142 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2249 transitions. Word has length 221 [2024-10-10 22:37:07,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:07,142 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2249 transitions. [2024-10-10 22:37:07,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:07,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2249 transitions. [2024-10-10 22:37:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-10 22:37:07,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:07,147 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:07,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:37:07,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:07,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:07,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1550939471, now seen corresponding path program 1 times [2024-10-10 22:37:07,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:07,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503037521] [2024-10-10 22:37:07,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:07,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:07,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:07,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503037521] [2024-10-10 22:37:07,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503037521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:07,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:07,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:07,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074715762] [2024-10-10 22:37:07,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:07,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:07,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:07,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:07,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:07,482 INFO L87 Difference]: Start difference. First operand 1683 states and 2249 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 2 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:08,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:08,265 INFO L93 Difference]: Finished difference Result 5016 states and 6709 transitions. [2024-10-10 22:37:08,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:08,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 2 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2024-10-10 22:37:08,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:08,280 INFO L225 Difference]: With dead ends: 5016 [2024-10-10 22:37:08,280 INFO L226 Difference]: Without dead ends: 3334 [2024-10-10 22:37:08,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-10 22:37:08,285 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 259 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:08,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 121 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:37:08,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2024-10-10 22:37:08,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3325. [2024-10-10 22:37:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3325 states, 3324 states have (on average 1.3237063778580025) internal successors, (4400), 3324 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3325 states to 3325 states and 4400 transitions. [2024-10-10 22:37:08,375 INFO L78 Accepts]: Start accepts. Automaton has 3325 states and 4400 transitions. Word has length 224 [2024-10-10 22:37:08,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:08,376 INFO L471 AbstractCegarLoop]: Abstraction has 3325 states and 4400 transitions. [2024-10-10 22:37:08,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 2 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:08,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3325 states and 4400 transitions. [2024-10-10 22:37:08,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-10-10 22:37:08,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:08,385 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:08,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:37:08,386 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:08,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:08,386 INFO L85 PathProgramCache]: Analyzing trace with hash -687406541, now seen corresponding path program 1 times [2024-10-10 22:37:08,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:08,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593551203] [2024-10-10 22:37:08,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:08,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:08,643 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:08,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:08,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593551203] [2024-10-10 22:37:08,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593551203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:08,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:08,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:08,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482855125] [2024-10-10 22:37:08,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:08,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:08,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:08,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:08,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:08,648 INFO L87 Difference]: Start difference. First operand 3325 states and 4400 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:09,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:09,458 INFO L93 Difference]: Finished difference Result 9925 states and 13149 transitions. [2024-10-10 22:37:09,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:09,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227 [2024-10-10 22:37:09,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:09,485 INFO L225 Difference]: With dead ends: 9925 [2024-10-10 22:37:09,486 INFO L226 Difference]: Without dead ends: 6601 [2024-10-10 22:37:09,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-10 22:37:09,494 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 217 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:09,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 166 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:37:09,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6601 states. [2024-10-10 22:37:09,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6601 to 5767. [2024-10-10 22:37:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5767 states, 5766 states have (on average 1.3371488033298646) internal successors, (7710), 5766 states have internal predecessors, (7710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:09,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 7710 transitions. [2024-10-10 22:37:09,631 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 7710 transitions. Word has length 227 [2024-10-10 22:37:09,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:09,631 INFO L471 AbstractCegarLoop]: Abstraction has 5767 states and 7710 transitions. [2024-10-10 22:37:09,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:09,631 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 7710 transitions. [2024-10-10 22:37:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-10 22:37:09,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:09,645 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:09,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:37:09,645 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:09,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:09,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2074272091, now seen corresponding path program 1 times [2024-10-10 22:37:09,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:09,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67133628] [2024-10-10 22:37:09,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:09,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-10 22:37:10,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:10,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67133628] [2024-10-10 22:37:10,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67133628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:10,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:10,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:10,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783095121] [2024-10-10 22:37:10,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:10,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:10,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:10,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:10,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:10,214 INFO L87 Difference]: Start difference. First operand 5767 states and 7710 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:11,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:11,096 INFO L93 Difference]: Finished difference Result 15633 states and 21104 transitions. [2024-10-10 22:37:11,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:11,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2024-10-10 22:37:11,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:11,182 INFO L225 Difference]: With dead ends: 15633 [2024-10-10 22:37:11,182 INFO L226 Difference]: Without dead ends: 9867 [2024-10-10 22:37:11,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-10 22:37:11,191 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 211 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:11,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 186 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:37:11,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9867 states. [2024-10-10 22:37:11,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9867 to 9642. [2024-10-10 22:37:11,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9642 states, 9641 states have (on average 1.3567057359195105) internal successors, (13080), 9641 states have internal predecessors, (13080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:11,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9642 states to 9642 states and 13080 transitions. [2024-10-10 22:37:11,396 INFO L78 Accepts]: Start accepts. Automaton has 9642 states and 13080 transitions. Word has length 236 [2024-10-10 22:37:11,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:11,396 INFO L471 AbstractCegarLoop]: Abstraction has 9642 states and 13080 transitions. [2024-10-10 22:37:11,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:11,397 INFO L276 IsEmpty]: Start isEmpty. Operand 9642 states and 13080 transitions. [2024-10-10 22:37:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-10 22:37:11,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:11,414 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:11,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:37:11,415 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:11,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:11,416 INFO L85 PathProgramCache]: Analyzing trace with hash -848496020, now seen corresponding path program 1 times [2024-10-10 22:37:11,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:11,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18493821] [2024-10-10 22:37:11,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:11,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:11,927 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:11,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:11,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18493821] [2024-10-10 22:37:11,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18493821] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:11,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753513299] [2024-10-10 22:37:11,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:11,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:11,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:11,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:11,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:37:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:12,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:37:12,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:12,389 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:37:12,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:12,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753513299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:12,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:12,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:37:12,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832389278] [2024-10-10 22:37:12,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:12,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:12,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:12,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:12,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:12,393 INFO L87 Difference]: Start difference. First operand 9642 states and 13080 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:13,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:13,358 INFO L93 Difference]: Finished difference Result 24979 states and 34054 transitions. [2024-10-10 22:37:13,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:13,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2024-10-10 22:37:13,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:13,410 INFO L225 Difference]: With dead ends: 24979 [2024-10-10 22:37:13,411 INFO L226 Difference]: Without dead ends: 15745 [2024-10-10 22:37:13,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:13,428 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 41 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:13,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 423 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 22:37:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15745 states. [2024-10-10 22:37:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15745 to 15735. [2024-10-10 22:37:13,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15735 states, 15734 states have (on average 1.3226134485826873) internal successors, (20810), 15734 states have internal predecessors, (20810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15735 states to 15735 states and 20810 transitions. [2024-10-10 22:37:13,727 INFO L78 Accepts]: Start accepts. Automaton has 15735 states and 20810 transitions. Word has length 239 [2024-10-10 22:37:13,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:13,728 INFO L471 AbstractCegarLoop]: Abstraction has 15735 states and 20810 transitions. [2024-10-10 22:37:13,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 15735 states and 20810 transitions. [2024-10-10 22:37:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-10 22:37:13,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:13,752 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:13,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 22:37:13,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:13,953 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:13,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:13,954 INFO L85 PathProgramCache]: Analyzing trace with hash -589661276, now seen corresponding path program 1 times [2024-10-10 22:37:13,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:13,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571211756] [2024-10-10 22:37:13,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:13,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:14,525 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-10 22:37:14,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:14,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571211756] [2024-10-10 22:37:14,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571211756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:14,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:14,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:14,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432134205] [2024-10-10 22:37:14,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:14,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:14,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:14,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:14,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:14,531 INFO L87 Difference]: Start difference. First operand 15735 states and 20810 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:15,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:15,499 INFO L93 Difference]: Finished difference Result 35948 states and 47614 transitions. [2024-10-10 22:37:15,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:15,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 246 [2024-10-10 22:37:15,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:15,544 INFO L225 Difference]: With dead ends: 35948 [2024-10-10 22:37:15,545 INFO L226 Difference]: Without dead ends: 20214 [2024-10-10 22:37:15,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-10 22:37:15,566 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 204 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:15,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 171 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:37:15,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20214 states. [2024-10-10 22:37:15,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20214 to 20201. [2024-10-10 22:37:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20201 states, 20200 states have (on average 1.30509900990099) internal successors, (26363), 20200 states have internal predecessors, (26363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20201 states to 20201 states and 26363 transitions. [2024-10-10 22:37:15,945 INFO L78 Accepts]: Start accepts. Automaton has 20201 states and 26363 transitions. Word has length 246 [2024-10-10 22:37:15,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:15,945 INFO L471 AbstractCegarLoop]: Abstraction has 20201 states and 26363 transitions. [2024-10-10 22:37:15,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:15,946 INFO L276 IsEmpty]: Start isEmpty. Operand 20201 states and 26363 transitions. [2024-10-10 22:37:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-10 22:37:15,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:15,976 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:15,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:37:15,977 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:15,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:15,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1777779495, now seen corresponding path program 1 times [2024-10-10 22:37:15,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:15,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436121550] [2024-10-10 22:37:15,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:15,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 22:37:16,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:16,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436121550] [2024-10-10 22:37:16,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436121550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:16,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:16,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:16,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699786701] [2024-10-10 22:37:16,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:16,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:16,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:16,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:16,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:16,274 INFO L87 Difference]: Start difference. First operand 20201 states and 26363 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:17,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:17,277 INFO L93 Difference]: Finished difference Result 42036 states and 54659 transitions. [2024-10-10 22:37:17,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:17,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 249 [2024-10-10 22:37:17,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:17,325 INFO L225 Difference]: With dead ends: 42036 [2024-10-10 22:37:17,325 INFO L226 Difference]: Without dead ends: 22446 [2024-10-10 22:37:17,351 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-10-10 22:37:17,352 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 202 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:17,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 420 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 22:37:17,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22446 states. [2024-10-10 22:37:17,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22446 to 22442. [2024-10-10 22:37:17,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22442 states, 22441 states have (on average 1.2857715788066486) internal successors, (28854), 22441 states have internal predecessors, (28854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:17,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22442 states to 22442 states and 28854 transitions. [2024-10-10 22:37:17,648 INFO L78 Accepts]: Start accepts. Automaton has 22442 states and 28854 transitions. Word has length 249 [2024-10-10 22:37:17,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:17,649 INFO L471 AbstractCegarLoop]: Abstraction has 22442 states and 28854 transitions. [2024-10-10 22:37:17,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:17,649 INFO L276 IsEmpty]: Start isEmpty. Operand 22442 states and 28854 transitions. [2024-10-10 22:37:17,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-10 22:37:17,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:17,687 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:17,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:37:17,687 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:17,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:17,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1899707371, now seen corresponding path program 1 times [2024-10-10 22:37:17,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:17,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512185422] [2024-10-10 22:37:17,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:17,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:18,168 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 50 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-10 22:37:18,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:18,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512185422] [2024-10-10 22:37:18,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512185422] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:18,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778976465] [2024-10-10 22:37:18,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:18,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:18,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:18,171 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:18,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:37:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:18,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:18,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:18,437 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-10 22:37:18,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:18,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778976465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:18,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:18,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 22:37:18,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006781894] [2024-10-10 22:37:18,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:18,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:18,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:18,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:18,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:18,440 INFO L87 Difference]: Start difference. First operand 22442 states and 28854 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 2 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:19,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:19,495 INFO L93 Difference]: Finished difference Result 58314 states and 75048 transitions. [2024-10-10 22:37:19,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:19,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 2 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2024-10-10 22:37:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:19,574 INFO L225 Difference]: With dead ends: 58314 [2024-10-10 22:37:19,575 INFO L226 Difference]: Without dead ends: 36076 [2024-10-10 22:37:19,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:19,604 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 235 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:19,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 158 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:37:19,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36076 states. [2024-10-10 22:37:20,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36076 to 34852. [2024-10-10 22:37:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34852 states, 34851 states have (on average 1.2594760552064503) internal successors, (43894), 34851 states have internal predecessors, (43894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:20,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34852 states to 34852 states and 43894 transitions. [2024-10-10 22:37:20,168 INFO L78 Accepts]: Start accepts. Automaton has 34852 states and 43894 transitions. Word has length 253 [2024-10-10 22:37:20,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:20,168 INFO L471 AbstractCegarLoop]: Abstraction has 34852 states and 43894 transitions. [2024-10-10 22:37:20,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 2 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:20,169 INFO L276 IsEmpty]: Start isEmpty. Operand 34852 states and 43894 transitions. [2024-10-10 22:37:20,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-10-10 22:37:20,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:20,197 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:20,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 22:37:20,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:20,399 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:20,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:20,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1117693928, now seen corresponding path program 1 times [2024-10-10 22:37:20,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:20,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453322566] [2024-10-10 22:37:20,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:20,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:20,835 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:37:20,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:20,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453322566] [2024-10-10 22:37:20,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453322566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:20,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:20,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:20,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278950208] [2024-10-10 22:37:20,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:20,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:20,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:20,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:20,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:20,838 INFO L87 Difference]: Start difference. First operand 34852 states and 43894 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:21,696 INFO L93 Difference]: Finished difference Result 76643 states and 96218 transitions. [2024-10-10 22:37:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:21,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 255 [2024-10-10 22:37:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:21,764 INFO L225 Difference]: With dead ends: 76643 [2024-10-10 22:37:21,765 INFO L226 Difference]: Without dead ends: 42605 [2024-10-10 22:37:21,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-10 22:37:21,801 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 197 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:21,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 200 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:37:21,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42605 states. [2024-10-10 22:37:22,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42605 to 42591. [2024-10-10 22:37:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42591 states, 42590 states have (on average 1.2448931674101902) internal successors, (53020), 42590 states have internal predecessors, (53020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42591 states to 42591 states and 53020 transitions. [2024-10-10 22:37:22,731 INFO L78 Accepts]: Start accepts. Automaton has 42591 states and 53020 transitions. Word has length 255 [2024-10-10 22:37:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:22,732 INFO L471 AbstractCegarLoop]: Abstraction has 42591 states and 53020 transitions. [2024-10-10 22:37:22,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 42591 states and 53020 transitions. [2024-10-10 22:37:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-10 22:37:22,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:22,770 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:22,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:37:22,771 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:22,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:22,772 INFO L85 PathProgramCache]: Analyzing trace with hash 250805959, now seen corresponding path program 2 times [2024-10-10 22:37:22,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:22,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049113992] [2024-10-10 22:37:22,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:22,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:23,050 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:37:23,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:23,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049113992] [2024-10-10 22:37:23,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049113992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:23,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:23,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:23,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481162757] [2024-10-10 22:37:23,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:23,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:23,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:23,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:23,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:23,053 INFO L87 Difference]: Start difference. First operand 42591 states and 53020 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:23,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:23,656 INFO L93 Difference]: Finished difference Result 115134 states and 143165 transitions. [2024-10-10 22:37:23,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:23,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 262 [2024-10-10 22:37:23,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:23,781 INFO L225 Difference]: With dead ends: 115134 [2024-10-10 22:37:23,781 INFO L226 Difference]: Without dead ends: 73966 [2024-10-10 22:37:23,824 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-10-10 22:37:23,825 INFO L432 NwaCegarLoop]: 653 mSDtfsCounter, 332 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:23,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 947 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:37:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73966 states. [2024-10-10 22:37:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73966 to 73963. [2024-10-10 22:37:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73963 states, 73962 states have (on average 1.2208836970336119) internal successors, (90299), 73962 states have internal predecessors, (90299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:25,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73963 states to 73963 states and 90299 transitions. [2024-10-10 22:37:25,224 INFO L78 Accepts]: Start accepts. Automaton has 73963 states and 90299 transitions. Word has length 262 [2024-10-10 22:37:25,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:25,224 INFO L471 AbstractCegarLoop]: Abstraction has 73963 states and 90299 transitions. [2024-10-10 22:37:25,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:25,224 INFO L276 IsEmpty]: Start isEmpty. Operand 73963 states and 90299 transitions. [2024-10-10 22:37:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-10-10 22:37:25,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:25,279 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:25,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 22:37:25,279 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:25,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:25,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1095849963, now seen corresponding path program 1 times [2024-10-10 22:37:25,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:25,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851440577] [2024-10-10 22:37:25,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:25,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-10 22:37:26,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:26,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851440577] [2024-10-10 22:37:26,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851440577] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:26,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687337588] [2024-10-10 22:37:26,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:26,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:26,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:26,059 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:26,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:37:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:26,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:26,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:37:26,288 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:26,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687337588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:26,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:26,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:37:26,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569061322] [2024-10-10 22:37:26,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:26,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:26,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:26,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:26,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:26,290 INFO L87 Difference]: Start difference. First operand 73963 states and 90299 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:27,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:27,486 INFO L93 Difference]: Finished difference Result 171070 states and 211773 transitions. [2024-10-10 22:37:27,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:27,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2024-10-10 22:37:27,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:27,621 INFO L225 Difference]: With dead ends: 171070 [2024-10-10 22:37:27,621 INFO L226 Difference]: Without dead ends: 97921 [2024-10-10 22:37:27,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 267 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-10-10 22:37:27,691 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 224 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:27,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 169 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:37:28,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97921 states. [2024-10-10 22:37:29,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97921 to 97511. [2024-10-10 22:37:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97511 states, 97510 states have (on average 1.1853040713772947) internal successors, (115579), 97510 states have internal predecessors, (115579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97511 states to 97511 states and 115579 transitions. [2024-10-10 22:37:29,234 INFO L78 Accepts]: Start accepts. Automaton has 97511 states and 115579 transitions. Word has length 268 [2024-10-10 22:37:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:29,234 INFO L471 AbstractCegarLoop]: Abstraction has 97511 states and 115579 transitions. [2024-10-10 22:37:29,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:29,235 INFO L276 IsEmpty]: Start isEmpty. Operand 97511 states and 115579 transitions. [2024-10-10 22:37:29,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-10-10 22:37:29,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:29,291 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:29,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:37:29,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:29,492 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:29,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1780106567, now seen corresponding path program 1 times [2024-10-10 22:37:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:29,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539035256] [2024-10-10 22:37:29,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:30,060 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-10 22:37:30,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:30,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539035256] [2024-10-10 22:37:30,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539035256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:30,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:30,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:30,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357013352] [2024-10-10 22:37:30,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:30,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:30,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:30,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:30,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:30,063 INFO L87 Difference]: Start difference. First operand 97511 states and 115579 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:31,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:31,266 INFO L93 Difference]: Finished difference Result 205214 states and 243214 transitions. [2024-10-10 22:37:31,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:31,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2024-10-10 22:37:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:31,716 INFO L225 Difference]: With dead ends: 205214 [2024-10-10 22:37:31,716 INFO L226 Difference]: Without dead ends: 108517 [2024-10-10 22:37:31,750 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-10-10 22:37:31,754 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 214 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:31,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 399 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108517 states. [2024-10-10 22:37:32,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108517 to 91821. [2024-10-10 22:37:32,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91821 states, 91820 states have (on average 1.1824003485079504) internal successors, (108568), 91820 states have internal predecessors, (108568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91821 states to 91821 states and 108568 transitions. [2024-10-10 22:37:32,857 INFO L78 Accepts]: Start accepts. Automaton has 91821 states and 108568 transitions. Word has length 272 [2024-10-10 22:37:32,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:32,858 INFO L471 AbstractCegarLoop]: Abstraction has 91821 states and 108568 transitions. [2024-10-10 22:37:32,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:32,858 INFO L276 IsEmpty]: Start isEmpty. Operand 91821 states and 108568 transitions. [2024-10-10 22:37:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-10-10 22:37:32,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:32,900 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:32,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 22:37:32,900 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:32,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:32,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1196890508, now seen corresponding path program 1 times [2024-10-10 22:37:32,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:32,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875875132] [2024-10-10 22:37:32,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:32,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:33,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:33,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875875132] [2024-10-10 22:37:33,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875875132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:33,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:33,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:33,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886724327] [2024-10-10 22:37:33,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:33,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:33,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:33,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:33,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:33,795 INFO L87 Difference]: Start difference. First operand 91821 states and 108568 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:34,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:34,913 INFO L93 Difference]: Finished difference Result 183236 states and 216698 transitions. [2024-10-10 22:37:34,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:34,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 275 [2024-10-10 22:37:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:35,045 INFO L225 Difference]: With dead ends: 183236 [2024-10-10 22:37:35,045 INFO L226 Difference]: Without dead ends: 92229 [2024-10-10 22:37:35,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-10 22:37:35,102 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 133 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:35,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 197 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:37:35,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92229 states. [2024-10-10 22:37:36,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92229 to 92227. [2024-10-10 22:37:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92227 states, 92226 states have (on average 1.1820853121679353) internal successors, (109019), 92226 states have internal predecessors, (109019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:36,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92227 states to 92227 states and 109019 transitions. [2024-10-10 22:37:36,502 INFO L78 Accepts]: Start accepts. Automaton has 92227 states and 109019 transitions. Word has length 275 [2024-10-10 22:37:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:36,502 INFO L471 AbstractCegarLoop]: Abstraction has 92227 states and 109019 transitions. [2024-10-10 22:37:36,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 92227 states and 109019 transitions. [2024-10-10 22:37:36,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-10-10 22:37:36,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:36,554 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:36,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 22:37:36,554 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:36,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:36,555 INFO L85 PathProgramCache]: Analyzing trace with hash 827603710, now seen corresponding path program 1 times [2024-10-10 22:37:36,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:36,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445827526] [2024-10-10 22:37:36,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:36,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-10 22:37:36,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:36,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445827526] [2024-10-10 22:37:36,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445827526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:36,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:36,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:36,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97958967] [2024-10-10 22:37:36,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:36,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:37:36,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:36,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:37:36,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:36,822 INFO L87 Difference]: Start difference. First operand 92227 states and 109019 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:38,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:38,492 INFO L93 Difference]: Finished difference Result 183711 states and 217242 transitions. [2024-10-10 22:37:38,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:37:38,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 288 [2024-10-10 22:37:38,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:38,597 INFO L225 Difference]: With dead ends: 183711 [2024-10-10 22:37:38,597 INFO L226 Difference]: Without dead ends: 92704 [2024-10-10 22:37:38,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10-10 22:37:38,656 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 409 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:38,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 206 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 22:37:38,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92704 states. [2024-10-10 22:37:39,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92704 to 89791. [2024-10-10 22:37:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89791 states, 89790 states have (on average 1.1839514422541486) internal successors, (106307), 89790 states have internal predecessors, (106307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89791 states to 89791 states and 106307 transitions. [2024-10-10 22:37:39,927 INFO L78 Accepts]: Start accepts. Automaton has 89791 states and 106307 transitions. Word has length 288 [2024-10-10 22:37:39,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:39,928 INFO L471 AbstractCegarLoop]: Abstraction has 89791 states and 106307 transitions. [2024-10-10 22:37:39,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 89791 states and 106307 transitions. [2024-10-10 22:37:39,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-10-10 22:37:39,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:39,978 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:39,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 22:37:39,979 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:39,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:39,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2009490991, now seen corresponding path program 1 times [2024-10-10 22:37:39,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:39,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904467202] [2024-10-10 22:37:39,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:39,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-10 22:37:40,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:40,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904467202] [2024-10-10 22:37:40,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904467202] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:40,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777216692] [2024-10-10 22:37:40,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:40,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:40,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:40,838 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:40,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:37:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:41,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:41,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:41,075 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-10 22:37:41,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:41,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777216692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:41,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:41,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:37:41,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206063946] [2024-10-10 22:37:41,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:41,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:41,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:41,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:41,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:41,079 INFO L87 Difference]: Start difference. First operand 89791 states and 106307 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:42,226 INFO L93 Difference]: Finished difference Result 174155 states and 205570 transitions. [2024-10-10 22:37:42,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:42,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 295 [2024-10-10 22:37:42,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:42,342 INFO L225 Difference]: With dead ends: 174155 [2024-10-10 22:37:42,342 INFO L226 Difference]: Without dead ends: 84771 [2024-10-10 22:37:42,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:42,410 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 214 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:42,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 352 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:37:42,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84771 states. [2024-10-10 22:37:43,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84771 to 84513. [2024-10-10 22:37:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84513 states, 84512 states have (on average 1.167905149564559) internal successors, (98702), 84512 states have internal predecessors, (98702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84513 states to 84513 states and 98702 transitions. [2024-10-10 22:37:43,592 INFO L78 Accepts]: Start accepts. Automaton has 84513 states and 98702 transitions. Word has length 295 [2024-10-10 22:37:43,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:43,592 INFO L471 AbstractCegarLoop]: Abstraction has 84513 states and 98702 transitions. [2024-10-10 22:37:43,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:43,592 INFO L276 IsEmpty]: Start isEmpty. Operand 84513 states and 98702 transitions. [2024-10-10 22:37:44,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2024-10-10 22:37:44,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:44,009 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:44,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 22:37:44,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-10 22:37:44,211 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:44,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:44,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1474662480, now seen corresponding path program 1 times [2024-10-10 22:37:44,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:44,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699252852] [2024-10-10 22:37:44,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:44,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:44,470 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-10 22:37:44,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:44,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699252852] [2024-10-10 22:37:44,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699252852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:44,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:44,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:44,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875438508] [2024-10-10 22:37:44,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:44,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:37:44,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:44,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:37:44,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:44,472 INFO L87 Difference]: Start difference. First operand 84513 states and 98702 transitions. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:45,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:45,367 INFO L93 Difference]: Finished difference Result 132524 states and 154558 transitions. [2024-10-10 22:37:45,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:37:45,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 296 [2024-10-10 22:37:45,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:45,426 INFO L225 Difference]: With dead ends: 132524 [2024-10-10 22:37:45,427 INFO L226 Difference]: Without dead ends: 49028 [2024-10-10 22:37:45,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10-10 22:37:45,469 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 559 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:45,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 52 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:45,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49028 states. [2024-10-10 22:37:46,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49028 to 47810. [2024-10-10 22:37:46,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47810 states, 47809 states have (on average 1.119182580685645) internal successors, (53507), 47809 states have internal predecessors, (53507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47810 states to 47810 states and 53507 transitions. [2024-10-10 22:37:46,202 INFO L78 Accepts]: Start accepts. Automaton has 47810 states and 53507 transitions. Word has length 296 [2024-10-10 22:37:46,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:46,203 INFO L471 AbstractCegarLoop]: Abstraction has 47810 states and 53507 transitions. [2024-10-10 22:37:46,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 47810 states and 53507 transitions. [2024-10-10 22:37:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-10-10 22:37:46,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:46,230 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:46,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 22:37:46,230 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:46,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:46,231 INFO L85 PathProgramCache]: Analyzing trace with hash 746229803, now seen corresponding path program 1 times [2024-10-10 22:37:46,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:46,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887501701] [2024-10-10 22:37:46,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:46,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-10 22:37:46,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:46,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887501701] [2024-10-10 22:37:46,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887501701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:46,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:46,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:46,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340118997] [2024-10-10 22:37:46,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:46,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:46,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:46,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:46,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:46,498 INFO L87 Difference]: Start difference. First operand 47810 states and 53507 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 2 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:47,530 INFO L93 Difference]: Finished difference Result 107628 states and 120821 transitions. [2024-10-10 22:37:47,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:47,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 2 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 309 [2024-10-10 22:37:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:47,605 INFO L225 Difference]: With dead ends: 107628 [2024-10-10 22:37:47,605 INFO L226 Difference]: Without dead ends: 60835 [2024-10-10 22:37:47,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-10 22:37:47,648 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 206 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:47,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 143 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:37:47,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60835 states. [2024-10-10 22:37:48,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60835 to 60018. [2024-10-10 22:37:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60018 states, 60017 states have (on average 1.1249979172567772) internal successors, (67519), 60017 states have internal predecessors, (67519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60018 states to 60018 states and 67519 transitions. [2024-10-10 22:37:48,921 INFO L78 Accepts]: Start accepts. Automaton has 60018 states and 67519 transitions. Word has length 309 [2024-10-10 22:37:48,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:48,921 INFO L471 AbstractCegarLoop]: Abstraction has 60018 states and 67519 transitions. [2024-10-10 22:37:48,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 2 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 60018 states and 67519 transitions. [2024-10-10 22:37:48,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-10-10 22:37:48,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:48,983 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:48,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 22:37:48,983 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:48,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:48,984 INFO L85 PathProgramCache]: Analyzing trace with hash -534325224, now seen corresponding path program 1 times [2024-10-10 22:37:48,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:48,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615746523] [2024-10-10 22:37:48,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:48,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-10 22:37:49,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:49,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615746523] [2024-10-10 22:37:49,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615746523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:49,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:49,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:49,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042038784] [2024-10-10 22:37:49,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:49,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:37:49,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:49,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:37:49,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:49,275 INFO L87 Difference]: Start difference. First operand 60018 states and 67519 transitions. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:50,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:50,372 INFO L93 Difference]: Finished difference Result 111912 states and 125426 transitions. [2024-10-10 22:37:50,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:37:50,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 322 [2024-10-10 22:37:50,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:50,452 INFO L225 Difference]: With dead ends: 111912 [2024-10-10 22:37:50,452 INFO L226 Difference]: Without dead ends: 65119 [2024-10-10 22:37:50,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10-10 22:37:50,495 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 365 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:50,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 89 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:37:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65119 states. [2024-10-10 22:37:51,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65119 to 61239. [2024-10-10 22:37:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61239 states, 61238 states have (on average 1.1242529148567884) internal successors, (68847), 61238 states have internal predecessors, (68847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:51,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61239 states to 61239 states and 68847 transitions. [2024-10-10 22:37:51,414 INFO L78 Accepts]: Start accepts. Automaton has 61239 states and 68847 transitions. Word has length 322 [2024-10-10 22:37:51,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:51,414 INFO L471 AbstractCegarLoop]: Abstraction has 61239 states and 68847 transitions. [2024-10-10 22:37:51,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand 61239 states and 68847 transitions. [2024-10-10 22:37:51,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-10-10 22:37:51,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:51,442 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:51,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 22:37:51,442 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:51,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:51,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1520089046, now seen corresponding path program 1 times [2024-10-10 22:37:51,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:51,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594954623] [2024-10-10 22:37:51,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:51,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 100 proven. 6 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-10-10 22:37:51,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:51,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594954623] [2024-10-10 22:37:51,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594954623] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:51,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522563141] [2024-10-10 22:37:51,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:51,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:51,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:51,982 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:51,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 22:37:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:52,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:52,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-10 22:37:52,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:52,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522563141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:52,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:52,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:37:52,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065073161] [2024-10-10 22:37:52,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:52,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:52,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:52,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:52,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:52,389 INFO L87 Difference]: Start difference. First operand 61239 states and 68847 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:53,183 INFO L93 Difference]: Finished difference Result 120441 states and 135510 transitions. [2024-10-10 22:37:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:53,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 335 [2024-10-10 22:37:53,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:53,259 INFO L225 Difference]: With dead ends: 120441 [2024-10-10 22:37:53,259 INFO L226 Difference]: Without dead ends: 60830 [2024-10-10 22:37:53,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:53,299 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 61 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:53,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 284 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:37:53,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60830 states. [2024-10-10 22:37:54,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60830 to 60827. [2024-10-10 22:37:54,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60827 states, 60826 states have (on average 1.1189129648505574) internal successors, (68059), 60826 states have internal predecessors, (68059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60827 states to 60827 states and 68059 transitions. [2024-10-10 22:37:54,282 INFO L78 Accepts]: Start accepts. Automaton has 60827 states and 68059 transitions. Word has length 335 [2024-10-10 22:37:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:54,283 INFO L471 AbstractCegarLoop]: Abstraction has 60827 states and 68059 transitions. [2024-10-10 22:37:54,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 60827 states and 68059 transitions. [2024-10-10 22:37:54,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-10-10 22:37:54,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:54,325 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:54,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 22:37:54,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-10 22:37:54,526 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:54,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:54,527 INFO L85 PathProgramCache]: Analyzing trace with hash 544955691, now seen corresponding path program 1 times [2024-10-10 22:37:54,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:54,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164572414] [2024-10-10 22:37:54,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:54,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:54,829 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 22:37:54,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:54,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164572414] [2024-10-10 22:37:54,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164572414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:54,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:54,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:54,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598740223] [2024-10-10 22:37:54,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:54,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:54,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:54,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:54,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:54,832 INFO L87 Difference]: Start difference. First operand 60827 states and 68059 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 2 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:55,701 INFO L93 Difference]: Finished difference Result 155622 states and 173424 transitions. [2024-10-10 22:37:55,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:55,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 2 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 350 [2024-10-10 22:37:55,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:55,812 INFO L225 Difference]: With dead ends: 155622 [2024-10-10 22:37:55,812 INFO L226 Difference]: Without dead ends: 96423 [2024-10-10 22:37:55,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-10 22:37:55,832 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 210 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:55,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 521 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:37:55,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96423 states. [2024-10-10 22:37:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96423 to 92753. [2024-10-10 22:37:57,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92753 states, 92752 states have (on average 1.1103803691564602) internal successors, (102990), 92752 states have internal predecessors, (102990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:57,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92753 states to 92753 states and 102990 transitions. [2024-10-10 22:37:57,176 INFO L78 Accepts]: Start accepts. Automaton has 92753 states and 102990 transitions. Word has length 350 [2024-10-10 22:37:57,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:57,176 INFO L471 AbstractCegarLoop]: Abstraction has 92753 states and 102990 transitions. [2024-10-10 22:37:57,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 2 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:57,176 INFO L276 IsEmpty]: Start isEmpty. Operand 92753 states and 102990 transitions. [2024-10-10 22:37:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-10-10 22:37:57,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:57,205 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:57,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-10 22:37:57,205 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:57,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:57,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1766826091, now seen corresponding path program 1 times [2024-10-10 22:37:57,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:57,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886718684] [2024-10-10 22:37:57,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:57,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 125 proven. 6 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-10 22:37:57,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:57,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886718684] [2024-10-10 22:37:57,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886718684] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:57,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777980326] [2024-10-10 22:37:57,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:57,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:57,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:57,539 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:57,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 22:37:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:57,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:57,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-10-10 22:37:57,877 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:57,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777980326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:57,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:57,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:37:57,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063527860] [2024-10-10 22:37:57,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:57,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:57,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:57,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:57,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:57,879 INFO L87 Difference]: Start difference. First operand 92753 states and 102990 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:59,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:59,006 INFO L93 Difference]: Finished difference Result 181245 states and 201463 transitions. [2024-10-10 22:37:59,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:59,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 354 [2024-10-10 22:37:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:59,115 INFO L225 Difference]: With dead ends: 181245 [2024-10-10 22:37:59,115 INFO L226 Difference]: Without dead ends: 92758 [2024-10-10 22:37:59,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:59,176 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 66 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:59,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 55 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:37:59,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92758 states. [2024-10-10 22:38:00,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92758 to 92753. [2024-10-10 22:38:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92753 states, 92752 states have (on average 1.110186303260307) internal successors, (102972), 92752 states have internal predecessors, (102972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92753 states to 92753 states and 102972 transitions. [2024-10-10 22:38:00,622 INFO L78 Accepts]: Start accepts. Automaton has 92753 states and 102972 transitions. Word has length 354 [2024-10-10 22:38:00,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:00,622 INFO L471 AbstractCegarLoop]: Abstraction has 92753 states and 102972 transitions. [2024-10-10 22:38:00,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:00,623 INFO L276 IsEmpty]: Start isEmpty. Operand 92753 states and 102972 transitions. [2024-10-10 22:38:00,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2024-10-10 22:38:00,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:00,667 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:38:00,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-10 22:38:00,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-10 22:38:00,868 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:00,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:00,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1096492634, now seen corresponding path program 1 times [2024-10-10 22:38:00,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:00,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667947045] [2024-10-10 22:38:00,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:00,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-10 22:38:01,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:01,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667947045] [2024-10-10 22:38:01,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667947045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:01,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:38:01,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:38:01,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465107477] [2024-10-10 22:38:01,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:01,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:01,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:01,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:01,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:38:01,204 INFO L87 Difference]: Start difference. First operand 92753 states and 102972 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:02,558 INFO L93 Difference]: Finished difference Result 204016 states and 226249 transitions. [2024-10-10 22:38:02,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:02,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 385 [2024-10-10 22:38:02,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:02,698 INFO L225 Difference]: With dead ends: 204016 [2024-10-10 22:38:02,699 INFO L226 Difference]: Without dead ends: 112482 [2024-10-10 22:38:02,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-10 22:38:02,770 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 202 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:02,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 131 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 22:38:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112482 states. [2024-10-10 22:38:04,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112482 to 112474. [2024-10-10 22:38:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112474 states, 112473 states have (on average 1.1033581392867622) internal successors, (124098), 112473 states have internal predecessors, (124098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112474 states to 112474 states and 124098 transitions. [2024-10-10 22:38:04,377 INFO L78 Accepts]: Start accepts. Automaton has 112474 states and 124098 transitions. Word has length 385 [2024-10-10 22:38:04,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:04,377 INFO L471 AbstractCegarLoop]: Abstraction has 112474 states and 124098 transitions. [2024-10-10 22:38:04,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 112474 states and 124098 transitions. [2024-10-10 22:38:04,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2024-10-10 22:38:04,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:04,433 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:38:04,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-10 22:38:04,433 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:04,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:04,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1754388009, now seen corresponding path program 1 times [2024-10-10 22:38:04,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:04,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111129184] [2024-10-10 22:38:04,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:04,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 147 proven. 6 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-10 22:38:05,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:05,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111129184] [2024-10-10 22:38:05,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111129184] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:38:05,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673662230] [2024-10-10 22:38:05,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:05,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:38:05,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:38:05,418 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:38:05,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 22:38:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:05,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:38:05,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:38:05,686 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-10-10 22:38:05,688 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:38:05,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673662230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:05,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:38:05,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:38:05,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879081918] [2024-10-10 22:38:05,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:05,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:05,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:05,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:05,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:38:05,690 INFO L87 Difference]: Start difference. First operand 112474 states and 124098 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:06,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:06,959 INFO L93 Difference]: Finished difference Result 215982 states and 237921 transitions. [2024-10-10 22:38:06,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:06,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 397 [2024-10-10 22:38:06,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:07,123 INFO L225 Difference]: With dead ends: 215982 [2024-10-10 22:38:07,123 INFO L226 Difference]: Without dead ends: 103915 [2024-10-10 22:38:07,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:38:07,176 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 221 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:07,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 301 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:38:07,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103915 states.