./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6cb8ee599d957b44e84b6deda03837f10d12ce4870b06e5310d491ec68c724f7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:29:12,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:29:12,240 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:29:12,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:29:12,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:29:12,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:29:12,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:29:12,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:29:12,268 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:29:12,268 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:29:12,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:29:12,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:29:12,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:29:12,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:29:12,270 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:29:12,271 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:29:12,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:29:12,274 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:29:12,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:29:12,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:29:12,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:29:12,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:29:12,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:29:12,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:29:12,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:29:12,276 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:29:12,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:29:12,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:29:12,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:29:12,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:29:12,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:29:12,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:29:12,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:29:12,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:29:12,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:29:12,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:29:12,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:29:12,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:29:12,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:29:12,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:29:12,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:29:12,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:29:12,282 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6cb8ee599d957b44e84b6deda03837f10d12ce4870b06e5310d491ec68c724f7 [2024-10-12 21:29:12,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:29:12,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:29:12,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:29:12,510 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:29:12,510 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:29:12,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c [2024-10-12 21:29:13,853 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:29:14,193 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:29:14,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c [2024-10-12 21:29:14,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a164190/b115928858d944c58f57c5bbfa952722/FLAG626846404 [2024-10-12 21:29:14,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a164190/b115928858d944c58f57c5bbfa952722 [2024-10-12 21:29:14,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:29:14,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:29:14,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:29:14,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:29:14,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:29:14,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:29:14" (1/1) ... [2024-10-12 21:29:14,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@327a422d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:29:14, skipping insertion in model container [2024-10-12 21:29:14,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:29:14" (1/1) ... [2024-10-12 21:29:14,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:29:14,611 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c[11640,11653] [2024-10-12 21:29:14,629 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c[13977,13990] [2024-10-12 21:29:15,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:29:15,060 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:29:15,089 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c[11640,11653] [2024-10-12 21:29:15,093 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c[13977,13990] [2024-10-12 21:29:15,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:29:15,393 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:29:15,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:29:15 WrapperNode [2024-10-12 21:29:15,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:29:15,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:29:15,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:29:15,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:29:15,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:29:15" (1/1) ... [2024-10-12 21:29:15,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:29:15" (1/1) ... [2024-10-12 21:29:15,852 INFO L138 Inliner]: procedures = 36, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5099 [2024-10-12 21:29:15,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:29:15,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:29:15,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:29:15,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:29:15,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:29:15" (1/1) ... [2024-10-12 21:29:15,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:29:15" (1/1) ... [2024-10-12 21:29:15,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:29:15" (1/1) ... [2024-10-12 21:29:16,072 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-12 21:29:16,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:29:15" (1/1) ... [2024-10-12 21:29:16,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:29:15" (1/1) ... [2024-10-12 21:29:16,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:29:15" (1/1) ... [2024-10-12 21:29:16,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:29:15" (1/1) ... [2024-10-12 21:29:16,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:29:15" (1/1) ... [2024-10-12 21:29:16,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:29:15" (1/1) ... [2024-10-12 21:29:16,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:29:16,404 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:29:16,404 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:29:16,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:29:16,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:29:15" (1/1) ... [2024-10-12 21:29:16,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:29:16,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:29:16,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:29:16,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:29:16,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:29:16,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:29:16,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:29:16,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:29:16,634 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:29:16,636 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:29:20,198 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2024-10-12 21:29:20,199 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:29:20,240 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:29:20,240 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 21:29:20,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:29:20 BoogieIcfgContainer [2024-10-12 21:29:20,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:29:20,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:29:20,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:29:20,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:29:20,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:29:14" (1/3) ... [2024-10-12 21:29:20,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b89bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:29:20, skipping insertion in model container [2024-10-12 21:29:20,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:29:15" (2/3) ... [2024-10-12 21:29:20,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b89bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:29:20, skipping insertion in model container [2024-10-12 21:29:20,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:29:20" (3/3) ... [2024-10-12 21:29:20,247 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label03.c [2024-10-12 21:29:20,259 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:29:20,260 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:29:20,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:29:20,323 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;@3d58e5d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:29:20,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:29:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 834 states, 831 states have (on average 1.9759326113116726) internal successors, (1642), 833 states have internal predecessors, (1642), 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-12 21:29:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 21:29:20,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:20,336 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:29:20,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:20,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:20,341 INFO L85 PathProgramCache]: Analyzing trace with hash 59447333, now seen corresponding path program 1 times [2024-10-12 21:29:20,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:20,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837431861] [2024-10-12 21:29:20,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:20,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:20,546 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-12 21:29:20,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:20,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837431861] [2024-10-12 21:29:20,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837431861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:20,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:20,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:29:20,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956789779] [2024-10-12 21:29:20,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:20,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 21:29:20,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:20,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 21:29:20,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 21:29:20,600 INFO L87 Difference]: Start difference. First operand has 834 states, 831 states have (on average 1.9759326113116726) internal successors, (1642), 833 states have internal predecessors, (1642), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-12 21:29:20,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:20,702 INFO L93 Difference]: Finished difference Result 1633 states and 3216 transitions. [2024-10-12 21:29:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 21:29:20,705 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 19 [2024-10-12 21:29:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:20,730 INFO L225 Difference]: With dead ends: 1633 [2024-10-12 21:29:20,733 INFO L226 Difference]: Without dead ends: 830 [2024-10-12 21:29:20,741 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-12 21:29:20,744 INFO L432 NwaCegarLoop]: 1571 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:20,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1571 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:29:20,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-10-12 21:29:20,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2024-10-12 21:29:20,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 828 states have (on average 1.8973429951690821) internal successors, (1571), 829 states have internal predecessors, (1571), 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-12 21:29:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1571 transitions. [2024-10-12 21:29:20,851 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1571 transitions. Word has length 19 [2024-10-12 21:29:20,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:20,855 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1571 transitions. [2024-10-12 21:29:20,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-12 21:29:20,855 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1571 transitions. [2024-10-12 21:29:20,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 21:29:20,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:20,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:29:20,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:29:20,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:20,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:20,861 INFO L85 PathProgramCache]: Analyzing trace with hash -778166733, now seen corresponding path program 1 times [2024-10-12 21:29:20,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:20,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392980239] [2024-10-12 21:29:20,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:20,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:20,973 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-12 21:29:20,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:20,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392980239] [2024-10-12 21:29:20,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392980239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:20,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:20,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:29:20,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171270843] [2024-10-12 21:29:20,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:20,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:29:20,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:20,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:29:20,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:29:20,977 INFO L87 Difference]: Start difference. First operand 830 states and 1571 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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-12 21:29:24,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:24,161 INFO L93 Difference]: Finished difference Result 2334 states and 4444 transitions. [2024-10-12 21:29:24,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:29:24,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 19 [2024-10-12 21:29:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:24,166 INFO L225 Difference]: With dead ends: 2334 [2024-10-12 21:29:24,166 INFO L226 Difference]: Without dead ends: 1581 [2024-10-12 21:29:24,167 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-12 21:29:24,168 INFO L432 NwaCegarLoop]: 597 mSDtfsCounter, 914 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:24,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 604 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-12 21:29:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2024-10-12 21:29:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1581. [2024-10-12 21:29:24,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1579 states have (on average 1.6149461684610513) internal successors, (2550), 1580 states have internal predecessors, (2550), 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-12 21:29:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2550 transitions. [2024-10-12 21:29:24,189 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2550 transitions. Word has length 19 [2024-10-12 21:29:24,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:24,190 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2550 transitions. [2024-10-12 21:29:24,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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-12 21:29:24,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2550 transitions. [2024-10-12 21:29:24,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 21:29:24,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:24,191 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] [2024-10-12 21:29:24,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:29:24,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:24,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:24,192 INFO L85 PathProgramCache]: Analyzing trace with hash 891911913, now seen corresponding path program 1 times [2024-10-12 21:29:24,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:24,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089535682] [2024-10-12 21:29:24,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:24,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:24,311 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-12 21:29:24,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:24,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089535682] [2024-10-12 21:29:24,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089535682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:24,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:24,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:29:24,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412493016] [2024-10-12 21:29:24,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:24,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:29:24,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:24,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:29:24,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:29:24,314 INFO L87 Difference]: Start difference. First operand 1581 states and 2550 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-12 21:29:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:24,378 INFO L93 Difference]: Finished difference Result 1625 states and 2619 transitions. [2024-10-12 21:29:24,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:29:24,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2024-10-12 21:29:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:24,383 INFO L225 Difference]: With dead ends: 1625 [2024-10-12 21:29:24,384 INFO L226 Difference]: Without dead ends: 1581 [2024-10-12 21:29:24,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:29:24,387 INFO L432 NwaCegarLoop]: 1568 mSDtfsCounter, 0 mSDsluCounter, 3101 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4669 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:24,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4669 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:29:24,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2024-10-12 21:29:24,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1581. [2024-10-12 21:29:24,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1579 states have (on average 1.5953134895503482) internal successors, (2519), 1580 states have internal predecessors, (2519), 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-12 21:29:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2519 transitions. [2024-10-12 21:29:24,412 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2519 transitions. Word has length 21 [2024-10-12 21:29:24,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:24,414 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2519 transitions. [2024-10-12 21:29:24,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-12 21:29:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2519 transitions. [2024-10-12 21:29:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 21:29:24,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:24,416 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] [2024-10-12 21:29:24,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:29:24,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:24,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:24,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1081643968, now seen corresponding path program 1 times [2024-10-12 21:29:24,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:24,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059568553] [2024-10-12 21:29:24,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:24,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:24,596 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-12 21:29:24,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:24,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059568553] [2024-10-12 21:29:24,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059568553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:24,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:24,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:29:24,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155968342] [2024-10-12 21:29:24,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:24,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:29:24,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:24,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:29:24,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:29:24,598 INFO L87 Difference]: Start difference. First operand 1581 states and 2519 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-12 21:29:24,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:24,812 INFO L93 Difference]: Finished difference Result 1991 states and 3179 transitions. [2024-10-12 21:29:24,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 21:29:24,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 51 [2024-10-12 21:29:24,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:24,817 INFO L225 Difference]: With dead ends: 1991 [2024-10-12 21:29:24,817 INFO L226 Difference]: Without dead ends: 1950 [2024-10-12 21:29:24,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-12 21:29:24,818 INFO L432 NwaCegarLoop]: 1533 mSDtfsCounter, 7933 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7933 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:24,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7933 Valid, 2700 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:29:24,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2024-10-12 21:29:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1620. [2024-10-12 21:29:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1618 states have (on average 1.5957972805933252) internal successors, (2582), 1619 states have internal predecessors, (2582), 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-12 21:29:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2582 transitions. [2024-10-12 21:29:24,869 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2582 transitions. Word has length 51 [2024-10-12 21:29:24,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:24,870 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2582 transitions. [2024-10-12 21:29:24,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-12 21:29:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2582 transitions. [2024-10-12 21:29:24,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 21:29:24,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:24,875 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] [2024-10-12 21:29:24,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:29:24,875 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:24,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:24,876 INFO L85 PathProgramCache]: Analyzing trace with hash -223517424, now seen corresponding path program 1 times [2024-10-12 21:29:24,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:24,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725675033] [2024-10-12 21:29:24,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:24,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:24,948 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-12 21:29:24,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:24,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725675033] [2024-10-12 21:29:24,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725675033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:24,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:24,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:29:24,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022416835] [2024-10-12 21:29:24,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:24,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:29:24,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:24,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:29:24,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:29:24,951 INFO L87 Difference]: Start difference. First operand 1620 states and 2582 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-12 21:29:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:24,981 INFO L93 Difference]: Finished difference Result 1769 states and 2821 transitions. [2024-10-12 21:29:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:29:24,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 53 [2024-10-12 21:29:24,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:24,986 INFO L225 Difference]: With dead ends: 1769 [2024-10-12 21:29:24,986 INFO L226 Difference]: Without dead ends: 1689 [2024-10-12 21:29:24,987 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-12 21:29:24,989 INFO L432 NwaCegarLoop]: 1535 mSDtfsCounter, 1480 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:24,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1595 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:29:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2024-10-12 21:29:25,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1687. [2024-10-12 21:29:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1685 states have (on average 1.5952522255192878) internal successors, (2688), 1686 states have internal predecessors, (2688), 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-12 21:29:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2688 transitions. [2024-10-12 21:29:25,010 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2688 transitions. Word has length 53 [2024-10-12 21:29:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:25,012 INFO L471 AbstractCegarLoop]: Abstraction has 1687 states and 2688 transitions. [2024-10-12 21:29:25,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-12 21:29:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2688 transitions. [2024-10-12 21:29:25,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 21:29:25,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:25,013 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] [2024-10-12 21:29:25,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:29:25,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:25,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:25,013 INFO L85 PathProgramCache]: Analyzing trace with hash -221372472, now seen corresponding path program 1 times [2024-10-12 21:29:25,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:25,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101991269] [2024-10-12 21:29:25,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:25,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:25,255 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-12 21:29:25,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:25,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101991269] [2024-10-12 21:29:25,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101991269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:25,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:25,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:29:25,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864489216] [2024-10-12 21:29:25,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:25,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:29:25,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:25,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:29:25,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:29:25,257 INFO L87 Difference]: Start difference. First operand 1687 states and 2688 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-12 21:29:25,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:25,430 INFO L93 Difference]: Finished difference Result 1836 states and 2924 transitions. [2024-10-12 21:29:25,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:29:25,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 53 [2024-10-12 21:29:25,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:25,436 INFO L225 Difference]: With dead ends: 1836 [2024-10-12 21:29:25,437 INFO L226 Difference]: Without dead ends: 1689 [2024-10-12 21:29:25,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:29:25,438 INFO L432 NwaCegarLoop]: 1530 mSDtfsCounter, 7439 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7439 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:25,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7439 Valid, 1775 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:29:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2024-10-12 21:29:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1687. [2024-10-12 21:29:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1685 states have (on average 1.59406528189911) internal successors, (2686), 1686 states have internal predecessors, (2686), 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-12 21:29:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2686 transitions. [2024-10-12 21:29:25,455 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2686 transitions. Word has length 53 [2024-10-12 21:29:25,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:25,456 INFO L471 AbstractCegarLoop]: Abstraction has 1687 states and 2686 transitions. [2024-10-12 21:29:25,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-12 21:29:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2686 transitions. [2024-10-12 21:29:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 21:29:25,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:25,457 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] [2024-10-12 21:29:25,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:29:25,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:25,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:25,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1598312521, now seen corresponding path program 1 times [2024-10-12 21:29:25,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:25,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047670672] [2024-10-12 21:29:25,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:25,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:25,550 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-12 21:29:25,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:25,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047670672] [2024-10-12 21:29:25,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047670672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:25,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:25,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:29:25,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825449427] [2024-10-12 21:29:25,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:25,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:29:25,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:25,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:29:25,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:29:25,552 INFO L87 Difference]: Start difference. First operand 1687 states and 2686 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-12 21:29:25,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:25,588 INFO L93 Difference]: Finished difference Result 1693 states and 2693 transitions. [2024-10-12 21:29:25,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:29:25,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 54 [2024-10-12 21:29:25,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:25,593 INFO L225 Difference]: With dead ends: 1693 [2024-10-12 21:29:25,593 INFO L226 Difference]: Without dead ends: 1691 [2024-10-12 21:29:25,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:29:25,594 INFO L432 NwaCegarLoop]: 1536 mSDtfsCounter, 0 mSDsluCounter, 3064 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4600 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:25,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4600 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:29:25,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2024-10-12 21:29:25,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1691. [2024-10-12 21:29:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1689 states have (on average 1.5920663114268798) internal successors, (2689), 1690 states have internal predecessors, (2689), 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-12 21:29:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2689 transitions. [2024-10-12 21:29:25,612 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2689 transitions. Word has length 54 [2024-10-12 21:29:25,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:25,612 INFO L471 AbstractCegarLoop]: Abstraction has 1691 states and 2689 transitions. [2024-10-12 21:29:25,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-12 21:29:25,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2689 transitions. [2024-10-12 21:29:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 21:29:25,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:25,613 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] [2024-10-12 21:29:25,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:29:25,613 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:25,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:25,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1229565960, now seen corresponding path program 1 times [2024-10-12 21:29:25,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:25,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435807651] [2024-10-12 21:29:25,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:25,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:25,660 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-12 21:29:25,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:25,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435807651] [2024-10-12 21:29:25,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435807651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:25,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:25,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:29:25,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561616860] [2024-10-12 21:29:25,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:25,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:29:25,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:25,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:29:25,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:29:25,662 INFO L87 Difference]: Start difference. First operand 1691 states and 2689 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-12 21:29:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:25,690 INFO L93 Difference]: Finished difference Result 1853 states and 2942 transitions. [2024-10-12 21:29:25,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:29:25,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2024-10-12 21:29:25,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:25,695 INFO L225 Difference]: With dead ends: 1853 [2024-10-12 21:29:25,695 INFO L226 Difference]: Without dead ends: 1769 [2024-10-12 21:29:25,696 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-12 21:29:25,696 INFO L432 NwaCegarLoop]: 1587 mSDtfsCounter, 1494 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:25,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1653 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:29:25,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2024-10-12 21:29:25,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1767. [2024-10-12 21:29:25,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1765 states have (on average 1.589801699716714) internal successors, (2806), 1766 states have internal predecessors, (2806), 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-12 21:29:25,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2806 transitions. [2024-10-12 21:29:25,716 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2806 transitions. Word has length 55 [2024-10-12 21:29:25,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:25,716 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 2806 transitions. [2024-10-12 21:29:25,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-12 21:29:25,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2806 transitions. [2024-10-12 21:29:25,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 21:29:25,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:25,717 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] [2024-10-12 21:29:25,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:29:25,717 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:25,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:25,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1000926728, now seen corresponding path program 1 times [2024-10-12 21:29:25,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:25,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245627137] [2024-10-12 21:29:25,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:25,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:25,757 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-12 21:29:25,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:25,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245627137] [2024-10-12 21:29:25,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245627137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:25,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:25,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:29:25,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272379649] [2024-10-12 21:29:25,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:25,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:29:25,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:25,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:29:25,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:29:25,759 INFO L87 Difference]: Start difference. First operand 1767 states and 2806 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-12 21:29:25,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:25,793 INFO L93 Difference]: Finished difference Result 2193 states and 3466 transitions. [2024-10-12 21:29:25,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:29:25,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2024-10-12 21:29:25,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:25,799 INFO L225 Difference]: With dead ends: 2193 [2024-10-12 21:29:25,799 INFO L226 Difference]: Without dead ends: 1968 [2024-10-12 21:29:25,799 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-12 21:29:25,800 INFO L432 NwaCegarLoop]: 1579 mSDtfsCounter, 1490 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:25,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1653 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:29:25,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2024-10-12 21:29:25,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1966. [2024-10-12 21:29:25,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1964 states have (on average 1.5824847250509164) internal successors, (3108), 1965 states have internal predecessors, (3108), 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-12 21:29:25,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 3108 transitions. [2024-10-12 21:29:25,823 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 3108 transitions. Word has length 55 [2024-10-12 21:29:25,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:25,823 INFO L471 AbstractCegarLoop]: Abstraction has 1966 states and 3108 transitions. [2024-10-12 21:29:25,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-12 21:29:25,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 3108 transitions. [2024-10-12 21:29:25,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 21:29:25,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:25,824 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] [2024-10-12 21:29:25,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:29:25,824 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:25,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:25,824 INFO L85 PathProgramCache]: Analyzing trace with hash 375270664, now seen corresponding path program 1 times [2024-10-12 21:29:25,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:25,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078554543] [2024-10-12 21:29:25,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:25,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:25,857 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-12 21:29:25,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:25,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078554543] [2024-10-12 21:29:25,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078554543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:25,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:25,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:29:25,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539083478] [2024-10-12 21:29:25,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:25,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:29:25,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:25,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:29:25,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:29:25,858 INFO L87 Difference]: Start difference. First operand 1966 states and 3108 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-12 21:29:25,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:25,893 INFO L93 Difference]: Finished difference Result 2766 states and 4330 transitions. [2024-10-12 21:29:25,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:29:25,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2024-10-12 21:29:25,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:25,899 INFO L225 Difference]: With dead ends: 2766 [2024-10-12 21:29:25,899 INFO L226 Difference]: Without dead ends: 2342 [2024-10-12 21:29:25,900 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-12 21:29:25,900 INFO L432 NwaCegarLoop]: 1577 mSDtfsCounter, 1488 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:25,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1655 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:29:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2024-10-12 21:29:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 2340. [2024-10-12 21:29:25,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2340 states, 2338 states have (on average 1.5671514114627887) internal successors, (3664), 2339 states have internal predecessors, (3664), 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-12 21:29:25,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 3664 transitions. [2024-10-12 21:29:25,934 INFO L78 Accepts]: Start accepts. Automaton has 2340 states and 3664 transitions. Word has length 55 [2024-10-12 21:29:25,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:25,934 INFO L471 AbstractCegarLoop]: Abstraction has 2340 states and 3664 transitions. [2024-10-12 21:29:25,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-12 21:29:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 3664 transitions. [2024-10-12 21:29:25,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 21:29:25,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:25,935 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] [2024-10-12 21:29:25,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:29:25,936 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:25,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:25,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1264004104, now seen corresponding path program 1 times [2024-10-12 21:29:25,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:25,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100299990] [2024-10-12 21:29:25,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:25,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:25,990 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-12 21:29:25,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:25,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100299990] [2024-10-12 21:29:25,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100299990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:25,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:25,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:29:25,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789427337] [2024-10-12 21:29:25,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:25,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:29:25,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:25,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:29:25,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:29:25,992 INFO L87 Difference]: Start difference. First operand 2340 states and 3664 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-12 21:29:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:26,042 INFO L93 Difference]: Finished difference Result 3840 states and 5914 transitions. [2024-10-12 21:29:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:29:26,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2024-10-12 21:29:26,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:26,051 INFO L225 Difference]: With dead ends: 3840 [2024-10-12 21:29:26,051 INFO L226 Difference]: Without dead ends: 3042 [2024-10-12 21:29:26,052 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-12 21:29:26,053 INFO L432 NwaCegarLoop]: 1575 mSDtfsCounter, 1486 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:26,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1657 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:29:26,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2024-10-12 21:29:26,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 3040. [2024-10-12 21:29:26,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3040 states, 3038 states have (on average 1.5404871626069783) internal successors, (4680), 3039 states have internal predecessors, (4680), 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-12 21:29:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 3040 states and 4680 transitions. [2024-10-12 21:29:26,107 INFO L78 Accepts]: Start accepts. Automaton has 3040 states and 4680 transitions. Word has length 55 [2024-10-12 21:29:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:26,108 INFO L471 AbstractCegarLoop]: Abstraction has 3040 states and 4680 transitions. [2024-10-12 21:29:26,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-12 21:29:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3040 states and 4680 transitions. [2024-10-12 21:29:26,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 21:29:26,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:26,109 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] [2024-10-12 21:29:26,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:29:26,109 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:26,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:26,109 INFO L85 PathProgramCache]: Analyzing trace with hash 960982792, now seen corresponding path program 1 times [2024-10-12 21:29:26,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:26,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087475729] [2024-10-12 21:29:26,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:26,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:26,164 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-12 21:29:26,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:26,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087475729] [2024-10-12 21:29:26,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087475729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:26,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:26,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:29:26,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631051944] [2024-10-12 21:29:26,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:26,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:29:26,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:26,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:29:26,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:29:26,167 INFO L87 Difference]: Start difference. First operand 3040 states and 4680 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-12 21:29:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:26,338 INFO L93 Difference]: Finished difference Result 5844 states and 8794 transitions. [2024-10-12 21:29:26,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:29:26,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2024-10-12 21:29:26,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:26,365 INFO L225 Difference]: With dead ends: 5844 [2024-10-12 21:29:26,365 INFO L226 Difference]: Without dead ends: 4346 [2024-10-12 21:29:26,368 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-12 21:29:26,369 INFO L432 NwaCegarLoop]: 1589 mSDtfsCounter, 1492 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:26,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1659 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:29:26,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2024-10-12 21:29:26,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 4344. [2024-10-12 21:29:26,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4344 states, 4342 states have (on average 1.501612160294795) internal successors, (6520), 4343 states have internal predecessors, (6520), 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-12 21:29:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4344 states to 4344 states and 6520 transitions. [2024-10-12 21:29:26,474 INFO L78 Accepts]: Start accepts. Automaton has 4344 states and 6520 transitions. Word has length 55 [2024-10-12 21:29:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:26,475 INFO L471 AbstractCegarLoop]: Abstraction has 4344 states and 6520 transitions. [2024-10-12 21:29:26,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-12 21:29:26,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4344 states and 6520 transitions. [2024-10-12 21:29:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-12 21:29:26,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:26,477 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:29:26,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:29:26,478 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:26,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:26,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1241399441, now seen corresponding path program 1 times [2024-10-12 21:29:26,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:26,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133288499] [2024-10-12 21:29:26,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:26,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:29:26,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:26,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133288499] [2024-10-12 21:29:26,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133288499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:26,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:26,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:29:26,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532816974] [2024-10-12 21:29:26,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:26,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:29:26,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:26,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:29:26,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:29:26,621 INFO L87 Difference]: Start difference. First operand 4344 states and 6520 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-12 21:29:26,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:26,992 INFO L93 Difference]: Finished difference Result 18132 states and 26510 transitions. [2024-10-12 21:29:26,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:29:26,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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 73 [2024-10-12 21:29:26,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:27,020 INFO L225 Difference]: With dead ends: 18132 [2024-10-12 21:29:27,021 INFO L226 Difference]: Without dead ends: 16146 [2024-10-12 21:29:27,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:29:27,029 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 6291 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6291 SdHoareTripleChecker+Valid, 3561 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:27,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6291 Valid, 3561 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:29:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16146 states. [2024-10-12 21:29:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16146 to 6744. [2024-10-12 21:29:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6744 states, 6742 states have (on average 1.4773064372589737) internal successors, (9960), 6743 states have internal predecessors, (9960), 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-12 21:29:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 9960 transitions. [2024-10-12 21:29:27,288 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 9960 transitions. Word has length 73 [2024-10-12 21:29:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:27,289 INFO L471 AbstractCegarLoop]: Abstraction has 6744 states and 9960 transitions. [2024-10-12 21:29:27,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-12 21:29:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 9960 transitions. [2024-10-12 21:29:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-12 21:29:27,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:27,291 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:29:27,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:29:27,292 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:27,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:27,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1012760209, now seen corresponding path program 1 times [2024-10-12 21:29:27,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:27,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104535461] [2024-10-12 21:29:27,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:27,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 21:29:27,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:27,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104535461] [2024-10-12 21:29:27,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104535461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:27,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:27,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:29:27,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374738006] [2024-10-12 21:29:27,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:27,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:29:27,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:27,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:29:27,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:29:27,427 INFO L87 Difference]: Start difference. First operand 6744 states and 9960 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-12 21:29:27,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:27,839 INFO L93 Difference]: Finished difference Result 20932 states and 30542 transitions. [2024-10-12 21:29:27,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:29:27,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 73 [2024-10-12 21:29:27,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:27,868 INFO L225 Difference]: With dead ends: 20932 [2024-10-12 21:29:27,869 INFO L226 Difference]: Without dead ends: 18130 [2024-10-12 21:29:27,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:29:27,878 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 6336 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6336 SdHoareTripleChecker+Valid, 3592 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:27,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6336 Valid, 3592 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:29:27,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18130 states. [2024-10-12 21:29:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18130 to 10536. [2024-10-12 21:29:28,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10536 states, 10534 states have (on average 1.4604138978545662) internal successors, (15384), 10535 states have internal predecessors, (15384), 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-12 21:29:28,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10536 states to 10536 states and 15384 transitions. [2024-10-12 21:29:28,276 INFO L78 Accepts]: Start accepts. Automaton has 10536 states and 15384 transitions. Word has length 73 [2024-10-12 21:29:28,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:28,276 INFO L471 AbstractCegarLoop]: Abstraction has 10536 states and 15384 transitions. [2024-10-12 21:29:28,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-12 21:29:28,276 INFO L276 IsEmpty]: Start isEmpty. Operand 10536 states and 15384 transitions. [2024-10-12 21:29:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-12 21:29:28,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:28,278 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:29:28,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:29:28,278 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:28,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:28,279 INFO L85 PathProgramCache]: Analyzing trace with hash 387104145, now seen corresponding path program 1 times [2024-10-12 21:29:28,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:28,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894071319] [2024-10-12 21:29:28,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:28,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 21:29:28,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:28,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894071319] [2024-10-12 21:29:28,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894071319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:28,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:28,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:29:28,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203580497] [2024-10-12 21:29:28,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:28,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:29:28,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:28,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:29:28,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:29:28,386 INFO L87 Difference]: Start difference. First operand 10536 states and 15384 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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-12 21:29:28,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:28,763 INFO L93 Difference]: Finished difference Result 23732 states and 34558 transitions. [2024-10-12 21:29:28,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:29:28,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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 73 [2024-10-12 21:29:28,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:28,796 INFO L225 Difference]: With dead ends: 23732 [2024-10-12 21:29:28,796 INFO L226 Difference]: Without dead ends: 20930 [2024-10-12 21:29:28,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:29:28,806 INFO L432 NwaCegarLoop]: 1594 mSDtfsCounter, 6381 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6381 SdHoareTripleChecker+Valid, 3555 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:28,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6381 Valid, 3555 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:29:28,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20930 states. [2024-10-12 21:29:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20930 to 13336. [2024-10-12 21:29:29,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13336 states, 13334 states have (on average 1.4549272536373181) internal successors, (19400), 13335 states have internal predecessors, (19400), 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-12 21:29:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13336 states to 13336 states and 19400 transitions. [2024-10-12 21:29:29,127 INFO L78 Accepts]: Start accepts. Automaton has 13336 states and 19400 transitions. Word has length 73 [2024-10-12 21:29:29,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:29,127 INFO L471 AbstractCegarLoop]: Abstraction has 13336 states and 19400 transitions. [2024-10-12 21:29:29,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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-12 21:29:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 13336 states and 19400 transitions. [2024-10-12 21:29:29,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-12 21:29:29,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:29,129 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:29:29,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:29:29,129 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:29,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:29,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1275837585, now seen corresponding path program 1 times [2024-10-12 21:29:29,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:29,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138242827] [2024-10-12 21:29:29,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:29,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 21:29:29,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:29,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138242827] [2024-10-12 21:29:29,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138242827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:29,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:29,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:29:29,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82613163] [2024-10-12 21:29:29,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:29,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:29:29,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:29,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:29:29,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:29:29,236 INFO L87 Difference]: Start difference. First operand 13336 states and 19400 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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-12 21:29:29,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:29,736 INFO L93 Difference]: Finished difference Result 26532 states and 38574 transitions. [2024-10-12 21:29:29,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:29:29,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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 73 [2024-10-12 21:29:29,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:29,769 INFO L225 Difference]: With dead ends: 26532 [2024-10-12 21:29:29,770 INFO L226 Difference]: Without dead ends: 23730 [2024-10-12 21:29:29,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:29:29,778 INFO L432 NwaCegarLoop]: 1594 mSDtfsCounter, 6339 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6339 SdHoareTripleChecker+Valid, 3590 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:29,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6339 Valid, 3590 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:29:29,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23730 states. [2024-10-12 21:29:30,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23730 to 16136. [2024-10-12 21:29:30,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16136 states, 16134 states have (on average 1.4513449857443907) internal successors, (23416), 16135 states have internal predecessors, (23416), 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-12 21:29:30,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 23416 transitions. [2024-10-12 21:29:30,132 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 23416 transitions. Word has length 73 [2024-10-12 21:29:30,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:30,132 INFO L471 AbstractCegarLoop]: Abstraction has 16136 states and 23416 transitions. [2024-10-12 21:29:30,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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-12 21:29:30,132 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 23416 transitions. [2024-10-12 21:29:30,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-12 21:29:30,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:30,134 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:29:30,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:29:30,134 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:30,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:30,134 INFO L85 PathProgramCache]: Analyzing trace with hash 972816273, now seen corresponding path program 1 times [2024-10-12 21:29:30,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:30,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935238174] [2024-10-12 21:29:30,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:30,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 21:29:30,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:30,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935238174] [2024-10-12 21:29:30,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935238174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:30,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:30,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:29:30,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233391755] [2024-10-12 21:29:30,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:30,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:29:30,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:30,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:29:30,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:29:30,244 INFO L87 Difference]: Start difference. First operand 16136 states and 23416 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-12 21:29:30,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:30,687 INFO L93 Difference]: Finished difference Result 29332 states and 42590 transitions. [2024-10-12 21:29:30,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:29:30,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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 73 [2024-10-12 21:29:30,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:30,729 INFO L225 Difference]: With dead ends: 29332 [2024-10-12 21:29:30,729 INFO L226 Difference]: Without dead ends: 26530 [2024-10-12 21:29:30,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:29:30,740 INFO L432 NwaCegarLoop]: 1593 mSDtfsCounter, 6293 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6293 SdHoareTripleChecker+Valid, 3665 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:30,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6293 Valid, 3665 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:29:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26530 states. [2024-10-12 21:29:31,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26530 to 18936. [2024-10-12 21:29:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18936 states, 18934 states have (on average 1.4488222245695574) internal successors, (27432), 18935 states have internal predecessors, (27432), 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-12 21:29:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18936 states to 18936 states and 27432 transitions. [2024-10-12 21:29:31,260 INFO L78 Accepts]: Start accepts. Automaton has 18936 states and 27432 transitions. Word has length 73 [2024-10-12 21:29:31,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:31,261 INFO L471 AbstractCegarLoop]: Abstraction has 18936 states and 27432 transitions. [2024-10-12 21:29:31,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-12 21:29:31,261 INFO L276 IsEmpty]: Start isEmpty. Operand 18936 states and 27432 transitions. [2024-10-12 21:29:31,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 21:29:31,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:31,263 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:29:31,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:29:31,263 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:31,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:31,263 INFO L85 PathProgramCache]: Analyzing trace with hash 992660111, now seen corresponding path program 1 times [2024-10-12 21:29:31,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:31,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686859685] [2024-10-12 21:29:31,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:31,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:31,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:31,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686859685] [2024-10-12 21:29:31,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686859685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:31,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:31,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:29:31,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030288226] [2024-10-12 21:29:31,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:31,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:29:31,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:31,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:29:31,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:29:31,334 INFO L87 Difference]: Start difference. First operand 18936 states and 27432 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-12 21:29:31,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:31,574 INFO L93 Difference]: Finished difference Result 36332 states and 52410 transitions. [2024-10-12 21:29:31,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:29:31,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2024-10-12 21:29:31,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:31,603 INFO L225 Difference]: With dead ends: 36332 [2024-10-12 21:29:31,605 INFO L226 Difference]: Without dead ends: 18938 [2024-10-12 21:29:31,621 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-12 21:29:31,622 INFO L432 NwaCegarLoop]: 1571 mSDtfsCounter, 45 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3097 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:31,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3097 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:29:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18938 states. [2024-10-12 21:29:32,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18938 to 18936. [2024-10-12 21:29:32,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18936 states, 18934 states have (on average 1.433188972219288) internal successors, (27136), 18935 states have internal predecessors, (27136), 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-12 21:29:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18936 states to 18936 states and 27136 transitions. [2024-10-12 21:29:32,262 INFO L78 Accepts]: Start accepts. Automaton has 18936 states and 27136 transitions. Word has length 74 [2024-10-12 21:29:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:32,262 INFO L471 AbstractCegarLoop]: Abstraction has 18936 states and 27136 transitions. [2024-10-12 21:29:32,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-12 21:29:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 18936 states and 27136 transitions. [2024-10-12 21:29:32,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 21:29:32,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:32,265 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:29:32,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:29:32,265 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:32,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:32,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1570037031, now seen corresponding path program 1 times [2024-10-12 21:29:32,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:32,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723159004] [2024-10-12 21:29:32,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:32,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:32,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:32,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723159004] [2024-10-12 21:29:32,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723159004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:32,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:32,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:29:32,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828120829] [2024-10-12 21:29:32,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:32,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:29:32,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:32,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:29:32,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:29:32,376 INFO L87 Difference]: Start difference. First operand 18936 states and 27136 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-12 21:29:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:32,565 INFO L93 Difference]: Finished difference Result 25406 states and 36413 transitions. [2024-10-12 21:29:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:29:32,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 75 [2024-10-12 21:29:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:32,579 INFO L225 Difference]: With dead ends: 25406 [2024-10-12 21:29:32,579 INFO L226 Difference]: Without dead ends: 8012 [2024-10-12 21:29:32,594 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-12 21:29:32,595 INFO L432 NwaCegarLoop]: 1569 mSDtfsCounter, 39 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3094 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:32,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3094 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:29:32,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8012 states. [2024-10-12 21:29:32,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8012 to 8005. [2024-10-12 21:29:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8005 states, 8003 states have (on average 1.4520804698238161) internal successors, (11621), 8004 states have internal predecessors, (11621), 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-12 21:29:32,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8005 states to 8005 states and 11621 transitions. [2024-10-12 21:29:32,805 INFO L78 Accepts]: Start accepts. Automaton has 8005 states and 11621 transitions. Word has length 75 [2024-10-12 21:29:32,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:32,806 INFO L471 AbstractCegarLoop]: Abstraction has 8005 states and 11621 transitions. [2024-10-12 21:29:32,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-12 21:29:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 8005 states and 11621 transitions. [2024-10-12 21:29:32,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 21:29:32,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:32,808 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:29:32,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:29:32,809 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:32,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:32,809 INFO L85 PathProgramCache]: Analyzing trace with hash 681687453, now seen corresponding path program 1 times [2024-10-12 21:29:32,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:32,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409539003] [2024-10-12 21:29:32,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:32,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:32,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:32,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409539003] [2024-10-12 21:29:32,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409539003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:32,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:32,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:29:32,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387674790] [2024-10-12 21:29:32,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:32,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:29:32,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:32,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:29:32,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:29:32,904 INFO L87 Difference]: Start difference. First operand 8005 states and 11621 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-12 21:29:33,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:33,000 INFO L93 Difference]: Finished difference Result 11233 states and 16199 transitions. [2024-10-12 21:29:33,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:29:33,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2024-10-12 21:29:33,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:33,009 INFO L225 Difference]: With dead ends: 11233 [2024-10-12 21:29:33,009 INFO L226 Difference]: Without dead ends: 4783 [2024-10-12 21:29:33,015 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-12 21:29:33,016 INFO L432 NwaCegarLoop]: 1563 mSDtfsCounter, 41 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:33,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3073 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:29:33,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states. [2024-10-12 21:29:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 4781. [2024-10-12 21:29:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4781 states, 4779 states have (on average 1.463276836158192) internal successors, (6993), 4780 states have internal predecessors, (6993), 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-12 21:29:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4781 states to 4781 states and 6993 transitions. [2024-10-12 21:29:33,133 INFO L78 Accepts]: Start accepts. Automaton has 4781 states and 6993 transitions. Word has length 76 [2024-10-12 21:29:33,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:33,133 INFO L471 AbstractCegarLoop]: Abstraction has 4781 states and 6993 transitions. [2024-10-12 21:29:33,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-12 21:29:33,133 INFO L276 IsEmpty]: Start isEmpty. Operand 4781 states and 6993 transitions. [2024-10-12 21:29:33,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:29:33,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:33,135 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:29:33,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 21:29:33,135 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:33,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:33,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1046035925, now seen corresponding path program 1 times [2024-10-12 21:29:33,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:33,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255521288] [2024-10-12 21:29:33,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:33,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:33,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:33,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255521288] [2024-10-12 21:29:33,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255521288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:33,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:33,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:29:33,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394707085] [2024-10-12 21:29:33,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:33,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:29:33,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:33,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:29:33,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:29:33,229 INFO L87 Difference]: Start difference. First operand 4781 states and 6993 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-12 21:29:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:33,312 INFO L93 Difference]: Finished difference Result 6397 states and 9257 transitions. [2024-10-12 21:29:33,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:29:33,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2024-10-12 21:29:33,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:33,318 INFO L225 Difference]: With dead ends: 6397 [2024-10-12 21:29:33,318 INFO L226 Difference]: Without dead ends: 3171 [2024-10-12 21:29:33,322 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-12 21:29:33,323 INFO L432 NwaCegarLoop]: 1556 mSDtfsCounter, 38 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:33,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3058 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:29:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2024-10-12 21:29:33,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3169. [2024-10-12 21:29:33,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3169 states, 3167 states have (on average 1.4856330912535523) internal successors, (4705), 3168 states have internal predecessors, (4705), 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-12 21:29:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3169 states to 3169 states and 4705 transitions. [2024-10-12 21:29:33,369 INFO L78 Accepts]: Start accepts. Automaton has 3169 states and 4705 transitions. Word has length 78 [2024-10-12 21:29:33,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:33,369 INFO L471 AbstractCegarLoop]: Abstraction has 3169 states and 4705 transitions. [2024-10-12 21:29:33,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-12 21:29:33,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3169 states and 4705 transitions. [2024-10-12 21:29:33,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 21:29:33,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:33,370 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:29:33,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 21:29:33,371 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:33,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:33,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1010746425, now seen corresponding path program 1 times [2024-10-12 21:29:33,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:33,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789516252] [2024-10-12 21:29:33,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:33,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:33,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:33,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789516252] [2024-10-12 21:29:33,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789516252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:29:33,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:29:33,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:29:33,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172650560] [2024-10-12 21:29:33,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:29:33,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:29:33,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:33,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:29:33,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:29:33,451 INFO L87 Difference]: Start difference. First operand 3169 states and 4705 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-12 21:29:33,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:33,482 INFO L93 Difference]: Finished difference Result 3979 states and 5825 transitions. [2024-10-12 21:29:33,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:29:33,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2024-10-12 21:29:33,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:33,486 INFO L225 Difference]: With dead ends: 3979 [2024-10-12 21:29:33,486 INFO L226 Difference]: Without dead ends: 2365 [2024-10-12 21:29:33,487 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-12 21:29:33,488 INFO L432 NwaCegarLoop]: 1549 mSDtfsCounter, 35 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3043 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:33,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3043 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:29:33,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2024-10-12 21:29:33,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2363. [2024-10-12 21:29:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2361 states have (on average 1.513765353663702) internal successors, (3574), 2362 states have internal predecessors, (3574), 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-12 21:29:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3574 transitions. [2024-10-12 21:29:33,518 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3574 transitions. Word has length 80 [2024-10-12 21:29:33,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:33,518 INFO L471 AbstractCegarLoop]: Abstraction has 2363 states and 3574 transitions. [2024-10-12 21:29:33,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-12 21:29:33,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3574 transitions. [2024-10-12 21:29:33,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 21:29:33,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:33,519 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:29:33,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 21:29:33,520 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:33,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:33,520 INFO L85 PathProgramCache]: Analyzing trace with hash -385441849, now seen corresponding path program 1 times [2024-10-12 21:29:33,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:33,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427151184] [2024-10-12 21:29:33,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:33,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:34,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:34,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427151184] [2024-10-12 21:29:34,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427151184] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:29:34,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350181788] [2024-10-12 21:29:34,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:34,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:29:34,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:29:34,633 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:29:34,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 21:29:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:34,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 21:29:34,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:29:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:29:34,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:29:35,119 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:29:35,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350181788] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:29:35,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:29:35,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2024-10-12 21:29:35,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198466156] [2024-10-12 21:29:35,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:29:35,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-12 21:29:35,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:35,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-12 21:29:35,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-10-12 21:29:35,121 INFO L87 Difference]: Start difference. First operand 2363 states and 3574 transitions. Second operand has 18 states, 18 states have (on average 12.88888888888889) internal successors, (232), 18 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-12 21:29:37,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:37,505 INFO L93 Difference]: Finished difference Result 6332 states and 8852 transitions. [2024-10-12 21:29:37,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-12 21:29:37,506 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 12.88888888888889) internal successors, (232), 18 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 82 [2024-10-12 21:29:37,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:37,518 INFO L225 Difference]: With dead ends: 6332 [2024-10-12 21:29:37,518 INFO L226 Difference]: Without dead ends: 5524 [2024-10-12 21:29:37,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=717, Invalid=2705, Unknown=0, NotChecked=0, Total=3422 [2024-10-12 21:29:37,526 INFO L432 NwaCegarLoop]: 1507 mSDtfsCounter, 19006 mSDsluCounter, 3415 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19006 SdHoareTripleChecker+Valid, 4922 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:37,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19006 Valid, 4922 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:29:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2024-10-12 21:29:37,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 5318. [2024-10-12 21:29:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5318 states, 5316 states have (on average 1.3856282919488336) internal successors, (7366), 5317 states have internal predecessors, (7366), 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-12 21:29:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5318 states to 5318 states and 7366 transitions. [2024-10-12 21:29:37,679 INFO L78 Accepts]: Start accepts. Automaton has 5318 states and 7366 transitions. Word has length 82 [2024-10-12 21:29:37,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:37,679 INFO L471 AbstractCegarLoop]: Abstraction has 5318 states and 7366 transitions. [2024-10-12 21:29:37,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.88888888888889) internal successors, (232), 18 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-12 21:29:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 5318 states and 7366 transitions. [2024-10-12 21:29:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 21:29:37,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:37,680 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:29:37,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 21:29:37,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-12 21:29:37,882 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:37,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:37,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1282519057, now seen corresponding path program 1 times [2024-10-12 21:29:37,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:37,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291547824] [2024-10-12 21:29:37,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:37,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:38,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:38,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291547824] [2024-10-12 21:29:38,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291547824] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:29:38,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880272673] [2024-10-12 21:29:38,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:38,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:29:38,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:29:38,887 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:29:38,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 21:29:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:38,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-12 21:29:38,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:29:40,063 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:40,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:29:41,207 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:41,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880272673] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:29:41,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:29:41,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 34 [2024-10-12 21:29:41,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374543783] [2024-10-12 21:29:41,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:29:41,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-12 21:29:41,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:41,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-12 21:29:41,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2024-10-12 21:29:41,210 INFO L87 Difference]: Start difference. First operand 5318 states and 7366 transitions. Second operand has 34 states, 34 states have (on average 6.264705882352941) internal successors, (213), 34 states have internal predecessors, (213), 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-12 21:29:43,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:43,263 INFO L93 Difference]: Finished difference Result 15798 states and 21123 transitions. [2024-10-12 21:29:43,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-12 21:29:43,264 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.264705882352941) internal successors, (213), 34 states have internal predecessors, (213), 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 83 [2024-10-12 21:29:43,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:43,276 INFO L225 Difference]: With dead ends: 15798 [2024-10-12 21:29:43,276 INFO L226 Difference]: Without dead ends: 12301 [2024-10-12 21:29:43,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=968, Invalid=3192, Unknown=0, NotChecked=0, Total=4160 [2024-10-12 21:29:43,283 INFO L432 NwaCegarLoop]: 1529 mSDtfsCounter, 19016 mSDsluCounter, 6616 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19016 SdHoareTripleChecker+Valid, 8145 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:43,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19016 Valid, 8145 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:29:43,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12301 states. [2024-10-12 21:29:43,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12301 to 11999. [2024-10-12 21:29:43,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11999 states, 11997 states have (on average 1.3316662498958072) internal successors, (15976), 11998 states have internal predecessors, (15976), 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-12 21:29:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11999 states to 11999 states and 15976 transitions. [2024-10-12 21:29:43,651 INFO L78 Accepts]: Start accepts. Automaton has 11999 states and 15976 transitions. Word has length 83 [2024-10-12 21:29:43,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:43,651 INFO L471 AbstractCegarLoop]: Abstraction has 11999 states and 15976 transitions. [2024-10-12 21:29:43,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.264705882352941) internal successors, (213), 34 states have internal predecessors, (213), 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-12 21:29:43,652 INFO L276 IsEmpty]: Start isEmpty. Operand 11999 states and 15976 transitions. [2024-10-12 21:29:43,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 21:29:43,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:43,654 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:29:43,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 21:29:43,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-12 21:29:43,856 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:43,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:43,856 INFO L85 PathProgramCache]: Analyzing trace with hash -484723217, now seen corresponding path program 1 times [2024-10-12 21:29:43,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:43,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099808013] [2024-10-12 21:29:43,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:43,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:44,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:44,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099808013] [2024-10-12 21:29:44,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099808013] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:29:44,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304325668] [2024-10-12 21:29:44,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:44,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:29:44,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:29:44,109 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:29:44,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 21:29:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:44,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 21:29:44,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:29:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:44,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:29:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:45,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304325668] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:29:45,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:29:45,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-10-12 21:29:45,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536495904] [2024-10-12 21:29:45,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:29:45,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-12 21:29:45,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:45,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-12 21:29:45,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-10-12 21:29:45,075 INFO L87 Difference]: Start difference. First operand 11999 states and 15976 transitions. Second operand has 21 states, 21 states have (on average 8.333333333333334) internal successors, (175), 20 states have internal predecessors, (175), 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-12 21:29:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:45,759 INFO L93 Difference]: Finished difference Result 30366 states and 39771 transitions. [2024-10-12 21:29:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 21:29:45,759 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.333333333333334) internal successors, (175), 20 states have internal predecessors, (175), 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 83 [2024-10-12 21:29:45,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:45,782 INFO L225 Difference]: With dead ends: 30366 [2024-10-12 21:29:45,782 INFO L226 Difference]: Without dead ends: 20975 [2024-10-12 21:29:45,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2024-10-12 21:29:45,794 INFO L432 NwaCegarLoop]: 1504 mSDtfsCounter, 13669 mSDsluCounter, 3249 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13669 SdHoareTripleChecker+Valid, 4753 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:45,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13669 Valid, 4753 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:29:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20975 states. [2024-10-12 21:29:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20975 to 20971. [2024-10-12 21:29:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20971 states, 20969 states have (on average 1.3096952644379798) internal successors, (27463), 20970 states have internal predecessors, (27463), 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-12 21:29:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20971 states to 20971 states and 27463 transitions. [2024-10-12 21:29:46,470 INFO L78 Accepts]: Start accepts. Automaton has 20971 states and 27463 transitions. Word has length 83 [2024-10-12 21:29:46,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:46,470 INFO L471 AbstractCegarLoop]: Abstraction has 20971 states and 27463 transitions. [2024-10-12 21:29:46,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.333333333333334) internal successors, (175), 20 states have internal predecessors, (175), 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-12 21:29:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 20971 states and 27463 transitions. [2024-10-12 21:29:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 21:29:46,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:46,472 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:29:46,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 21:29:46,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:29:46,673 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:46,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:46,673 INFO L85 PathProgramCache]: Analyzing trace with hash 584444143, now seen corresponding path program 1 times [2024-10-12 21:29:46,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:46,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941565987] [2024-10-12 21:29:46,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:46,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:47,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:47,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941565987] [2024-10-12 21:29:47,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941565987] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:29:47,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058808975] [2024-10-12 21:29:47,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:47,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:29:47,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:29:47,087 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:29:47,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 21:29:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:47,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-12 21:29:47,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:29:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:47,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:29:48,440 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:48,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058808975] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:29:48,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:29:48,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2024-10-12 21:29:48,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990285998] [2024-10-12 21:29:48,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:29:48,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-12 21:29:48,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:48,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-12 21:29:48,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2024-10-12 21:29:48,445 INFO L87 Difference]: Start difference. First operand 20971 states and 27463 transitions. Second operand has 29 states, 29 states have (on average 7.0344827586206895) internal successors, (204), 29 states have internal predecessors, (204), 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-12 21:29:49,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:49,468 INFO L93 Difference]: Finished difference Result 38121 states and 49654 transitions. [2024-10-12 21:29:49,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 21:29:49,469 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.0344827586206895) internal successors, (204), 29 states have internal predecessors, (204), 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 83 [2024-10-12 21:29:49,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:49,498 INFO L225 Difference]: With dead ends: 38121 [2024-10-12 21:29:49,498 INFO L226 Difference]: Without dead ends: 21683 [2024-10-12 21:29:49,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=421, Invalid=1385, Unknown=0, NotChecked=0, Total=1806 [2024-10-12 21:29:49,512 INFO L432 NwaCegarLoop]: 1529 mSDtfsCounter, 11996 mSDsluCounter, 8048 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11996 SdHoareTripleChecker+Valid, 9577 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:49,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11996 Valid, 9577 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 21:29:49,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21683 states. [2024-10-12 21:29:50,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21683 to 21295. [2024-10-12 21:29:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21295 states, 21293 states have (on average 1.298924529187996) internal successors, (27658), 21294 states have internal predecessors, (27658), 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-12 21:29:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21295 states to 21295 states and 27658 transitions. [2024-10-12 21:29:50,166 INFO L78 Accepts]: Start accepts. Automaton has 21295 states and 27658 transitions. Word has length 83 [2024-10-12 21:29:50,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:50,167 INFO L471 AbstractCegarLoop]: Abstraction has 21295 states and 27658 transitions. [2024-10-12 21:29:50,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.0344827586206895) internal successors, (204), 29 states have internal predecessors, (204), 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-12 21:29:50,167 INFO L276 IsEmpty]: Start isEmpty. Operand 21295 states and 27658 transitions. [2024-10-12 21:29:50,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 21:29:50,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:50,168 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:29:50,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 21:29:50,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-12 21:29:50,369 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:50,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:50,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1856588261, now seen corresponding path program 1 times [2024-10-12 21:29:50,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:50,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371751842] [2024-10-12 21:29:50,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:50,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:50,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:50,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371751842] [2024-10-12 21:29:50,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371751842] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:29:50,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965698502] [2024-10-12 21:29:50,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:50,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:29:50,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:29:50,635 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:29:50,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 21:29:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:50,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 21:29:50,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:29:51,064 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:51,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:29:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:51,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965698502] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:29:51,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:29:51,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-10-12 21:29:51,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387030593] [2024-10-12 21:29:51,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:29:51,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-12 21:29:51,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:51,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-12 21:29:51,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2024-10-12 21:29:51,622 INFO L87 Difference]: Start difference. First operand 21295 states and 27658 transitions. Second operand has 21 states, 21 states have (on average 9.19047619047619) internal successors, (193), 20 states have internal predecessors, (193), 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-12 21:29:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:52,877 INFO L93 Difference]: Finished difference Result 60205 states and 77680 transitions. [2024-10-12 21:29:52,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 21:29:52,878 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.19047619047619) internal successors, (193), 20 states have internal predecessors, (193), 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 84 [2024-10-12 21:29:52,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:52,922 INFO L225 Difference]: With dead ends: 60205 [2024-10-12 21:29:52,922 INFO L226 Difference]: Without dead ends: 41690 [2024-10-12 21:29:52,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=693, Unknown=0, NotChecked=0, Total=930 [2024-10-12 21:29:52,938 INFO L432 NwaCegarLoop]: 1515 mSDtfsCounter, 15107 mSDsluCounter, 3236 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15107 SdHoareTripleChecker+Valid, 4751 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:52,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15107 Valid, 4751 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:29:52,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41690 states. [2024-10-12 21:29:54,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41690 to 41126. [2024-10-12 21:29:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41126 states, 41124 states have (on average 1.2729306487695748) internal successors, (52348), 41125 states have internal predecessors, (52348), 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-12 21:29:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41126 states to 41126 states and 52348 transitions. [2024-10-12 21:29:54,297 INFO L78 Accepts]: Start accepts. Automaton has 41126 states and 52348 transitions. Word has length 84 [2024-10-12 21:29:54,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:29:54,297 INFO L471 AbstractCegarLoop]: Abstraction has 41126 states and 52348 transitions. [2024-10-12 21:29:54,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.19047619047619) internal successors, (193), 20 states have internal predecessors, (193), 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-12 21:29:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 41126 states and 52348 transitions. [2024-10-12 21:29:54,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 21:29:54,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:29:54,300 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:29:54,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 21:29:54,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-12 21:29:54,505 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:29:54,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:29:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash 973270591, now seen corresponding path program 1 times [2024-10-12 21:29:54,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:29:54,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334371194] [2024-10-12 21:29:54,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:54,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:29:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:55,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:29:55,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334371194] [2024-10-12 21:29:55,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334371194] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:29:55,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709638716] [2024-10-12 21:29:55,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:29:55,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:29:55,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:29:55,037 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:29:55,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 21:29:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:29:55,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-12 21:29:55,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:29:55,698 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:55,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:29:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:29:56,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709638716] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:29:56,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:29:56,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2024-10-12 21:29:56,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886301629] [2024-10-12 21:29:56,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:29:56,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-12 21:29:56,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:29:56,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-12 21:29:56,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2024-10-12 21:29:56,902 INFO L87 Difference]: Start difference. First operand 41126 states and 52348 transitions. Second operand has 29 states, 29 states have (on average 8.206896551724139) internal successors, (238), 29 states have internal predecessors, (238), 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-12 21:29:59,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:29:59,795 INFO L93 Difference]: Finished difference Result 114190 states and 145025 transitions. [2024-10-12 21:29:59,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 21:29:59,796 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.206896551724139) internal successors, (238), 29 states have internal predecessors, (238), 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 85 [2024-10-12 21:29:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:29:59,884 INFO L225 Difference]: With dead ends: 114190 [2024-10-12 21:29:59,884 INFO L226 Difference]: Without dead ends: 81429 [2024-10-12 21:29:59,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=434, Invalid=1458, Unknown=0, NotChecked=0, Total=1892 [2024-10-12 21:29:59,911 INFO L432 NwaCegarLoop]: 1514 mSDtfsCounter, 19344 mSDsluCounter, 6458 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19344 SdHoareTripleChecker+Valid, 7972 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:29:59,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19344 Valid, 7972 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 21:29:59,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81429 states. [2024-10-12 21:30:02,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81429 to 80305. [2024-10-12 21:30:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80305 states, 80303 states have (on average 1.2513231137068355) internal successors, (100485), 80304 states have internal predecessors, (100485), 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-12 21:30:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80305 states to 80305 states and 100485 transitions. [2024-10-12 21:30:03,015 INFO L78 Accepts]: Start accepts. Automaton has 80305 states and 100485 transitions. Word has length 85 [2024-10-12 21:30:03,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:30:03,015 INFO L471 AbstractCegarLoop]: Abstraction has 80305 states and 100485 transitions. [2024-10-12 21:30:03,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.206896551724139) internal successors, (238), 29 states have internal predecessors, (238), 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-12 21:30:03,016 INFO L276 IsEmpty]: Start isEmpty. Operand 80305 states and 100485 transitions. [2024-10-12 21:30:03,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 21:30:03,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:30:03,022 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:30:03,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 21:30:03,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-12 21:30:03,228 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:30:03,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:30:03,228 INFO L85 PathProgramCache]: Analyzing trace with hash 520308313, now seen corresponding path program 1 times [2024-10-12 21:30:03,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:30:03,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551312694] [2024-10-12 21:30:03,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:30:03,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:30:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:30:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:30:04,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:30:04,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551312694] [2024-10-12 21:30:04,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551312694] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:30:04,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228401513] [2024-10-12 21:30:04,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:30:04,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:30:04,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:30:04,162 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:30:04,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 21:30:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:30:04,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-12 21:30:04,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:30:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:30:07,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:30:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:30:12,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228401513] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:30:12,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:30:12,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25, 23] total 57 [2024-10-12 21:30:12,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928627245] [2024-10-12 21:30:12,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:30:12,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-12 21:30:12,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:30:12,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-12 21:30:12,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=2787, Unknown=0, NotChecked=0, Total=3192 [2024-10-12 21:30:12,672 INFO L87 Difference]: Start difference. First operand 80305 states and 100485 transitions. Second operand has 57 states, 57 states have (on average 4.105263157894737) internal successors, (234), 57 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)