./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.7.ufo.UNBOUNDED.pals+Problem12_label00.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.7.ufo.UNBOUNDED.pals+Problem12_label00.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 958778a599a0592241cec2803e04add83a2302d606be24f73b4e8727645b338d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:36:27,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:36:28,000 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:36:28,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:36:28,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:36:28,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:36:28,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:36:28,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:36:28,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:36:28,021 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:36:28,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:36:28,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:36:28,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:36:28,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:36:28,023 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:36:28,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:36:28,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:36:28,023 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:36:28,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:36:28,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:36:28,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:36:28,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:36:28,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:36:28,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:36:28,028 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:36:28,028 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:36:28,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:36:28,029 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:36:28,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:36:28,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:36:28,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:36:28,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:36:28,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:36:28,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:36:28,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:36:28,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:36:28,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:36:28,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:36:28,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:36:28,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:36:28,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:36:28,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:36:28,032 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 -> 958778a599a0592241cec2803e04add83a2302d606be24f73b4e8727645b338d [2024-10-12 21:36:28,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:36:28,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:36:28,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:36:28,253 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:36:28,253 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:36:28,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label00.c [2024-10-12 21:36:29,571 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:36:29,919 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:36:29,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label00.c [2024-10-12 21:36:29,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60fecb87d/216e16ff59e04098ab149820ef926a6c/FLAG677eae5fe [2024-10-12 21:36:30,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60fecb87d/216e16ff59e04098ab149820ef926a6c [2024-10-12 21:36:30,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:36:30,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:36:30,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:36:30,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:36:30,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:36:30,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:36:30" (1/1) ... [2024-10-12 21:36:30,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649ac6fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:30, skipping insertion in model container [2024-10-12 21:36:30,155 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:36:30" (1/1) ... [2024-10-12 21:36:30,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:36:30,638 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.7.ufo.UNBOUNDED.pals+Problem12_label00.c[20454,20467] [2024-10-12 21:36:30,659 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.7.ufo.UNBOUNDED.pals+Problem12_label00.c[22329,22342] [2024-10-12 21:36:31,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:36:31,324 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:36:31,360 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.7.ufo.UNBOUNDED.pals+Problem12_label00.c[20454,20467] [2024-10-12 21:36:31,367 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.7.ufo.UNBOUNDED.pals+Problem12_label00.c[22329,22342] [2024-10-12 21:36:31,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:36:31,706 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:36:31,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:31 WrapperNode [2024-10-12 21:36:31,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:36:31,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:36:31,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:36:31,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:36:31,713 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:36:31" (1/1) ... [2024-10-12 21:36:31,752 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:36:31" (1/1) ... [2024-10-12 21:36:32,036 INFO L138 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5219 [2024-10-12 21:36:32,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:36:32,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:36:32,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:36:32,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:36:32,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:31" (1/1) ... [2024-10-12 21:36:32,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:31" (1/1) ... [2024-10-12 21:36:32,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:31" (1/1) ... [2024-10-12 21:36:32,208 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:36:32,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:31" (1/1) ... [2024-10-12 21:36:32,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:31" (1/1) ... [2024-10-12 21:36:32,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:31" (1/1) ... [2024-10-12 21:36:32,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:31" (1/1) ... [2024-10-12 21:36:32,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:31" (1/1) ... [2024-10-12 21:36:32,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:31" (1/1) ... [2024-10-12 21:36:32,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:36:32,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:36:32,455 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:36:32,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:36:32,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:31" (1/1) ... [2024-10-12 21:36:32,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:36:32,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:36:32,482 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:36:32,487 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:36:32,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:36:32,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:36:32,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:36:32,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:36:32,638 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:36:32,640 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:36:35,910 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-10-12 21:36:35,911 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:36:35,958 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:36:35,959 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 21:36:35,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:36:35 BoogieIcfgContainer [2024-10-12 21:36:35,959 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:36:35,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:36:35,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:36:35,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:36:35,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:36:30" (1/3) ... [2024-10-12 21:36:35,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315acf89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:36:35, skipping insertion in model container [2024-10-12 21:36:35,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:31" (2/3) ... [2024-10-12 21:36:35,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315acf89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:36:35, skipping insertion in model container [2024-10-12 21:36:35,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:36:35" (3/3) ... [2024-10-12 21:36:35,965 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label00.c [2024-10-12 21:36:35,977 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:36:35,978 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:36:36,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:36:36,039 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;@30c33f89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:36:36,039 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:36:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 867 states, 864 states have (on average 1.9710648148148149) internal successors, (1703), 866 states have internal predecessors, (1703), 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:36:36,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 21:36:36,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:36,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:36,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:36,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:36,057 INFO L85 PathProgramCache]: Analyzing trace with hash -740467373, now seen corresponding path program 1 times [2024-10-12 21:36:36,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:36,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542509170] [2024-10-12 21:36:36,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:36,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:36,201 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:36:36,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:36,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542509170] [2024-10-12 21:36:36,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542509170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:36,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:36,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:36:36,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756234496] [2024-10-12 21:36:36,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:36,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 21:36:36,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:36,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 21:36:36,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 21:36:36,230 INFO L87 Difference]: Start difference. First operand has 867 states, 864 states have (on average 1.9710648148148149) internal successors, (1703), 866 states have internal predecessors, (1703), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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:36:36,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:36,298 INFO L93 Difference]: Finished difference Result 1679 states and 3299 transitions. [2024-10-12 21:36:36,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 21:36:36,301 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2024-10-12 21:36:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:36,313 INFO L225 Difference]: With dead ends: 1679 [2024-10-12 21:36:36,314 INFO L226 Difference]: Without dead ends: 863 [2024-10-12 21:36:36,318 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:36:36,321 INFO L432 NwaCegarLoop]: 1631 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:36:36,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1631 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:36,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-10-12 21:36:36,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2024-10-12 21:36:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 861 states have (on average 1.8954703832752613) internal successors, (1632), 862 states have internal predecessors, (1632), 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:36:36,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1632 transitions. [2024-10-12 21:36:36,378 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1632 transitions. Word has length 15 [2024-10-12 21:36:36,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:36,378 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1632 transitions. [2024-10-12 21:36:36,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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:36:36,379 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1632 transitions. [2024-10-12 21:36:36,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 21:36:36,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:36,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:36,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:36:36,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:36,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:36,381 INFO L85 PathProgramCache]: Analyzing trace with hash -47268495, now seen corresponding path program 1 times [2024-10-12 21:36:36,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:36,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358801386] [2024-10-12 21:36:36,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:36,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:36,459 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:36:36,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:36,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358801386] [2024-10-12 21:36:36,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358801386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:36,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:36,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:36:36,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258270591] [2024-10-12 21:36:36,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:36,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:36,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:36,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:36,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:36,463 INFO L87 Difference]: Start difference. First operand 863 states and 1632 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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:36:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:39,427 INFO L93 Difference]: Finished difference Result 2367 states and 4505 transitions. [2024-10-12 21:36:39,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:39,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2024-10-12 21:36:39,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:39,438 INFO L225 Difference]: With dead ends: 2367 [2024-10-12 21:36:39,439 INFO L226 Difference]: Without dead ends: 1614 [2024-10-12 21:36:39,443 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:36:39,444 INFO L432 NwaCegarLoop]: 611 mSDtfsCounter, 996 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:36:39,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 618 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 21:36:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2024-10-12 21:36:39,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1614. [2024-10-12 21:36:39,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1612 states have (on average 1.6495037220843674) internal successors, (2659), 1613 states have internal predecessors, (2659), 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:36:39,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2659 transitions. [2024-10-12 21:36:39,489 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2659 transitions. Word has length 15 [2024-10-12 21:36:39,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:39,490 INFO L471 AbstractCegarLoop]: Abstraction has 1614 states and 2659 transitions. [2024-10-12 21:36:39,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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:36:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2659 transitions. [2024-10-12 21:36:39,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 21:36:39,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:39,492 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] [2024-10-12 21:36:39,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:36:39,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:39,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:39,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1401331215, now seen corresponding path program 1 times [2024-10-12 21:36:39,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:39,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126125364] [2024-10-12 21:36:39,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:39,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:39,672 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:36:39,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:39,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126125364] [2024-10-12 21:36:39,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126125364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:39,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:39,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:36:39,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669859000] [2024-10-12 21:36:39,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:39,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:36:39,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:39,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:36:39,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:36:39,675 INFO L87 Difference]: Start difference. First operand 1614 states and 2659 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:36:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:39,748 INFO L93 Difference]: Finished difference Result 1672 states and 2751 transitions. [2024-10-12 21:36:39,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:36:39,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2024-10-12 21:36:39,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:39,754 INFO L225 Difference]: With dead ends: 1672 [2024-10-12 21:36:39,755 INFO L226 Difference]: Without dead ends: 1614 [2024-10-12 21:36:39,755 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:36:39,756 INFO L432 NwaCegarLoop]: 1629 mSDtfsCounter, 0 mSDsluCounter, 3204 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4833 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:36:39,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4833 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:36:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2024-10-12 21:36:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1614. [2024-10-12 21:36:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1612 states have (on average 1.61848635235732) internal successors, (2609), 1613 states have internal predecessors, (2609), 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:36:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2609 transitions. [2024-10-12 21:36:39,781 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2609 transitions. Word has length 25 [2024-10-12 21:36:39,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:39,782 INFO L471 AbstractCegarLoop]: Abstraction has 1614 states and 2609 transitions. [2024-10-12 21:36:39,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:36:39,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2609 transitions. [2024-10-12 21:36:39,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 21:36:39,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:39,784 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:39,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:36:39,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:39,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:39,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1958226728, now seen corresponding path program 1 times [2024-10-12 21:36:39,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:39,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253097041] [2024-10-12 21:36:39,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:39,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:40,064 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:36:40,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:40,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253097041] [2024-10-12 21:36:40,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253097041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:40,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:40,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:36:40,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50730766] [2024-10-12 21:36:40,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:40,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:36:40,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:40,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:36:40,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:36:40,066 INFO L87 Difference]: Start difference. First operand 1614 states and 2609 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 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:36:40,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:40,393 INFO L93 Difference]: Finished difference Result 2384 states and 3855 transitions. [2024-10-12 21:36:40,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:36:40,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 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:36:40,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:40,400 INFO L225 Difference]: With dead ends: 2384 [2024-10-12 21:36:40,401 INFO L226 Difference]: Without dead ends: 2329 [2024-10-12 21:36:40,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-10-12 21:36:40,402 INFO L432 NwaCegarLoop]: 1573 mSDtfsCounter, 11585 mSDsluCounter, 2680 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11585 SdHoareTripleChecker+Valid, 4253 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:36:40,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11585 Valid, 4253 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:36:40,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2024-10-12 21:36:40,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 1667. [2024-10-12 21:36:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.6186186186186187) internal successors, (2695), 1666 states have internal predecessors, (2695), 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:36:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2695 transitions. [2024-10-12 21:36:40,429 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2695 transitions. Word has length 74 [2024-10-12 21:36:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:40,430 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2695 transitions. [2024-10-12 21:36:40,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 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:36:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2695 transitions. [2024-10-12 21:36:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 21:36:40,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:40,432 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:40,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:36:40,432 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:40,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:40,432 INFO L85 PathProgramCache]: Analyzing trace with hash -783812792, now seen corresponding path program 1 times [2024-10-12 21:36:40,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:40,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614734110] [2024-10-12 21:36:40,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:40,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:40,515 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:36:40,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:40,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614734110] [2024-10-12 21:36:40,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614734110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:40,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:40,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:36:40,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150175079] [2024-10-12 21:36:40,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:40,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:40,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:40,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:40,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:40,517 INFO L87 Difference]: Start difference. First operand 1667 states and 2695 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:36:40,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:40,549 INFO L93 Difference]: Finished difference Result 1872 states and 3026 transitions. [2024-10-12 21:36:40,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:40,550 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:36:40,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:40,555 INFO L225 Difference]: With dead ends: 1872 [2024-10-12 21:36:40,555 INFO L226 Difference]: Without dead ends: 1764 [2024-10-12 21:36:40,556 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:36:40,556 INFO L432 NwaCegarLoop]: 1575 mSDtfsCounter, 1498 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:36:40,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1656 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:40,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2024-10-12 21:36:40,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1760. [2024-10-12 21:36:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1758 states have (on average 1.617178612059158) internal successors, (2843), 1759 states have internal predecessors, (2843), 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:36:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2843 transitions. [2024-10-12 21:36:40,581 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2843 transitions. Word has length 76 [2024-10-12 21:36:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:40,582 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2843 transitions. [2024-10-12 21:36:40,582 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:36:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2843 transitions. [2024-10-12 21:36:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 21:36:40,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:40,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:40,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:36:40,584 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:40,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:40,584 INFO L85 PathProgramCache]: Analyzing trace with hash -781667840, now seen corresponding path program 1 times [2024-10-12 21:36:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:40,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031391909] [2024-10-12 21:36:40,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:40,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:40,978 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:36:40,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:40,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031391909] [2024-10-12 21:36:40,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031391909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:40,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:40,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:36:40,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794914045] [2024-10-12 21:36:40,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:40,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:36:40,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:40,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:36:40,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:36:40,980 INFO L87 Difference]: Start difference. First operand 1760 states and 2843 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:36:41,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:41,293 INFO L93 Difference]: Finished difference Result 1963 states and 3167 transitions. [2024-10-12 21:36:41,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:36:41,295 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:36:41,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:41,302 INFO L225 Difference]: With dead ends: 1963 [2024-10-12 21:36:41,302 INFO L226 Difference]: Without dead ends: 1762 [2024-10-12 21:36:41,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-12 21:36:41,306 INFO L432 NwaCegarLoop]: 1571 mSDtfsCounter, 10560 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10560 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:36:41,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10560 Valid, 2081 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:36:41,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2024-10-12 21:36:41,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1760. [2024-10-12 21:36:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1758 states have (on average 1.6160409556313993) internal successors, (2841), 1759 states have internal predecessors, (2841), 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:36:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2841 transitions. [2024-10-12 21:36:41,350 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2841 transitions. Word has length 76 [2024-10-12 21:36:41,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:41,351 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2841 transitions. [2024-10-12 21:36:41,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:36:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2841 transitions. [2024-10-12 21:36:41,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 21:36:41,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:41,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:41,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:36:41,352 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:41,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:41,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1409717390, now seen corresponding path program 1 times [2024-10-12 21:36:41,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:41,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043770249] [2024-10-12 21:36:41,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:41,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:41,514 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:36:41,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:41,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043770249] [2024-10-12 21:36:41,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043770249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:41,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:41,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:36:41,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625714128] [2024-10-12 21:36:41,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:41,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:36:41,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:41,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:36:41,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:36:41,516 INFO L87 Difference]: Start difference. First operand 1760 states and 2841 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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:36:41,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:41,554 INFO L93 Difference]: Finished difference Result 1766 states and 2848 transitions. [2024-10-12 21:36:41,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:36:41,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 77 [2024-10-12 21:36:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:41,561 INFO L225 Difference]: With dead ends: 1766 [2024-10-12 21:36:41,561 INFO L226 Difference]: Without dead ends: 1764 [2024-10-12 21:36:41,562 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:36:41,563 INFO L432 NwaCegarLoop]: 1578 mSDtfsCounter, 0 mSDsluCounter, 3148 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4726 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:36:41,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4726 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:41,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2024-10-12 21:36:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1764. [2024-10-12 21:36:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1762 states have (on average 1.6140749148694664) internal successors, (2844), 1763 states have internal predecessors, (2844), 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:36:41,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 2844 transitions. [2024-10-12 21:36:41,599 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 2844 transitions. Word has length 77 [2024-10-12 21:36:41,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:41,600 INFO L471 AbstractCegarLoop]: Abstraction has 1764 states and 2844 transitions. [2024-10-12 21:36:41,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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:36:41,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2844 transitions. [2024-10-12 21:36:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:36:41,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:41,602 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:41,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:36:41,602 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:41,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:41,603 INFO L85 PathProgramCache]: Analyzing trace with hash 89162976, now seen corresponding path program 1 times [2024-10-12 21:36:41,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:41,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578480986] [2024-10-12 21:36:41,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:41,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:41,673 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:36:41,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:41,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578480986] [2024-10-12 21:36:41,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578480986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:41,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:41,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:36:41,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955142409] [2024-10-12 21:36:41,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:41,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:41,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:41,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:41,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:41,680 INFO L87 Difference]: Start difference. First operand 1764 states and 2844 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:36:41,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:41,714 INFO L93 Difference]: Finished difference Result 2158 states and 3464 transitions. [2024-10-12 21:36:41,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:41,714 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:36:41,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:41,719 INFO L225 Difference]: With dead ends: 2158 [2024-10-12 21:36:41,719 INFO L226 Difference]: Without dead ends: 1953 [2024-10-12 21:36:41,720 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:36:41,723 INFO L432 NwaCegarLoop]: 1644 mSDtfsCounter, 1515 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1737 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:36:41,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1737 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2024-10-12 21:36:41,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1951. [2024-10-12 21:36:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1949 states have (on average 1.608517188301693) internal successors, (3135), 1950 states have internal predecessors, (3135), 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:36:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3135 transitions. [2024-10-12 21:36:41,753 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3135 transitions. Word has length 78 [2024-10-12 21:36:41,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:41,754 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 3135 transitions. [2024-10-12 21:36:41,754 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:36:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3135 transitions. [2024-10-12 21:36:41,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:36:41,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:41,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:41,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:36:41,755 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:41,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:41,756 INFO L85 PathProgramCache]: Analyzing trace with hash -321223712, now seen corresponding path program 1 times [2024-10-12 21:36:41,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:41,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712780631] [2024-10-12 21:36:41,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:41,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:41,800 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:36:41,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:41,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712780631] [2024-10-12 21:36:41,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712780631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:41,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:41,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:36:41,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236188299] [2024-10-12 21:36:41,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:41,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:41,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:41,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:41,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:41,802 INFO L87 Difference]: Start difference. First operand 1951 states and 3135 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:36:41,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:41,834 INFO L93 Difference]: Finished difference Result 2703 states and 4309 transitions. [2024-10-12 21:36:41,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:41,834 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:36:41,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:41,840 INFO L225 Difference]: With dead ends: 2703 [2024-10-12 21:36:41,840 INFO L226 Difference]: Without dead ends: 2311 [2024-10-12 21:36:41,841 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:36:41,842 INFO L432 NwaCegarLoop]: 1642 mSDtfsCounter, 1513 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1739 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:36:41,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1739 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:41,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2024-10-12 21:36:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2309. [2024-10-12 21:36:41,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2307 states have (on average 1.5973125270914608) internal successors, (3685), 2308 states have internal predecessors, (3685), 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:36:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3685 transitions. [2024-10-12 21:36:41,875 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3685 transitions. Word has length 78 [2024-10-12 21:36:41,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:41,876 INFO L471 AbstractCegarLoop]: Abstraction has 2309 states and 3685 transitions. [2024-10-12 21:36:41,876 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:36:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3685 transitions. [2024-10-12 21:36:41,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:36:41,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:41,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:41,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:36:41,877 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:41,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:41,877 INFO L85 PathProgramCache]: Analyzing trace with hash -549862944, now seen corresponding path program 1 times [2024-10-12 21:36:41,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:41,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317261586] [2024-10-12 21:36:41,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:41,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:41,918 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:36:41,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:41,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317261586] [2024-10-12 21:36:41,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317261586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:41,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:41,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:36:41,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883899011] [2024-10-12 21:36:41,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:41,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:41,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:41,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:41,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:41,920 INFO L87 Difference]: Start difference. First operand 2309 states and 3685 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:36:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:41,958 INFO L93 Difference]: Finished difference Result 3745 states and 5903 transitions. [2024-10-12 21:36:41,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:41,958 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:36:41,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:41,966 INFO L225 Difference]: With dead ends: 3745 [2024-10-12 21:36:41,966 INFO L226 Difference]: Without dead ends: 2995 [2024-10-12 21:36:41,968 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:36:41,968 INFO L432 NwaCegarLoop]: 1630 mSDtfsCounter, 1509 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 1735 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:36:41,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 1735 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2024-10-12 21:36:42,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2993. [2024-10-12 21:36:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2993 states, 2991 states have (on average 1.5784018722835171) internal successors, (4721), 2992 states have internal predecessors, (4721), 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:36:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 4721 transitions. [2024-10-12 21:36:42,016 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 4721 transitions. Word has length 78 [2024-10-12 21:36:42,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:42,017 INFO L471 AbstractCegarLoop]: Abstraction has 2993 states and 4721 transitions. [2024-10-12 21:36:42,017 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:36:42,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4721 transitions. [2024-10-12 21:36:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:36:42,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:42,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:42,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:36:42,018 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:42,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:42,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1175519008, now seen corresponding path program 1 times [2024-10-12 21:36:42,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:42,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038461570] [2024-10-12 21:36:42,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:42,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:42,061 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:36:42,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:42,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038461570] [2024-10-12 21:36:42,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038461570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:42,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:42,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:36:42,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595644133] [2024-10-12 21:36:42,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:42,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:42,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:42,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:42,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:42,063 INFO L87 Difference]: Start difference. First operand 2993 states and 4721 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:36:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:42,165 INFO L93 Difference]: Finished difference Result 5733 states and 8899 transitions. [2024-10-12 21:36:42,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:42,166 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:36:42,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:42,186 INFO L225 Difference]: With dead ends: 5733 [2024-10-12 21:36:42,190 INFO L226 Difference]: Without dead ends: 4299 [2024-10-12 21:36:42,193 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:36:42,197 INFO L432 NwaCegarLoop]: 1628 mSDtfsCounter, 1507 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1737 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:36:42,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1737 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:42,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4299 states. [2024-10-12 21:36:42,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4299 to 4297. [2024-10-12 21:36:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4297 states, 4295 states have (on average 1.5518044237485449) internal successors, (6665), 4296 states have internal predecessors, (6665), 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:36:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 6665 transitions. [2024-10-12 21:36:42,310 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 6665 transitions. Word has length 78 [2024-10-12 21:36:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:42,310 INFO L471 AbstractCegarLoop]: Abstraction has 4297 states and 6665 transitions. [2024-10-12 21:36:42,310 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:36:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 6665 transitions. [2024-10-12 21:36:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:36:42,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:42,311 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:42,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:36:42,311 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:42,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:42,312 INFO L85 PathProgramCache]: Analyzing trace with hash -286785568, now seen corresponding path program 1 times [2024-10-12 21:36:42,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:42,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758027325] [2024-10-12 21:36:42,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:42,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:42,357 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:36:42,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:42,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758027325] [2024-10-12 21:36:42,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758027325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:42,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:42,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:36:42,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491693838] [2024-10-12 21:36:42,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:42,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:42,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:42,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:42,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:42,359 INFO L87 Difference]: Start difference. First operand 4297 states and 6665 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:36:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:42,544 INFO L93 Difference]: Finished difference Result 9517 states and 14507 transitions. [2024-10-12 21:36:42,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:42,545 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:36:42,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:42,580 INFO L225 Difference]: With dead ends: 9517 [2024-10-12 21:36:42,584 INFO L226 Difference]: Without dead ends: 6779 [2024-10-12 21:36:42,593 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:36:42,594 INFO L432 NwaCegarLoop]: 1626 mSDtfsCounter, 1505 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1739 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:36:42,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1739 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:42,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6779 states. [2024-10-12 21:36:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6779 to 6777. [2024-10-12 21:36:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6777 states, 6775 states have (on average 1.5198523985239853) internal successors, (10297), 6776 states have internal predecessors, (10297), 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:36:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6777 states to 6777 states and 10297 transitions. [2024-10-12 21:36:42,813 INFO L78 Accepts]: Start accepts. Automaton has 6777 states and 10297 transitions. Word has length 78 [2024-10-12 21:36:42,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:42,814 INFO L471 AbstractCegarLoop]: Abstraction has 6777 states and 10297 transitions. [2024-10-12 21:36:42,814 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:36:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 6777 states and 10297 transitions. [2024-10-12 21:36:42,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:36:42,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:42,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:42,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:36:42,815 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:42,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash -589806880, now seen corresponding path program 1 times [2024-10-12 21:36:42,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:42,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431423449] [2024-10-12 21:36:42,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:42,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:42,868 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:36:42,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:42,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431423449] [2024-10-12 21:36:42,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431423449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:42,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:42,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:36:42,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52755771] [2024-10-12 21:36:42,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:42,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:42,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:42,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:42,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:42,871 INFO L87 Difference]: Start difference. First operand 6777 states and 10297 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:36:43,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:43,002 INFO L93 Difference]: Finished difference Result 16701 states and 24955 transitions. [2024-10-12 21:36:43,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:43,003 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:36:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:43,021 INFO L225 Difference]: With dead ends: 16701 [2024-10-12 21:36:43,021 INFO L226 Difference]: Without dead ends: 11483 [2024-10-12 21:36:43,030 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:36:43,031 INFO L432 NwaCegarLoop]: 1640 mSDtfsCounter, 1511 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1741 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:36:43,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1511 Valid, 1741 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11483 states. [2024-10-12 21:36:43,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11483 to 11481. [2024-10-12 21:36:43,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11481 states, 11479 states have (on average 1.4852339053924557) internal successors, (17049), 11480 states have internal predecessors, (17049), 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:36:43,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11481 states to 11481 states and 17049 transitions. [2024-10-12 21:36:43,269 INFO L78 Accepts]: Start accepts. Automaton has 11481 states and 17049 transitions. Word has length 78 [2024-10-12 21:36:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:43,270 INFO L471 AbstractCegarLoop]: Abstraction has 11481 states and 17049 transitions. [2024-10-12 21:36:43,270 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:36:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 11481 states and 17049 transitions. [2024-10-12 21:36:43,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 21:36:43,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:43,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:43,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:36:43,271 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:43,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:43,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1500697979, now seen corresponding path program 1 times [2024-10-12 21:36:43,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:43,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648555050] [2024-10-12 21:36:43,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:43,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:43,318 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:36:43,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:43,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648555050] [2024-10-12 21:36:43,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648555050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:43,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:43,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:36:43,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619967321] [2024-10-12 21:36:43,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:43,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:43,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:43,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:43,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:43,320 INFO L87 Difference]: Start difference. First operand 11481 states and 17049 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:36:43,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:43,484 INFO L93 Difference]: Finished difference Result 21728 states and 32287 transitions. [2024-10-12 21:36:43,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:43,485 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:36:43,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:43,510 INFO L225 Difference]: With dead ends: 21728 [2024-10-12 21:36:43,510 INFO L226 Difference]: Without dead ends: 16221 [2024-10-12 21:36:43,521 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:36:43,522 INFO L432 NwaCegarLoop]: 1649 mSDtfsCounter, 1514 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1738 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:36:43,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1738 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:43,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16221 states. [2024-10-12 21:36:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16221 to 16219. [2024-10-12 21:36:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16219 states, 16217 states have (on average 1.4737004378121723) internal successors, (23899), 16218 states have internal predecessors, (23899), 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:36:43,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16219 states to 16219 states and 23899 transitions. [2024-10-12 21:36:43,900 INFO L78 Accepts]: Start accepts. Automaton has 16219 states and 23899 transitions. Word has length 80 [2024-10-12 21:36:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:43,901 INFO L471 AbstractCegarLoop]: Abstraction has 16219 states and 23899 transitions. [2024-10-12 21:36:43,901 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:36:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 16219 states and 23899 transitions. [2024-10-12 21:36:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 21:36:43,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:43,903 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:43,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:36:43,903 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:43,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:43,904 INFO L85 PathProgramCache]: Analyzing trace with hash -732669676, now seen corresponding path program 1 times [2024-10-12 21:36:43,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:43,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735925996] [2024-10-12 21:36:43,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:43,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:36:43,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:43,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735925996] [2024-10-12 21:36:43,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735925996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:43,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:43,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:36:43,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644708079] [2024-10-12 21:36:43,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:43,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:43,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:43,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:43,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:43,971 INFO L87 Difference]: Start difference. First operand 16219 states and 23899 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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:36:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:46,703 INFO L93 Difference]: Finished difference Result 19225 states and 28826 transitions. [2024-10-12 21:36:46,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:46,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 86 [2024-10-12 21:36:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:46,726 INFO L225 Difference]: With dead ends: 19225 [2024-10-12 21:36:46,727 INFO L226 Difference]: Without dead ends: 17721 [2024-10-12 21:36:46,731 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:36:46,731 INFO L432 NwaCegarLoop]: 1289 mSDtfsCounter, 753 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2417 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 3098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:36:46,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1438 Invalid, 3098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2417 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 21:36:46,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17721 states. [2024-10-12 21:36:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17721 to 17721. [2024-10-12 21:36:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17721 states, 17719 states have (on average 1.470455443309442) internal successors, (26055), 17720 states have internal predecessors, (26055), 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:36:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17721 states to 17721 states and 26055 transitions. [2024-10-12 21:36:47,005 INFO L78 Accepts]: Start accepts. Automaton has 17721 states and 26055 transitions. Word has length 86 [2024-10-12 21:36:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:47,005 INFO L471 AbstractCegarLoop]: Abstraction has 17721 states and 26055 transitions. [2024-10-12 21:36:47,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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:36:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 17721 states and 26055 transitions. [2024-10-12 21:36:47,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 21:36:47,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:47,006 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:47,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:36:47,007 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:47,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:47,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1054912749, now seen corresponding path program 1 times [2024-10-12 21:36:47,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:47,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701470429] [2024-10-12 21:36:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:36:47,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:47,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701470429] [2024-10-12 21:36:47,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701470429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:47,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:47,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:36:47,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193517492] [2024-10-12 21:36:47,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:47,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:47,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:47,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:47,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:47,070 INFO L87 Difference]: Start difference. First operand 17721 states and 26055 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 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:36:50,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:50,270 INFO L93 Difference]: Finished difference Result 23733 states and 35295 transitions. [2024-10-12 21:36:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:50,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 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 89 [2024-10-12 21:36:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:50,301 INFO L225 Difference]: With dead ends: 23733 [2024-10-12 21:36:50,301 INFO L226 Difference]: Without dead ends: 20727 [2024-10-12 21:36:50,309 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:36:50,310 INFO L432 NwaCegarLoop]: 633 mSDtfsCounter, 870 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 2926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:36:50,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 640 Invalid, 2926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 21:36:50,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20727 states. [2024-10-12 21:36:50,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20727 to 20725. [2024-10-12 21:36:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20725 states, 20723 states have (on average 1.4301018192346668) internal successors, (29636), 20724 states have internal predecessors, (29636), 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:36:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20725 states to 20725 states and 29636 transitions. [2024-10-12 21:36:50,784 INFO L78 Accepts]: Start accepts. Automaton has 20725 states and 29636 transitions. Word has length 89 [2024-10-12 21:36:50,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:50,784 INFO L471 AbstractCegarLoop]: Abstraction has 20725 states and 29636 transitions. [2024-10-12 21:36:50,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 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:36:50,785 INFO L276 IsEmpty]: Start isEmpty. Operand 20725 states and 29636 transitions. [2024-10-12 21:36:50,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 21:36:50,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:50,786 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:50,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:36:50,786 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:50,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:50,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1446023326, now seen corresponding path program 1 times [2024-10-12 21:36:50,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:50,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755065534] [2024-10-12 21:36:50,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:50,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:36:50,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:50,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755065534] [2024-10-12 21:36:50,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755065534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:50,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:50,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:36:50,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562060549] [2024-10-12 21:36:50,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:50,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:50,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:50,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:50,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:50,865 INFO L87 Difference]: Start difference. First operand 20725 states and 29636 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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:36:53,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:53,677 INFO L93 Difference]: Finished difference Result 32745 states and 46038 transitions. [2024-10-12 21:36:53,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:53,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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 90 [2024-10-12 21:36:53,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:53,762 INFO L225 Difference]: With dead ends: 32745 [2024-10-12 21:36:53,762 INFO L226 Difference]: Without dead ends: 26735 [2024-10-12 21:36:53,784 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:36:53,785 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 1059 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2390 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 2940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:36:53,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 735 Invalid, 2940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2390 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 21:36:53,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26735 states. [2024-10-12 21:36:54,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26735 to 26733. [2024-10-12 21:36:54,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26733 states, 26731 states have (on average 1.3770528599753096) internal successors, (36810), 26732 states have internal predecessors, (36810), 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:36:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26733 states to 26733 states and 36810 transitions. [2024-10-12 21:36:54,490 INFO L78 Accepts]: Start accepts. Automaton has 26733 states and 36810 transitions. Word has length 90 [2024-10-12 21:36:54,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:54,491 INFO L471 AbstractCegarLoop]: Abstraction has 26733 states and 36810 transitions. [2024-10-12 21:36:54,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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:36:54,491 INFO L276 IsEmpty]: Start isEmpty. Operand 26733 states and 36810 transitions. [2024-10-12 21:36:54,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 21:36:54,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:54,494 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:54,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:36:54,495 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:54,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:54,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1592155180, now seen corresponding path program 1 times [2024-10-12 21:36:54,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:54,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064625532] [2024-10-12 21:36:54,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:54,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:54,734 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 21:36:54,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:54,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064625532] [2024-10-12 21:36:54,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064625532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:54,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:54,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:36:54,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386901405] [2024-10-12 21:36:54,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:54,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:36:54,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:54,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:36:54,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:36:54,738 INFO L87 Difference]: Start difference. First operand 26733 states and 36810 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 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:36:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:56,231 INFO L93 Difference]: Finished difference Result 132285 states and 190610 transitions. [2024-10-12 21:36:56,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:36:56,231 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 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 100 [2024-10-12 21:36:56,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:56,442 INFO L225 Difference]: With dead ends: 132285 [2024-10-12 21:36:56,442 INFO L226 Difference]: Without dead ends: 117627 [2024-10-12 21:36:56,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:36:56,489 INFO L432 NwaCegarLoop]: 1667 mSDtfsCounter, 9880 mSDsluCounter, 2739 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9880 SdHoareTripleChecker+Valid, 4406 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:36:56,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9880 Valid, 4406 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:36:56,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117627 states. [2024-10-12 21:36:58,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117627 to 41389. [2024-10-12 21:36:58,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41389 states, 41387 states have (on average 1.4012612656148067) internal successors, (57994), 41388 states have internal predecessors, (57994), 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:36:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41389 states to 41389 states and 57994 transitions. [2024-10-12 21:36:58,162 INFO L78 Accepts]: Start accepts. Automaton has 41389 states and 57994 transitions. Word has length 100 [2024-10-12 21:36:58,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:58,163 INFO L471 AbstractCegarLoop]: Abstraction has 41389 states and 57994 transitions. [2024-10-12 21:36:58,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 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:36:58,163 INFO L276 IsEmpty]: Start isEmpty. Operand 41389 states and 57994 transitions. [2024-10-12 21:36:58,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 21:36:58,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:58,169 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:58,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:36:58,169 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:58,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:58,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1181768492, now seen corresponding path program 1 times [2024-10-12 21:36:58,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:58,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816470255] [2024-10-12 21:36:58,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:58,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 21:36:58,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:58,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816470255] [2024-10-12 21:36:58,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816470255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:58,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:58,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:36:58,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36129173] [2024-10-12 21:36:58,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:58,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:36:58,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:58,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:36:58,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:36:58,383 INFO L87 Difference]: Start difference. First operand 41389 states and 57994 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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:37:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:37:00,669 INFO L93 Difference]: Finished difference Result 146941 states and 211794 transitions. [2024-10-12 21:37:00,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:37:00,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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 100 [2024-10-12 21:37:00,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:37:00,867 INFO L225 Difference]: With dead ends: 146941 [2024-10-12 21:37:00,868 INFO L226 Difference]: Without dead ends: 132283 [2024-10-12 21:37:00,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:37:00,909 INFO L432 NwaCegarLoop]: 1664 mSDtfsCounter, 9924 mSDsluCounter, 2610 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9924 SdHoareTripleChecker+Valid, 4274 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:37:00,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9924 Valid, 4274 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:37:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132283 states. [2024-10-12 21:37:03,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132283 to 63405. [2024-10-12 21:37:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63405 states, 63403 states have (on average 1.4133400627730548) internal successors, (89610), 63404 states have internal predecessors, (89610), 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:37:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63405 states to 63405 states and 89610 transitions. [2024-10-12 21:37:03,196 INFO L78 Accepts]: Start accepts. Automaton has 63405 states and 89610 transitions. Word has length 100 [2024-10-12 21:37:03,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:37:03,197 INFO L471 AbstractCegarLoop]: Abstraction has 63405 states and 89610 transitions. [2024-10-12 21:37:03,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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:37:03,197 INFO L276 IsEmpty]: Start isEmpty. Operand 63405 states and 89610 transitions. [2024-10-12 21:37:03,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 21:37:03,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:37:03,201 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:37:03,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:37:03,201 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:37:03,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:37:03,202 INFO L85 PathProgramCache]: Analyzing trace with hash 953129260, now seen corresponding path program 1 times [2024-10-12 21:37:03,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:37:03,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458618860] [2024-10-12 21:37:03,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:37:03,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:37:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:37:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 21:37:03,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:37:03,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458618860] [2024-10-12 21:37:03,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458618860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:37:03,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:37:03,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:37:03,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603974965] [2024-10-12 21:37:03,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:37:03,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:37:03,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:37:03,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:37:03,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:37:03,545 INFO L87 Difference]: Start difference. First operand 63405 states and 89610 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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:37:06,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:37:06,324 INFO L93 Difference]: Finished difference Result 161597 states and 232978 transitions. [2024-10-12 21:37:06,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:37:06,324 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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 100 [2024-10-12 21:37:06,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:37:06,532 INFO L225 Difference]: With dead ends: 161597 [2024-10-12 21:37:06,532 INFO L226 Difference]: Without dead ends: 146939 [2024-10-12 21:37:06,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:37:06,571 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 9999 mSDsluCounter, 2589 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9999 SdHoareTripleChecker+Valid, 4250 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:37:06,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9999 Valid, 4250 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:37:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146939 states. [2024-10-12 21:37:09,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146939 to 78061. [2024-10-12 21:37:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78061 states, 78059 states have (on average 1.4193622772518224) internal successors, (110794), 78060 states have internal predecessors, (110794), 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:37:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78061 states to 78061 states and 110794 transitions. [2024-10-12 21:37:09,214 INFO L78 Accepts]: Start accepts. Automaton has 78061 states and 110794 transitions. Word has length 100 [2024-10-12 21:37:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:37:09,215 INFO L471 AbstractCegarLoop]: Abstraction has 78061 states and 110794 transitions. [2024-10-12 21:37:09,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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:37:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 78061 states and 110794 transitions. [2024-10-12 21:37:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 21:37:09,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:37:09,219 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:37:09,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 21:37:09,220 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:37:09,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:37:09,220 INFO L85 PathProgramCache]: Analyzing trace with hash 327473196, now seen corresponding path program 1 times [2024-10-12 21:37:09,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:37:09,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750692757] [2024-10-12 21:37:09,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:37:09,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:37:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:37:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 21:37:09,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:37:09,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750692757] [2024-10-12 21:37:09,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750692757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:37:09,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:37:09,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:37:09,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183247183] [2024-10-12 21:37:09,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:37:09,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:37:09,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:37:09,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:37:09,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:37:09,375 INFO L87 Difference]: Start difference. First operand 78061 states and 110794 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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:37:12,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:37:12,732 INFO L93 Difference]: Finished difference Result 176253 states and 254162 transitions. [2024-10-12 21:37:12,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:37:12,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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 100 [2024-10-12 21:37:12,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:37:13,016 INFO L225 Difference]: With dead ends: 176253 [2024-10-12 21:37:13,017 INFO L226 Difference]: Without dead ends: 161595 [2024-10-12 21:37:13,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:37:13,068 INFO L432 NwaCegarLoop]: 1658 mSDtfsCounter, 10065 mSDsluCounter, 2556 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10065 SdHoareTripleChecker+Valid, 4214 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:37:13,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10065 Valid, 4214 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:37:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161595 states. [2024-10-12 21:37:15,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161595 to 92717. [2024-10-12 21:37:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92717 states, 92715 states have (on average 1.4234805587013968) internal successors, (131978), 92716 states have internal predecessors, (131978), 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:37:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92717 states to 92717 states and 131978 transitions. [2024-10-12 21:37:15,965 INFO L78 Accepts]: Start accepts. Automaton has 92717 states and 131978 transitions. Word has length 100 [2024-10-12 21:37:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:37:15,966 INFO L471 AbstractCegarLoop]: Abstraction has 92717 states and 131978 transitions. [2024-10-12 21:37:15,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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:37:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 92717 states and 131978 transitions. [2024-10-12 21:37:15,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 21:37:15,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:37:15,971 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:37:15,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 21:37:15,971 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:37:15,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:37:15,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1216206636, now seen corresponding path program 1 times [2024-10-12 21:37:15,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:37:15,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242824513] [2024-10-12 21:37:15,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:37:15,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:37:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:37:16,423 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 21:37:16,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:37:16,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242824513] [2024-10-12 21:37:16,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242824513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:37:16,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:37:16,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:37:16,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668411858] [2024-10-12 21:37:16,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:37:16,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:37:16,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:37:16,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:37:16,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:37:16,425 INFO L87 Difference]: Start difference. First operand 92717 states and 131978 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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:37:20,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:37:20,336 INFO L93 Difference]: Finished difference Result 190909 states and 275346 transitions. [2024-10-12 21:37:20,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:37:20,339 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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 100 [2024-10-12 21:37:20,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:37:20,603 INFO L225 Difference]: With dead ends: 190909 [2024-10-12 21:37:20,604 INFO L226 Difference]: Without dead ends: 176251 [2024-10-12 21:37:20,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:37:20,634 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 9919 mSDsluCounter, 2636 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9919 SdHoareTripleChecker+Valid, 4297 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:37:20,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9919 Valid, 4297 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:37:20,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176251 states. [2024-10-12 21:37:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176251 to 107373. [2024-10-12 21:37:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107373 states, 107371 states have (on average 1.4264745601698783) internal successors, (153162), 107372 states have internal predecessors, (153162), 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:37:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107373 states to 107373 states and 153162 transitions. [2024-10-12 21:37:24,290 INFO L78 Accepts]: Start accepts. Automaton has 107373 states and 153162 transitions. Word has length 100 [2024-10-12 21:37:24,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:37:24,291 INFO L471 AbstractCegarLoop]: Abstraction has 107373 states and 153162 transitions. [2024-10-12 21:37:24,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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:37:24,291 INFO L276 IsEmpty]: Start isEmpty. Operand 107373 states and 153162 transitions. [2024-10-12 21:37:24,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 21:37:24,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:37:24,296 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:37:24,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 21:37:24,297 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:37:24,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:37:24,297 INFO L85 PathProgramCache]: Analyzing trace with hash 913185324, now seen corresponding path program 1 times [2024-10-12 21:37:24,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:37:24,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084518547] [2024-10-12 21:37:24,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:37:24,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:37:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:37:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 21:37:24,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:37:24,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084518547] [2024-10-12 21:37:24,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084518547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:37:24,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:37:24,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:37:24,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494548558] [2024-10-12 21:37:24,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:37:24,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:37:24,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:37:24,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:37:24,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:37:24,444 INFO L87 Difference]: Start difference. First operand 107373 states and 153162 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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)